B-Treaps: A Uniquely Represented Alternative to B-Trees

DOI10.1007/978-3-642-02927-1_41MaRDI QIDQ3638058zbMATH OpenOpenAlexFDO

Authors Daniel Golovin

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_41

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Belga B-trees
• Belga B-trees
• Fully persistent B-trees
• Topology B-trees and their applications
• Fully persistent B-trees

Cited in

(5)

• Uniquely Represented Data Structures for Computational Geometry
• B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
• Online list labeling: breaking the ^2n barrier
• History-independent concurrent objects
• B-treaps revised: write efficient randomized block search trees with high load

This page was built for publication: B-Treaps: A Uniquely Represented Alternative to B-Trees

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