A note on predecessor searching in the pointer machine model

DOI10.1016/J.IPL.2009.03.003zbMATH Open1213.68336OpenAlexW2104816856MaRDI QIDQ989469FDOQ989469

Authors: 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

Recommendations

• Time-space trade-offs for predecessor search
• Optimal bounds for the predecessor problem
• Optimal bounds for the predecessor problem and related problems
• A lower bound for finding predecessors in Yao's cell probe model
• An algorithm for finding predecessors in integer sets

zbMATH Keywords

analysis of algorithmsdata structureslower boundpointer machinepredecessor searching

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Efficient algorithms for the temporal precedence problem
• The temporal precedence problem

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

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