Depth of a random binary search tree with concurrent insertions

DOI10.1007/978-3-662-53426-7_27MaRDI QIDQ1660946zbMATH OpenOpenAlexFDO

Authors James Aspnes, Eric Ruppert

Publication date 16 August 2018

Full work available at URL https://doi.org/10.1007/978-3-662-53426-7_27

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
• Randomized binary search trees
• Average depth in a binary search tree with repeated keys
• Randomization of search trees by subtree size
• Algorithms and Computation

Cited in

(2)

• Insertion depth in power-weight trees
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions

This page was built for publication: Depth of a random binary search tree with concurrent insertions

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