Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

ICSOFT
2007

favoriteEmaildiscussreport

164views Software Engineering» more ICSOFT 2007»

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

14 years 9 days ago

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

Download www.eecg.toronto.edu

Franjo Plavec, Zvonko G. Vranesic, Stephen Dean Br

Real-time Traffic

ICSOFT 2007 | Software Engineering |

claim paper

Related Content

» Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions

» Exploring the duality between skip lists and binary search trees

» Searching large indexes on tiny devices optimizing binary search with character pinning

» A practical concurrent binary search tree

» Compression of large binary images in digital spatial libraries

» A NearLinear Area Bound for Drawing Binary Trees

» On Efficient Construction of Decision Trees from Large Databases

» Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes

» Balanced Aspect Ratio Trees Revisited

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	ICSOFT
Authors	Franjo Plavec, Zvonko G. Vranesic, Stephen Dean Brown

Comments (0)