Succinct representation of balanced parentheses and static trees
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Compact searchable static binary trees
- Compressing probability distributions
- Space-efficient Euler partition and bipartite edge coloring
- Path queries on functions
- Dynamic path queries in linear space
- Flexible indexing of repetitive collections
- Succinct navigational oracles for families of intersection graphs on a circle
- Succinct representation for (non)deterministic finite automata
- Navigating planar topologies in near-optimal space and time
- The space complexity of sum labelling
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Block trees
- Succinct representations for (non)deterministic finite automata
- Lempel-Ziv compressed structures for document retrieval
- Linear-time algorithms for tree root problems
- Tree compression with top trees
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Succinct indices for path minimum, with applications
- On succinct representations of binary trees
- Succinct representations of weighted trees supporting path queries
- Constructing small tree grammars and small circuits for formulas
- Improved range minimum queries
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Succinct data structure for dynamic trees with faster queries
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of labeled graphs
- Succinct and I/O efficient data structures for traversal in trees
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Truly selective polygonal mesh hierarchies with error control
- Efficient computation of Lyapunov functions for Morse decompositions
- Succinct dynamic cardinal trees
- GLOUDS: representing tree-like graphs
- Representation of ordered trees with a given degree distribution
- Succinct encodings for families of interval graphs
- Encoding two-dimensional range top-\(k\) queries
- Succinct encoding of binary strings representing triangulations
- Compressed string dictionary search with edit distance one
- Fully functional static and dynamic succinct trees
- Fast compressed tries through path decompositions
- General document retrieval in compact space
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
- Succinct and Implicit Data Structures for Computational Geometry
- Succinct representations of ordinal trees
- Encodings of range maximum-sum segment queries and applications
- A compact encoding of unordered binary trees
- Succincter text indexing with wildcards
- Succinct oblivious RAM
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Random Generation and Enumeration of Proper Interval Graphs
- Compressed indexes for text with wildcards
- On-line construction of position heaps
- A compact encoding of plane triangulations with efficient query supports
- Random generation and enumeration of bipartite permutation graphs
- Ultra-succinct representation of ordered trees with applications
- Succinct representations of permutations and functions
- On the approximability of some degree-constrained subgraph problems
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct representation of labeled trees
- Simple and efficient fully-functional succinct trees
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- Encoding two-dimensional range top-k queries revisited
- Indexing graph search trees and applications
- Recent developments in floorplan representations
- Dualities in tree representations
- Parent queries over dynamic balanced parenthesis strings
- Random access to grammar-compressed strings and trees
- Practical compact indexes for top-k document retrieval
- Space-Efficient Euler Partition and Bipartite Edge Coloring
- Combinatorial Pattern Matching
- Combined data structure for previous- and next-smaller-values
- Succinct Representation of Labeled Graphs
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Efficient and compact representations of some non-canonical prefix-free codes
- Compressed indexes for approximate string matching
- The space complexity of sum labelling
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Space-efficient data structure for next/previous larger/smaller value queries
- Succinct data structure for path graphs
- Succinct data structures for bounded clique-width graphs
- Implementing the topological model succinctly
- Wheeler maps
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- On the stack layouts of toroidal grids
- Space efficient construction of Lyndon arrays in linear time
- Space-efficient graph coarsening with applications to succinct planar encodings
- Space-efficient data structure for next/previous larger/smaller value queries
- (Worst-case) optimal adaptive dynamic bitvectors
- Succinct planar encoding with minor operations
- An improved algorithm for the k-Dyck edit distance problem
- Succinct data structures for searchable partial sums with optimal worst-case performance
- A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
- Succinct data structures for Baxter permutation and related families
- Enhancing generalized compressed suffix trees, with applications
- FL-RMQ: a learned approach to range minimum queries
- Faster algorithm for bounded tree edit distance in the low-distance regime
- On the complexity of isoperimetric problems on trees
- Graph compression and the zeros of polynomials
This page was built for publication: Succinct representation of balanced parentheses and static trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784479)
