A note on predecessor searching in the pointer machine model

DOI10.1016/J.IPL.2009.03.003zbMath1213.68336OpenAlexW2104816856MaRDI QIDQ989469

Wolfgang Mulzer

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.003

zbMATH Keywords

analysis of algorithmsdata structureslower boundpointer machinepredecessor searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

Data structures on event graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Optimal bounds for the predecessor problem and related problems
• Time-space trade-offs for predecessor search
• A Lower Bound on the Complexity of the Union-Split-Find Problem
• Storage Modification Machines
• Design and implementation of an efficient priority queue

This page was built for publication: A note on predecessor searching in the pointer machine model