Lazy B-trees

DOI10.4230/LIPICS.MFCS.2025.87MaRDI QIDQ7310262zbMATH OpenFDO

Authors Casper Moldrup Rysgaard, Sebastian Wild

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.87

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A faster external memory priority queue with DecreaseKeys
• An almost optimal algorithm for unbounded searching
• Automata, Languages and Programming
• Biased Search Trees
• Biased skip lists
• DecreaseKeys are expensive for external memory priority queues
• Deferred Data Structuring
• Deterministic cache-oblivious funnelselect
• Dynamic deferred data structuring
• Dynamic online multiselection in internal and external memory
• External memory priority queues with decrease-key and applications to graph algorithms
• External memory soft heap, and hard heap, a meldable priority queue
• Fibonacci heaps and their uses in improved network optimization algorithms
• Funnelselect: Cache-oblivious multiple selection
• scientific article; zbMATH DE number 1670671 (Why is no real title available?)
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 5764838 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• Lazy search trees
• Maximizing the optimality streak of deferred data structuring (a.k.a. database cracking)
• Near-optimal online multiselection in internal and external memory
• Optimal Time Minimal Space Selection Algorithms
• Organization and maintenance of large ordered indexes
• Randomized binary search trees
• Randomized search trees
• Selectable heaps and optimal lazy search trees
• Selection from heaps, row-sorted matrices, and X+Y using soft heaps
• Self-adjusting binary search trees
• Strict Fibonacci heaps
• The buffer tree: A new technique for optimal I/O-algorithms
• The buffer tree: A technique for designing batched external data structures
• The geometry of binary search trees
• Time bounds for selection
• Two New Kinds of Biased Search Trees
• Worst-case efficient external-memory priority queues

This page was built for publication: Lazy B-trees

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