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
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
View-dependent tetrahedral meshing and rendering
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Querying and maintaining a compact XML storage
Proceedings of the 16th international conference on World Wide Web
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
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
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
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
Succinct representation of static packet classifiers
IEEE/ACM Transactions on Networking (TON)
Universal Succinct Representations of Trees?
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Data Structures for Range Median Queries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Cell probe lower bounds and approximations for range mode
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Compressed self-indices supporting conjunctive queries on document collections
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Succincter text indexing with wildcards
CPM'11 Proceedings of the 22nd 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
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
Efficient in-memory top-k document retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Simple Random Access Compression
Fundamenta Informaticae
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
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 indexes for text with wildcards
Theoretical Computer Science
Tight and simple Web graph compression for forward and reverse neighbor queries
Discrete Applied Mathematics
| Hi-index | 0.00 |