Text compression
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Compact pat trees
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
SIAM Journal on Discrete Mathematics
Journal of Algorithms
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 Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Orderly Spanning Trees with Applications
SIAM Journal on Computing
Representing Trees of Higher Degree
Algorithmica
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Universal Succinct Representations of Trees?
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
A compact encoding of plane triangulations with efficient query supports
Information Processing Letters
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
Succinct ordinal trees based on tree covering
ACM Transactions on Algorithms (TALG)
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms
| Hi-index | 0.00 |
An ordinal tree is an arbitrary rooted tree where the children of each node are ordered. Succinct representations for ordinal trees with efficient query support have been extensively studied. The best previously known result is due to Geary et al. [2004b, pages 1--10]. The number of bits required by their representation for an n-node ordinal tree T is 2n + o(n), whose first-order term is information-theoretically optimal. Their representation supports a large set of O(1)-time queries on T. Based upon a balanced string of 2n parentheses, we give an improved 2n + o(n)-bit representation for T. Our improvement is two-fold: First, the set of O(1)-time queries supported by our representation is a proper superset of that supported by the representation of Geary, Raman, and Raman. Second, it is also much easier for our representation to support new queries by simply adding new auxiliary strings.