Search Sciweavers | Sciweavers

11

STACS
1999
Springer

144views Theoretical Computer Science» more STACS 1999»

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

13 years 10 months ago

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 eﬃcient ...

Ming-Yang Kao, Andrzej Lingas, Anna Östlin

claim paper

Read More »

16

click to vote

OPODIS
2004

93views Distributed And Parallel Com...» more OPODIS 2004»

Self-tuning Reactive Distributed Trees for Counting and Balancing

13 years 7 months ago

Download www.cse.chalmers.se

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...

Phuong Hoai Ha, Marina Papatriantafilou, Philippas...

claim paper

Read More »

19

click to vote

ESOP
2009
Springer

93views Programming Languages» more ESOP 2009»

Verified, Executable Parsing

13 years 10 months ago

Download nicta.com.au

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...

Aditi Barthwal, Michael Norrish

claim paper

Read More »

52

click to vote

Book

2145views

An Introduction to Binary Search Trees and Balanced Trees

15 years 4 months ago

Download www.stanford.edu

"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 ...

Ben Pfaff

posted by scimaster

Read More »

25

click to vote

ICSOFT
2007

164views Software Engineering» more ICSOFT 2007»

On Digital Search Trees - A Simple Method for Constructing Balanced Binary Trees

13 years 7 months ago

Download www.eecg.toronto.edu

Franjo Plavec, Zvonko G. Vranesic, Stephen Dean Br...

claim paper