Surpassing the information theoretic bound with fusion trees
- 31 December 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 47 (3), 424-436
- https://doi.org/10.1016/0022-0000(93)90040-4
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCR-8504245, CCR90-60509)
This publication has 7 references indexed in Scilit:
- Dynamic perfect hashing: upper and lower boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Hash functions for priority queuesInformation and Control, 1984
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- ORGANIZATION AND MAINTENANCE OF LARGE ORDERED INDICESPublished by Defense Technical Information Center (DTIC) ,1970