Compressed data structures: Dictionaries and data-aware measures
- 22 November 2007
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 387 (3), 313-331
- https://doi.org/10.1016/j.tcs.2007.07.042
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Rank and select revisited and extendedTheoretical Computer Science, 2007
- Squeezing succinct data structures into entropy boundsPublished by Association for Computing Machinery (ACM) ,2006
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup TimeLecture Notes in Computer Science, 1999
- IP Address LookupMade Fast and SimpleLecture Notes in Computer Science, 1999
- Membership in Constant Time and Almost-Minimum SpaceSIAM Journal on Computing, 1999
- TablesLecture Notes in Computer Science, 1996
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975