A simple optimal representation for balanced parentheses
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185611 (Why is no real title available?)
- scientific article; zbMATH DE number 2038722 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- An experimental study of a compressed index
- Deterministic dictionaries
- Representing trees of higher degree
- Space efficient suffix trees
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct ordinal trees with level-ancestor queries
- Succinct representation of balanced parentheses and static trees
Cited in
(29)- Succinct encoding of binary strings representing triangulations
- Combinatorial Pattern Matching
- Ultra-succinct representation of ordered trees with applications
- On succinct representations of binary trees
- Balanced parentheses strike back
- Space-Efficient Euler Partition and Bipartite Edge Coloring
- Improved range minimum queries
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Space-efficient Euler partition and bipartite edge coloring
- Fast matching statistics in small space
- General document retrieval in compact space
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
- Representation of ordered trees with a given degree distribution
- Succinct representations of ordinal trees
- Succinct representations of permutations and functions
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Encodings of range maximum-sum segment queries and applications
- Random generation and enumeration of bipartite permutation graphs
- Faster entropy-bounded compressed suffix trees
- Succinct representation of balanced parentheses and static trees
- Parent queries over dynamic balanced parenthesis strings
- GLOUDS: representing tree-like graphs
- Fully functional static and dynamic succinct trees
- Practical compressed suffix trees
- Totally Balanced Formal Context Representation
- Succinct data structure for dynamic trees with faster queries
- Simple and efficient fully-functional succinct trees
- Encryption of 3D plane in GIS using Voronoi-Delaunay triangulations and Catalan numbers
This page was built for publication: A simple optimal representation for balanced parentheses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859854)
