Opportunistic data structures with applications
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 390-398
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs2002
- Block addressing indices for approximate text retrievalJournal of the American Society for Information Science, 2000
- Multi-method dispatching1999
- The string B-treeJournal of the ACM, 1999
- Optimal Prediction for Prefetching in the Worst CaseSIAM Journal on Computing, 1998
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- Sorting and searching revistedLecture Notes in Computer Science, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Markov paging1992
- A locally adaptive data compression schemeCommunications of the ACM, 1986