### Table 3: Binary search tree

"... In PAGE 17: ... Table3 shows that if the elements are inserted in ascending order, the constructed tree is in fact a linear list where the element representing the minimum is at the root and the maximum at the end. The method getMax() is called twice in the postcondition, once to get the maximum of the old tree and once to get the maximum of the tree after inserting the new element.... ..."

### Table 1 Single-source directed animals Forests of binary trees S(4132;4231;4312;4321)

1998

### Table 1: Algorithm Tree Search. 6

1997

"... In PAGE 5: ... Once all unexplored branches are exhausted, the robot returns to the origin and chooses the next root-to-leaf path. A description of our strategy in a more algorithmic notation can be found in Table1 . We use P to denote the explored length of a path P.... ..."

Cited by 1

### Table 1, Tv is a binary tree. However, if the wire length is al- lowed to be zero, then any tree structure can be represented as a binary tree. In this work, bu ers are only allowed to be inserted right above a node and no bu er is allowed to insert above a leaf node.

"... In PAGE 2: ... 2.1 Notations Table1 lists the notations used throughout this paper. In Table 1, Tv is a binary tree.... In PAGE 2: ... Table1 : Notations in this work 2.2 Delay and Power Models There are two delay components in a clock-tree: interconnect- delay and gate-delay.... ..."

### Table 1, Tv is a binary tree. However, if the wire length is al- lowed to be zero, then any tree structure can be represented as a binary tree.

2003

"... In PAGE 2: ... Minimum-Delay / Area Zero- Skew Wire-Sizing (min-ZSWS) Problem Given a clock tree T, nd a set of feasible wire widths that achieves the target delay/area such that the zero-skew con- straint is satis ed and the area/delay is also minimized. Table1 lists the notations used throughout this paper. In Table 1, Tv is a binary tree.... In PAGE 2: ... Table1 : Notations for the min-ZSWS problem 2.1 The concept of DC Region For most general routing-tree wire-sizing problems, only the maximum delay is constrained.... ..."

Cited by 3

### Table 1, Tv is a binary tree. However, if the wire length is al- lowed to be zero, then any tree structure can be represented as a binary tree.

2003

"... In PAGE 2: ... Minimum-Delay / Area Zero- Skew Wire-Sizing (min-ZSWS) Problem Given a clock tree T, nd a set of feasible wire widths that achieves the target delay/area such that the zero-skew con- straint is satis ed and the area/delay is also minimized. Table1 lists the notations used throughout this paper. In Table 1, Tv is a binary tree.... In PAGE 2: ... Table1 : Notations for the min-ZSWS problem 2.1 The concept of DC Region For most general routing-tree wire-sizing problems, only the maximum delay is constrained.... ..."

Cited by 3

### Table 3: TopSpin: path lengths and search extent. Algorithm length # visited

"... In PAGE 7: ... The task of the Online Learning to Search mechanism was to discover during the 100 online rounds, which of the large set of candidate features truly contributes to the heuristic search. Table3 displays the fact that although the abstract features were an arbitrary selection, the Online Learning to Search mechanism, managed to tune onto a set of weights that maintained admissibility, while significantly pruning down the search process. 3 Table 3: TopSpin: path lengths and search extent.... ..."

### Table 1. Statistics about search tree results for three feedback algorithms and the two display strategies

2005

"... In PAGE 11: ... The RF rank of an ideal user is the minimum path length from the root of the tree to a node with the target, whereas the mean length of all paths leading to the target represents the average performance of a successful user. The first row in Table1 is the probability that a search (using a given display scheme) will be successful, and row two is the probability that a non-ideal user will find the target. For the Top-K display strategy, about 50% of the trees contain the target (lower for RSJ).... ..."

Cited by 1

### Table 3: Size of Trees: Average Path Length

1997

"... In PAGE 43: ...f the tree to a leaf. For instance, the average path length of the tree of Figure 15 is 1.67 since there are two paths of length 2 and one of length 1. In Table3 you will nd the results of our measurements, where the size of the generated trees is measured in average... ..."

Cited by 3