A tradeoff between search and update in dictionaries

DOI10.1016/S0020-0190(01)00173-9zbMath1003.68034OpenAlexW1970976560MaRDI QIDQ1607123

Venkatesh Raman

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00173-9

zbMATH Keywords

implicit dictionaries

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Implicit \(B\)-trees: A new data structure for the dictionary problem ⋮ Computing (and Life) Is All about Tradeoffs

Cites Work

• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• A tradeoff between search and update time for the implicit dictionary problem
• Implicit data structures for fast search and update
• Efficient searching using partial ordering
• Average-Case Lower Bounds for Searching

This page was built for publication: A tradeoff between search and update in dictionaries