Opportunistic data structures with applications
Top Cited Papers
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 390-398
- https://doi.org/10.1109/sfcs.2000.892127
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String MatchingSIAM Journal on Computing, 2005
- Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Block addressing indices for approximate text retrievalJournal of the American Society for Information Science, 2000
- Multi-method dispatchingPublished by Association for Computing Machinery (ACM) ,1999
- The string B-treeJournal of the ACM, 1999
- Optimal Prediction for Prefetching in the Worst CaseSIAM Journal on Computing, 1998
- Sorting and searching revistedLecture Notes in Computer Science, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Markov pagingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A locally adaptive data compression schemeCommunications of the ACM, 1986