### Table 1: Tight bounds on closeness of synchronization.

2001

Cited by 11

### Table 1: Tightness of Heuristic Register Bound

"... In PAGE 16: ... Notice that underestimations are often xed by the sequencing algorithm. All the results presented in Table1 (a) are for small DDGs with a low MRR for which the ILP method can nd a solution.... In PAGE 17: ...E ectiveness of Heuristic Methods in Larger DDGs How good is our heuristic solution for the 181 DDGs for which the ILP approach failed to nd an optimal solution? The rst column of Table1 (b) reports the number of DDGs for which an instruction sequence was found that used HRB registers. The table also shows the number of DDGs for which the instruction sequence requires more registers than HRB, the average register increase and the maximum register increase for each method.... ..."

### Table 1: Bounds on the size of monotone dynamos, for tori of m n vertices; N = minfm; ng, and H; K = m; n or H; K = n; m (choose the alternative that yields stricter bounds). The asterisk denotes a worst case.

"... In PAGE 3: ... We derive lower and upper bounds on the size of irreversible and monotone dynamos for each of these topologies and for each majority rule. These bounds, summarized in Table1 , are tight within an additive constant. The upper bounds are constructive.... ..."

### Table 1: A in an entry in any of the tables indicates that the bound is tight.

1998

"... In PAGE 2: ... In this paper, we present bounds on the number of rounds needed for basic problems on a p-processor machine, where p n. Our lower bound results are tabulated in four tables in Table1 . A brief description of some upper bounds is given in Section 8.... ..."

### Table 1: A#02inanentry in any of the tables indicates that the bound is tight.

in Abstract

1998

"... In PAGE 2: ... In this paper, we present bounds on the number of rounds needed for basic problems on a p-processor machine, where p #14 n. Our lower bound results are tabulated in four tables in Table1 . A brief description of some upper bounds is given in Section 8.... ..."

### Table 1. Summary of complexity results (all bounds are tight)

2000

"... In PAGE 5: ... In the following, without loss of generality, we con- sider only the problem of checking whether a pair of objects is a certain answer of a query. 3 Summary of Results and Related Work The summary of our results on the complexity of an- swering regular path queries using views is reported in Table1 . Entries with all sound (resp.... ..."

Cited by 58