### Table 5. Results for reachability, stability and oscillation queries in experimental-like data.

2007

Cited by 1

### Table 1 All the update bounds (old and new) are amortized. Throughout this paper, our query times are optimal but there is one-sided inverse polynomial error in the query-answer Maintaining all-pairs reachability Query

2003

### Table 2. Decremental reachability algorithms.

2002

"... In PAGE 2: ... [1]. A sum- mary of previous decremental algorithms for maintaining the transitive closure, and for answering reachability queries is given in Table2 . (All the algorithms there, except that of Henzinger and King [10], explicitly maintain the transitive closure matrix.... ..."

Cited by 16

### Table 2. Decremental reachability algorithms.

2002

"... In PAGE 2: ... [1]. A sum- mary of previous decremental algorithms for maintaining the transitive closure, and for answering reachability queries is given in Table2 . (All the algorithms there, except that of Henzinger and King [10], explicitly maintain the transitive closure matrix.... ..."

Cited by 16

### Table V. Decidability Results: SAT D Satisfiability, QR D Query Reachability, EQ D Equivalence, CN D Containment Datalog restriction/extension Sat/QR EQ/CN

2003

Cited by 58

### Table 3.2: Interpreting expressions for reachable uses. INA is the query set passed down from A apos;s parent. OUTA is the remaining query following application of A apos;s equations. Operator op is any other non-assignment operator.

1997

Cited by 13

### Table 3.2: Interpreting expressions for reachable uses. INA is the query set passed down from A apos;s parent. OUTA is the remaining query following application of A apos;s equations. Operator op is any other non-assignment operator.

1997

Cited by 13

### Table 1: Fully dynamic reachability algorithms.

2004

"... In PAGE 2: ... This is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges. The new algorithm and some of the previously existing algorithms for the dynamic reachability problem are compared in Table1 . Our algorithm has the fastest update time, among all algorithms that work on all graphs, but alas the slowest query time.... ..."

### Table 1: Fully dynamic reachability algorithms.

"... In PAGE 2: ... This is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges. The new algorithm and some of the previously existing algorithms for the dynamic reachability problem are compared in Table1 . Our algorithm has the fastest update time, among all algorithms that work on all graphs, but alas the slowest query time.... ..."

### Table 1. Results for reachability (maximum value), stability (bottom and top values in the last third part of the trace) and amplitude of at least n oscillations.

2007

"... In PAGE 9: ...trace. Table1 gives the maximum reachable values for the four species displayed... In PAGE 9: ... It is obtained for Cdc2 with the query oscil(Cdc2,3), stating that there are only two oscillations of Cdc2 in the trace. The results for the other species are given in Table1 . Obtaining the amplitude of the oscillations is useful to distinguish between mixed amplitudes oscillations in the trace.... ..."

Cited by 1