Zobrazeno 1 - 9
of 9
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
Autor:
HUANCHEN ZHANG1 huanche1@cs.cmu.edu, HYEONTAEK LIM1 hl@cs.cmu.edu, LEIS, VIKTOR2 viktor.leis@uni-jena.de, ANDERSEN, DAVID G.1 dga@cs.cmu.edu, KAMINSKY, MICHAEL3 kaminsky@cs.cmu.edu, KEETON, KIMBERLY4 kimberly.keeton@hpe.com, PAVLO, ANDREW1 pavlo@cs.cmu.edu
Publikováno v:
ACM Transactions on Database Systems. Jun2020, Vol. 45 Issue 2, p5-5:31. 31p.
Autor:
Gavoille, Cyril1 gavoille@labri.fr, Hanusse, Nicolas1 hanusse@labri.fr
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2008, Vol. 10 Issue 3, p23-34. 12p. 3 Diagrams.
Publikováno v:
ACM Transactions on Algorithms; 2006, Vol. 2 Issue 4, p510-534, 25p
Autor:
Dinesh P. Mehta, Sartaj Sahni
Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures that have been reported in the literature. The Handbook of Data Structures
This book constitutes the refereed proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, held in Istanbul, Turkey in July 2004. The 36 revised full papers presented were carefully reviewed and selected from 79 submissi