New method in information processing for maintaining an efficient dynamic ordered set
From MaRDI portal
Publication:848256
DOI10.1007/S11432-009-0074-0zbMATH Open1191.68215OpenAlexW2058294003MaRDI QIDQ848256FDOQ848256
Authors: Guojin Wang, Shiqing Xin 
Publication date: 3 March 2010
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-009-0074-0
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic ordered sets with exponential search trees
- Deterministic sorting in O ( n log log n ) time and linear space
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Cache-oblivious priority queue and graph algorithm applications
- Compact representations of ordered sets
- On RAM Priority Queues
- Notes on the complexity of sorting in abstract machines
- Dynamic string searching
- The complexity of searching a sorted array of strings
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
