### Table 1: Upper bounds for OBDDs for functions representable by tree-like circuits.

1996

"... In PAGE 12: ... Proof: We have size(f; f) = apos;(size(f); size(f; f)) apos;(size(f)= size(f; f); 1)?1 apos;(1; 2) n apos;(0:5; 1)?1 = 2 n : The claim follows with the result of Theorem 4. 2 In Table1 we present concrete values of our upper bounds.... ..."

Cited by 2

### Table 1: Upper bounds for OBDDs for functions representable by tree-like circuits.

1996

"... In PAGE 12: ... Proof: We have size(f; f) = apos;(size(f); size(f; f)) apos;(size(f)= size(f; f); 1)?1 apos;(1; 2) n apos;(0:5; 1)?1 = 2 n : The claim follows with the result of Theorem 4. 2 In Table1 we present concrete values of our upper bounds.... ..."

Cited by 2

### Table 1 describes the equivalence between di erent types of tree-like circuits of polynomial degree and programs of polynomial length, and gives the relation with some important complexity classes.

"... In PAGE 8: ... Table1 : Relationship between di erent complexity classes, polynomial-length pro- grams and polynomial-degree tree-like circuits... In PAGE 9: ...be tempted to conjecture that the only inequality in Table1 can be replaced by an equality. However, things are not so clear, as the following discussion shows.... ..."

### Table 3: Amortized time complexity of DynamicList structure T1 T2 T3 Enqueue O(log(n)) O(1) O(1)

"... In PAGE 5: ... The tree-like structure ensures that each subsequent enqueue into T1 is of O(log(n)) complexity. Table3 summarizes the theoretical performance of DynamicList. Table 3: Amortized time complexity of DynamicList structure T1 T2 T3 Enqueue O(log(n)) O(1) O(1) ... ..."

### Table 3: Survey of Distributed and P2P Search in the Design Space

2004

Cited by 4

### Table 7: Percentage Distribution of R amp;D Expenditure by Field of Science* Research and Basic Applied Development

### Table 2: Tree Data

"... In PAGE 14: ... We believe this to be very encouraging as trees are not likely to ever contain this many possible paths. Table2 below provides some statistics for the trees. S refers to the smallest tree, L refers to the largest tree, and #Paths (T) gives the total number of paths for each train.... ..."

### Table 2: Distribution of Shares Among the Main Groups of Shareholders (% of the number of answers)*

"... In PAGE 9: ...) managed to obtain property rights at some enterprises, but for the present, they rarely succeed in receiving control over equity. These tendencies can be con rmed by survey data referring to the distribution of shares at the end of 1995, see Table2 . More detailed recent results concerning enterprise ownership and governance are presented in [11].... ..."