### Table 2: The values of average-case and worst-case information measures in Example 1.

2003

"... In PAGE 10: ...4. Table2 gives average-case and worst-case information measures (with CU BP D0D3CV) for the three randomization operators from Exam- ple 1 (see Section 3). The table shows that CABD is more sensitive to upward privacy breaches, CABE is more sensitive to downward pri- vacy breaches, and CABF has little sensitivity to both of them.... ..."

Cited by 128

### Table 2: The values of average-case and worst-case information measures in Example 1.

2003

"... In PAGE 10: ...4. Table2 gives average-case and worst-case information measures (with a210a77a23 a61 a153 a46a63 ) for the three randomization operators from Exam- ple 1 (see Section 3). The table shows that a66 a54 is more sensitive to upward privacy breaches, a66 a93 is more sensitive to downward pri- vacy breaches, and a66 a37 has little sensitivity to both of them.... ..."

Cited by 128

### Table 2: The values of average-case and worst-case information measures in Example 1.

2003

"... In PAGE 10: ...4. Table2 gives average-case and worst-case information measures (with a210a77a23 a61 a153 a46a63 ) for the three randomization operators from Exam- ple 1 (see Section 3). The table shows that a66 a54 is more sensitive to upward privacy breaches, a66 a93 is more sensitive to downward pri- vacy breaches, and a66 a37 has little sensitivity to both of them.... ..."

Cited by 128

### TABLE VI AVERAGE-CASE PERFORMANCE COMPARISON BETWEEN AVERAGE-CASE AND WORST-CASE MAPPERS. ACR CORRESPONDS TO CIRCUITS OPTIMIZED FOR THE AVERAGE-CASE WITH ROTATION. WC CORRESPONDS TO CIRCUITS OPTIMIZED FOR THE WORST-CASE. DELAYS ARE MEASURED IN NANO-SECONDS.

1999

Cited by 2

### Table 2: Worst-case complexity measures

"... In PAGE 26: ... The question mark in the row of ray classi cation indicates that it was not possible to analyze preprocessing time and memory requirement separately since the ray classi cation data structure is built in a \lazy eval- uation quot; fashion during the tracing phase instead of a separate preprocessing phase. Table2 surveys the worst-case complexity of these algorithms in order to allow comparison. It illustrates that the heuristic algorithms are much better in the average case than in the worst case.... ..."

### Table 2: Worst case, average case, vs. probabilistic case

1997

"... In PAGE 4: ... This is because in each iteration the ET method finds the local optimal place; however, scheduling nodes to these positions does not always result in the global optimal schedule length. In Table2 , based on the system that has 2 adders and 1 mul- tiplier, we present the comparison results obtained from apply- ing list scheduling, traditional rotation scheduling, probabilistic rotation scheduling using TS, and traditional rotation schedul- ing considering expected computation times, to the benchmarks. Columns L and R show the schedule length obtained from applying list scheduling and traditional rotation scheduling using TS when considering the worst case scenario.... ..."

Cited by 3

### Table III. Limiting Worst-Case and Average-Case Errors, Bits per Symbol, as pn 3 0

1995

Cited by 111

### Table 2. Analysis of (worst-case) H and (average-case) H

2006

Cited by 3

### Table 1: Normalized Worst case and Average Case Throughput

2005

"... In PAGE 5: ... We adopt the same technique and evaluate the average-case throughput of O1TURN with a sample size of one million random permutations. The average-case throughputs for 8x8 and 4x4 networks are tabulated in Table1 . (The table also includes the saturation throughputs of the four oblivi- ous routing algorithms under various traffic patterns.... ..."

Cited by 10