New method in information processing for maintaining an efficient dynamic ordered set
From MaRDI portal
(Redirected from Publication:848256)
Recommendations
- Surpassing the information theoretic bound with fusion trees
- Dynamic ordered sets with exponential search trees
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- A new representation of binary search trees
- Digital access to comparison-based tree data structures and algorithms
Cites work
- scientific article; zbMATH DE number 1303596 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- Cache-oblivious priority queue and graph algorithm applications
- Compact representations of ordered sets
- Deterministic sorting in O ( n log log n ) time and linear space
- Dynamic ordered sets with exponential search trees
- Dynamic string searching
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Notes on the complexity of sorting in abstract machines
- On RAM Priority Queues
- The complexity of searching a sorted array of strings
Cited in
(2)
This page was built for publication: New method in information processing for maintaining an efficient dynamic ordered set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848256)
