Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th 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
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A simple optimal representation for balanced parentheses
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)
A compressed self-index using a Ziv---Lempel dictionary
Information Retrieval
On searching compressed string collections cache-obliviously
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Quick encoding of plane graphs in log 214 bits per edge
Information Processing Letters
An(other) Entropy-Bounded Compressed Suffix Tree
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
An Improved Succinct Representation for Dynamic k-ary Trees
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
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Succinct representations of planar maps
Theoretical Computer Science
BRICK: a novel exact active statistics counter architecture
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Self-indexing Natural Language
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Quasi-distinct Parsing and Optimal Compression Methods
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Dynamic Succinct Ordered Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Universal Succinct Representations of Trees?
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)
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Dynamic rank/select structures with applications to run-length encoded texts
Theoretical Computer Science
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
Range Quantile Queries: Another Virtue of Wavelet Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
k2-Trees for Compact Web Graph Representation
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
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
A succinct N-gram language model
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
I/O and Space-Efficient Path Traversal in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Polynomial to linear: efficient classification with conjunctive features
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Information Processing Letters
Succinct representations of permutations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Implicit compression boosting with applications to self-indexing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Succinct representation of labeled graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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 locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Changing base without losing space
Proceedings of the forty-second ACM symposium on Theory of computing
Note: On compact representations of All-Pairs-Shortest-Path-Distance matrices
Theoretical Computer Science
A compact encoding of plane triangulations with efficient query supports
Information Processing Letters
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
Bidirectional search in a string with wavelet trees
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Fast prefix search in little space, with applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Improved data structures for the orthogonal range successor problem
Computational Geometry: Theory and Applications
Faster compressed dictionary matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Succinct representations of dynamic strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
E=I+T: The internal extent formula for compacted tries
Information Processing Letters
Area efficient VLSI architectures for Huffman coding
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Proceedings of the 20th international conference on World wide web
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
A compact encoding of unordered binary trees
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Theory and practice of monotone minimal perfect hashing
Journal of Experimental Algorithmics (JEA)
Space efficient data structures for dynamic orthogonal range counting
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
BRICK: a novel exact active statistics counter architecture
IEEE/ACM Transactions on Networking (TON)
Space efficient wavelet tree construction
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Computing the longest common prefix array based on the burrows-wheeler transform
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
Practical representations for web and social graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Semi-indexing semi-structured data in tiny space
Proceedings of the 20th ACM international conference on Information and knowledge management
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
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
Adaptive searching in succinctly encoded binary relations and tree-structured documents
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
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science
Succinct suffix arrays based on run-length encoding
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Efficient implementation of rank and select functions for succinct representation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Information and Computation
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Dynamic range selection in linear space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Encoding 2d range maximum queries
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
The wavelet trie: maintaining an indexed sequence of strings in compressed space
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Succinct representations of permutations and functions
Theoretical Computer Science
Succinct ordinal trees based on tree covering
ACM Transactions on Algorithms (TALG)
Dynamizing succinct tree representations
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Fast, small, simple rank/select on bitmaps
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Space-Efficient top-k document retrieval
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
Compressing IP forwarding tables for fun and profit
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Dynamic rank-select structures with applications to run-length encoded texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Compressed text indexes with fast locate
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
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
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Range majority in constant time and linear space
Information and Computation
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Smaller self-indexes for natural language
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
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms
Implicit indexing of natural language text by reorganizing bytecodes
Information Retrieval
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
Compressing IP forwarding tables: towards entropy bounds and beyond
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
Succinct sampling from discrete distributions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On-line construction of position heaps
Journal of Discrete Algorithms
Effectiveness of an implementation method for retrieving similar strings by trie structures
International Journal of Computer Applications in Technology
Tree compression with top trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Space efficient data structures for dynamic orthogonal range counting
Computational Geometry: Theory and Applications
Compact representation of Web graphs with extended functionality
Information Systems
On the compression of search trees
Information Processing and Management: an International Journal
Journal of Discrete Algorithms
| Hi-index | 0.01 |
Data structures that represent static unlabeled trees and planar graphs are developed. The structures are more space efficient than conventional pointer-based representations, but (to within a constant factor) they are just as time efficient for traversal operations. For trees, the data structures described are asymptotically optimal: there is no other structure that encodes n-node trees with fewer bits per node, as N grows without bound. For planar graphs (and for all graphs of bounded page number), the data structure described uses linear space: it is within a constant factor of the most succinct representation.