Automata, Languages and Programming

DOI10.1007/B99859zbMath1099.68603OpenAlexW2505584480MaRDI QIDQ5466533

S. Srinivasa Rao, J. Ian Munro

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (8)

Succinct encoding of arbitrary graphs ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Succinct representation of labeled graphs ⋮ Unnamed Item ⋮ Adaptive searching in succinctly encoded binary relations and tree-structured documents ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct Representations of Ordinal Trees ⋮ Random Access to Grammar-Compressed Strings and Trees

This page was built for publication: Automata, Languages and Programming