The following pages link to Balanced parentheses strike back (Q4962732):
Displaying 16 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Succinct and I/O efficient data structures for traversal in trees (Q2429347) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Recent Developments in Floorplan Representations (Q5135264) (← links)
- Succinct Representation of Labeled Graphs (Q5387767) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- (Q6065424) (← links)
