A simple optimal representation for balanced parentheses
type: Item
instance of: scholarly article
title: A simple optimal representation for balanced parentheses
zbMATH Open document ID: 1103.68040
author: Richard F. Geary
author: Naila Rahman
author: Rajeev Raman
author: Venkatesh Raman
published in: Theoretical Computer Science
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5117662
zbMATH Keywords: succinct data structures
zbMATH Keywords: parentheses representation of trees
zbMATH Keywords: compressed dictionaries
zbMATH Keywords: XML DOM
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.014
OpenAlex ID: W2161715626
cites work: Representing trees of higher degree
cites work: Q3024774
cites work: Q4875211
cites work: An experimental study of a compressed index
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: Q5501236
cites work: Deterministic dictionaries
cites work: Q4449187
cites work: Space efficient suffix trees
cites work: Succinct representation of balanced parentheses and static trees
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Q4828936
DOI: 10.1016/J.TCS.2006.09.014
description: scientific article; zbMATH DE number 5117662