A Distribution-Sensitive Dictionary with Low Space Overhead

DOI10.1007/978-3-642-03367-4_10zbMath1253.68104OpenAlexW1482472825MaRDI QIDQ3183445

Pat Morin, Prosenjit Bose, John Howat

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.library.carleton.ca/pub/4518

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Biased predecessor search

Cites Work

• 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
• Implicit dictionaries with O(1) modifications per update and fast search
• Self-adjusting binary search trees
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Distribution-Sensitive Dictionary with Low Space Overhead