A note on predecessor searching in the pointer machine model
From MaRDI portal
(Redirected from Publication:989469)
Recommendations
Cites work
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3081677 (Why is no real title available?)
- A Lower Bound on the Complexity of the Union-Split-Find Problem
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Design and implementation of an efficient priority queue
- Optimal bounds for the predecessor problem and related problems
- Storage Modification Machines
- Time-space trade-offs for predecessor search
Cited in
(3)
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)