A tradeoff between search and update time for the implicit dictionary problem
- 1 June 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 58 (1-3) , 57-68
- https://doi.org/10.1016/0304-3975(88)90018-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Searching Semisorted TablesSIAM Journal on Computing, 1985
- Partial match retrieval in implicit data structuresInformation Processing Letters, 1984
- Implicit Data Structures for the Dictionary ProblemJournal of the ACM, 1983
- Should Tables Be Sorted?Journal of the ACM, 1981
- Efficient searching using partial orderingInformation Processing Letters, 1981
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980