Predecessor queries in dynamic integer sets
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7700589
- An algorithm for finding predecessors in integer sets
- Unit-time predecessor queries on massive data sets
- Range selection and predecessor queries in data aware space and time
- Cache-oblivious iterated predecessor queries via range coalescing
- Consecutive interval query and dynamic programming on intervals
- scientific article; zbMATH DE number 1354129
- Time-space trade-offs for predecessor search
- Non-adaptive data structure bounds for dynamic predecessor
- Dynamic ordered sets with approximate queries, approximate heaps and soft heaps
Cites work
- A new data structure for representing sorted lists
- Design and implementation of an efficient priority queue
- scientific article; zbMATH DE number 1263186 (Why is no real title available?)
- scientific article; zbMATH DE number 1306898 (Why is no real title available?)
- scientific article; zbMATH DE number 742994 (Why is no real title available?)
- scientific article; zbMATH DE number 2102768 (Why is no real title available?)
- scientific article; zbMATH DE number 871900 (Why is no real title available?)
- Lower bounds for union-split-find related problems on random access machines
- Preserving order in a forest in less than logarithmic time and linear space
- Priority queues: small, monotone and trans-dichotomous
- Surpassing the information theoretic bound with fusion trees
- The buffer tree: A new technique for optimal I/O-algorithms
- The design of dynamic data structures
- The randomized complexity of maintaining the minimum
Cited in
(10)- Optimal bounds for the predecessor problem and related problems
- Range selection and predecessor queries in data aware space and time
- Delta-fast tries: local searches in bounded universes with linear space
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- Unit-time predecessor queries on massive data sets
- Data Structures with Local Update Operations
- An algorithm for finding predecessors in integer sets
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Dynamic Elias-Fano representation
- Algorithms – ESA 2005
This page was built for publication: Predecessor queries in dynamic integer sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047156)
