502 search results - page 2 / 101 » Verifying Balanced Trees |
104
Voted
STACS
1999
Springer
15 years 4 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
92
Voted
OPODIS
2004
15 years 1 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
188
Voted
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
111
Voted
ICSOFT
2007
15 years 1 months ago
2007