Randomization of search trees by subtree size

DOI10.1007/3-540-61680-2_49MaRDI QIDQ4595480zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Salvador Roura, Conrado Martínez

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/97227

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05)

Recommendations

• Randomized binary search trees
• Randomized search trees
• Maintaining Ideally Distributed Random Search Trees without Extra Space
• Random binary search tree with equal elements
• Randomness Preserving Deletions on Special Binary Search Trees

Cited in

(7)

• Maintaining Ideally Distributed Random Search Trees without Extra Space
• Algorithms and Computation
• Random binary search tree with equal elements
• Depth of a random binary search tree with concurrent insertions
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• Analysis of the space of search trees under the random insertion algorithm
• Randomized binary search trees

This page was built for publication: Randomization of search trees by subtree size

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