Predecessor queries in dynamic integer sets

DOI10.1007/BFb0023445zbMath1498.68087OpenAlexW1598617684MaRDI QIDQ5047156

Gerth Stølting Brodal

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0023445

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Trans-dichotomous algorithms without multiplication — some upper and lower bounds ⋮ Optimal bounds for the predecessor problem and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• A new data structure for representing sorted lists
• Preserving order in a forest in less than logarithmic time and linear space
• Surpassing the information theoretic bound with fusion trees
• Lower bounds for union-split-find related problems on random access machines
• Design and implementation of an efficient priority queue
• Priority queues: Small, monotone and trans-dichotomous
• The randomized complexity of maintaining the minimum
• The buffer tree: A new technique for optimal I/O-algorithms

This page was built for publication: Predecessor queries in dynamic integer sets