A distribution-sensitive dictionary with low space overhead
From MaRDI portal
Publication:414433
DOI10.1016/j.jda.2011.11.003zbMath1242.68080OpenAlexW2004160229MaRDI QIDQ414433
Prosenjit Bose, Pat Morin, John Howat
Publication date: 11 May 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.11.003
Cites Work
- Unnamed Item
- Unnamed Item
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Queaps
- A unified access bound on comparison-based dynamic dictionaries
- A data structure for a sequence of string accesses in external memory
- Layered Working-Set Trees
- Implicit dictionaries with O(1) modifications per update and fast search
- Self-adjusting binary search trees
- Algorithms and Data Structures
This page was built for publication: A distribution-sensitive dictionary with low space overhead
