Depth of a random binary search tree with concurrent insertions

DOI10.1007/978-3-662-53426-7_27zbMath1393.68044OpenAlexW2507118568MaRDI QIDQ1660946

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)

Related Items (1)

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