Sciweavers

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

33

DMTCS
2002

favoriteEmaildiscussreport

108views Mathematics» more DMTCS 2002»

The height of q-Binary Search Trees

13 years 10 months ago

The height of q-Binary Search Trees

Download www.dmg.tuwien.ac.at

Abstract. q

Michael Drmota, Helmut Prodinger

Real-time Traffic

DMTCS 2002 | Gaussian Limit Law | Geometric Distribution | Mathematics | Qbinary Search Trees |

claim paper

Related Content

» Smoothed Analysis of Binary Search Trees

» Large Deviations for the Weighted Height of an Extended Class of Trees

» Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise

» Deletion without Rebalancing in Multiway Search Trees

» Weighted height of random trees

» The power of two minhashes for similarity search among hierarchical data objects

» Improving Index Performance through Prefetching

» RankBalanced Trees

» An Analysis of the Height of Tries with Random Weights on the Edges

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DMTCS
Authors	Michael Drmota, Helmut Prodinger

Comments (0)