### Table 3: Coding for stability level

"... In PAGE 3: ... We say that a node has low stability if 0 lt; stab(x) 0:5 and that it has medium stability if 0:5 lt; stab(x) lt; 1. Similarly, Table3 shows the code associated with the stability. Table 3: Coding for stability level... ..."

### Table I. Stabilizer for the 9-qubit code

2004

### Table 3: The computed path stability for random topologies with and without using RTT smoothing.

2005

"... In PAGE 11: ... When the query reacts to any changes in the link RTTs, the computed paths become less stable. This instability is quan- ti ed by the rst two lines of Table3 , which shows results for the Sparse-Random and Dense-Random topologies. Only 33% and 22% of all paths remain unchanged after the ini- tial query execution, and the shortest path between each pair of nodes changes on average 3:8, and 4:4, respectively.... In PAGE 11: ... We note that this estimation algorithm can be easily expressed in Datalog. As shown in Table3 , smoothing the link RTTs is e ective: the percentage of stable paths doubles, while the number of changes per path decreases by up to three times. Smoothing also leads to a reduction of the overhead as fewer paths need to be recomputed.... ..."

Cited by 1

### Table 3: The computed path stability for random topologies with and without using RTT smoothing.

2005

"... In PAGE 11: ... When the query reacts to any changes in the link RTTs, the computed paths become less stable. This instability is quan- ti ed by the rst two lines of Table3 , which shows results for the Sparse-Random and Dense-Random topologies. Only 33% and 22% of all paths remain unchanged after the ini- tial query execution, and the shortest path between each pair of nodes changes on average 3:8, and 4:4, respectively.... In PAGE 11: ... We note that this estimation algorithm can be easily expressed in Datalog. As shown in Table3 , smoothing the link RTTs is e ective: the percentage of stable paths doubles, while the number of changes per path decreases by up to three times. Smoothing also leads to a reduction of the overhead as fewer paths need to be recomputed.... ..."

Cited by 1

### Table 3.2: The stabilizer for the five-qubit code.

2004

### Table 3.3: The stabilizer for the eight-qubit code.

2004

### Table 8.1: The stabilizer for a [16; 10; 3] code.

2004

### Table 8.2: The stabilizer for a [16; 6; 4] code.

2004

### Table 8.3: The stabilizer for the [8; 0; 4] code.

2004

### Table 8.5: The stabilizer for an [11; 1; 5] code.

2004