Balanced parentheses strike back

DOI10.1145/1367064.1367068zbMath1445.68072OpenAlexW2157963663MaRDI QIDQ4962732

Hsueh-I Lu, Chia-Chi Yeh

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1367064.1367068

zbMATH Keywords

succinct data structuresXML document representation

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (16)

Succinct representations of weighted trees supporting path queries ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Parallel construction of succinct trees ⋮ A compact encoding of plane triangulations with efficient query supports ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Succinct representation of labeled graphs ⋮ Succinct and I/O efficient data structures for traversal in trees ⋮ Unnamed Item ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ Recent Developments in Floorplan Representations ⋮ Succinct Representation of Labeled Graphs ⋮ Simple and efficient fully-functional succinct trees ⋮ A Compact Encoding of Plane Triangulations with Efficient Query Supports ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct Representations of Ordinal Trees ⋮ Succinct dynamic cardinal trees

This page was built for publication: Balanced parentheses strike back