STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Succinct representations of lcp information and improvements in the compressed suffix arrays
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Static Dictionaries Supporting Rank
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Indexing Text Using the Ziv-Lempel Trie
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Indexing text using the Ziv-Lempel trie
Journal of Discrete Algorithms - SPIRE 2002
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM Computing Surveys (CSUR)
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Note: A simple storage scheme for strings achieving entropy bounds
Theoretical Computer Science
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Compressed indexes for approximate string matching
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A simple storage scheme for strings achieving entropy bounds
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Rank and select revisited and extended
Theoretical Computer Science
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
Output-sensitive autocompletion search
Information Retrieval
A compressed self-index using a Ziv---Lempel dictionary
Information Retrieval
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Implementing the LZ-index: Theory versus practice
Journal of Experimental Algorithmics (JEA)
An(other) Entropy-Bounded Compressed Suffix Tree
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Self-indexing Natural Language
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Simple Random Access Compression
Fundamenta Informaticae
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Testing Stream Ciphers by Finding the Longest Substring of a Given Density
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Engineering a compressed suffix tree implementation
Journal of Experimental Algorithmics (JEA)
Dynamic rank/select structures with applications to run-length encoded texts
Theoretical Computer Science
Rank/select on dynamic compressed sequences and applications
Theoretical Computer Science
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
k2-Trees for Compact Web Graph Representation
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Directly Addressable Variable-Length Codes
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
A New Point Access Method Based on Wavelet Trees
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Fast Arc-Annotated Subsequence Matching in Linear Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Simple compression code supporting random access and fast string matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Engineering a compressed suffix tree implementation
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Improved dynamic rank-select entropy-bound structures
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Note: On compact representations of All-Pairs-Shortest-Path-Distance matrices
Theoretical Computer Science
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On table arrangements, scrabble freaks, and jumbled pattern matching
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
Journal of Experimental Algorithmics (JEA)
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Practical compressed document retrieval
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Inverted indexes for phrases and strings
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Alphabet-independent compressed text indexing
ESA'11 Proceedings of the 19th European conference on Algorithms
Space efficient wavelet tree construction
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Improved compressed indexes for full-text document retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Indexes for highly repetitive document collections
Proceedings of the 20th ACM international conference on Information and knowledge management
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Compressed dictionaries: space measures, data sets, and experiments
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Statistical encoding of succinct data structures
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Reducing the space requirement of LZ-Index
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
Output-Sensitive autocompletion search
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A compressed self-index using a ziv-lempel dictionary
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Succinct text indexes on large alphabet
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Succinct suffix arrays based on run-length encoding
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
String matching with alphabet sampling
Journal of Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Space-efficient multiple string matching automata
International Journal of Wireless and Mobile Computing
Simple Random Access Compression
Fundamenta Informaticae
Fast, small, simple rank/select on bitmaps
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
A Lempel-Ziv text index on secondary storage
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Dynamic rank-select structures with applications to run-length encoded texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Exploiting SIMD instructions in current processors to improve classical string algorithms
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Compressed suffix trees for repetitive texts
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Dual-Sorted inverted lists in practice
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Variable-Length codes for space-efficient grammar-based compression
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Implicit indexing of natural language text by reorganizing bytecodes
Information Retrieval
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms
Colored range queries and document retrieval
Theoretical Computer Science
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Compact representation of Web graphs with extended functionality
Information Systems
On compressing permutations and adaptive sorting
Theoretical Computer Science
On the compression of search trees
Information Processing and Management: an International Journal
Journal of Discrete Algorithms
| Hi-index | 0.01 |