Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Filtered document retrieval with frequency-sorted indexes
Journal of the American Society for Information Science
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimised phrase querying and browsing of large text databases
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Modern Information Retrieval
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Space-Efficient Data Structures for Flexible Text Retrieval Systems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Fast phrase querying with combined indexes
ACM Transactions on Information Systems (TOIS)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Pruned query evaluation using pre-computed impacts
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
DCC '08 Proceedings of the Data Compression Conference
Space-Efficient Algorithms for Document Retrieval
CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Engineering a compressed suffix tree implementation
Journal of Experimental Algorithmics (JEA)
A Compressed Enhanced Suffix Array Supporting Fast String Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
Space-Efficient Framework for Top-k String Retrieval Problems
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient index for retrieving top-k most frequent documents
Journal of Discrete Algorithms
Top-k ranked document search in general text databases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
String retrieval for multi-pattern queries
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
Space-Efficient top-k document retrieval
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Towards an optimal space-and-query-time index for top-k document retrieval
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Document listing for queries with excluded pattern
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Trends in suffix sorting: a survey of low memory algorithms
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Indexing Word Sequences for Ranked Retrieval
ACM Transactions on Information Systems (TOIS)
| Hi-index | 0.00 |