B-treaps revised: write efficient randomized block search trees with high load

DOI10.4230/LIPICS.WADS.2025.47MaRDI QIDQ7312599zbMATH OpenFDO

Authors Roodabeh Safavi, Martin P. Seybold

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WADS.2025.47

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• A simple dynamization of trapezoidal point location in planar subdivisions
• A unifying look at data structures
• Anti-persistence
• B-Treaps: A Uniquely Represented Alternative to B-Trees
• Computational geometry. Algorithms and applications.
• Expected behaviour of \(B^+\)-trees under random insertions
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• Making data structures persistent
• New Tight Bounds on Uniquely Represented Dictionaries
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Randomized search trees
• Red-black trees with constant update time
• Storage utilization in B*-trees with a generalized overflow technique
• The buffer tree: A technique for designing batched external data structures
• Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
• Uniquely Represented Data Structures for Computational Geometry

This page was built for publication: B-treaps revised: write efficient randomized block search trees with high load

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