STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth 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
Database indexing for large DNA and protein sequence collections
The VLDB Journal — The International Journal on Very Large Data Bases
Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Static Dictionaries Supporting Rank
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct suffix arrays based on run-length encoding
Nordic Journal of Computing
ACM Computing Surveys (CSUR)
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
Rank and select revisited and extended
Theoretical Computer Science
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Practical Rank/Select Queries over Arbitrary Sequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Rank and Select for Succinct Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Simple Random Access Compression
Fundamenta Informaticae
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Range Quantile Queries: Another Virtue of Wavelet Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
A Compressed Enhanced Suffix Array Supporting Fast String Matching
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
Simple compression code supporting random access and fast string matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A compact encoding of plane triangulations with efficient query supports
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Broadword implementation of rank/select queries
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A compact encoding of plane triangulations with efficient query supports
Information Processing Letters
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
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)
Compact representation of large RDF data sets for publishing and exchange
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Seed-set construction by equi-entropy partitioning for efficient and sensitive short-read mapping
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
SILT: a memory-efficient, high-performance key-value store
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Space efficient wavelet tree construction
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Compact rich-functional binary relation representations
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
Optimal lower bounds for rank and select indexes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
String matching with alphabet sampling
Journal of Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient implementation of rank and select functions for succinct representation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Extended compact web graph representations
Algorithms and Applications
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
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
Generalized biwords for bitext compression and translation spotting
Journal of Artificial Intelligence Research
Dynamic rank-select structures with applications to run-length encoded texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
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
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Compressed representation of web and social networks via dense subgraphs
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
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
Proceedings of the sixth ACM international conference on Web search and data mining
Binary RDF representation for publication and exchange (HDT)
Web Semantics: Science, Services and Agents on the World Wide Web
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |