Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Richard F. Geary"'
Publikováno v:
Theoretical Computer Science. 368(3):231-246
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, which support natural operations such as finding the matching parenthesis for a given parenthesis, or finding the pai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e1e86fedd08862e831c61a698a60d99
Publikováno v:
Scopus-Elsevier
We consider succinct or space-efficient representations of trees that efficiently support a variety of navigation operations. We focus on static ordinal trees, that is, arbitrary static rooted trees where the children of each node are ordered. The se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a0419907359833c428b56aa29adf9bb
https://doi.org/10.1145/1198513.1198516
https://doi.org/10.1145/1198513.1198516
Publikováno v:
Combinatorial Pattern Matching ISBN: 9783540223412
CPM
CPM
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as finding the matching parenthesis for a given parenthesis, or finding the pair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a3b317b328d864e76eda4dde79df876
https://doi.org/10.1007/978-3-540-27801-6_12
https://doi.org/10.1007/978-3-540-27801-6_12
