SuRF
Authors:
Open Access
- 27 May 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 323-336
Abstract
No abstract availableKeywords
Funding Information
- Intel Science and Technology Center for Visual Cloud Systems
- National Science Foundation (CCF-1535821)
This publication has 33 references indexed in Scilit:
- Design of Practical Succinct Data Structures for Large Data Collections2013
- CassandraACM SIGOPS Operating Systems Review, 2010
- Balanced parentheses strike backACM Transactions on Algorithms, 2008
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisetsACM Transactions on Algorithms, 2007
- A simple optimal representation for balanced parenthesesTheoretical Computer Science, 2006
- Fast hash table lookup using extended bloom filterACM SIGCOMM Computer Communication Review, 2005
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String MatchingSIAM Journal on Computing, 2005
- Space Efficient Suffix TreesJournal of Algorithms, 2001
- Succinct Representation of Balanced Parentheses and Static TreesSIAM Journal on Computing, 2001
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970