Uniform distribution modulo one and binary search trees

DOI10.5802/JTNB.366zbMATH Open1075.11054OpenAlexW2326842096MaRDI QIDQ558117FDOQ558117

Authors: Peter van der Wal, F. Michel Dekking 

Publication date: 30 June 2005

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2002__14_2_415_0

Recommendations

• A limiting distribution for quicksort
• A note on the height of binary search trees
• The height of a binary search tree: the limiting distribution perspective.
• scientific article; zbMATH DE number 852055
• On the Variance of the Height of Random Binary Search Trees

zbMATH Keywords

uniform distributionbinary search trees

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) General theory of distribution modulo (1) (11K06)

Cites Work

• Quicksort
• A note on the height of binary search trees
• Title not available (Why is that?)
• Asymptotical growth of a class of random trees
• Renormalisation of curlicues
• Uniform distribution modulo one: a geometrical viewpoint.
• A study of random Weyl trees
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Quicksort

This page was built for publication: Uniform distribution modulo one and binary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558117)