Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Abouelhoda, S. Kurtz, Enno Ohlebusch (2004)
Replacing suffix trees with enhanced suffix arraysJ. Discrete Algorithms, 2
David Benoit, E. Demaine, J. Munro, R. Raman, Venkatesh Raman, S. Srinivasa, Rao (2005)
Representing Trees of Higher DegreeAlgorithmica, 43
M. Crochemore, C. Iliopoulos, M. Kubica, Mohammad Rahman, Tomasz Waleń (2012)
Improved algorithms for the range next value problem and applications
Gang Chen, S. Puglisi, W. Smyth (2008)
Lempel–Ziv Factorization Using Less Time & SpaceMathematics in Computer Science, 1
J. Munro, Venkatesh Raman (2002)
Succinct Representation of Balanced Parentheses and Static TreesSIAM J. Comput., 31
J. Vuillemin (1980)
A unifying look at data structuresCommun. ACM, 23
L. Georgiadis, R. Tarjan (2004)
Finding dominators revisited: extended abstract
R. Raman, S. Rao (2013)
Succinct Representations of Ordinal Trees
Niko Välimäki, V. Mäkinen (2007)
Space-Efficient Algorithms for Document Retrieval
P. Davoodi, G. Navarro, R. Raman, S. Rao (2014)
Encoding range minima and range top-2 queriesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 372
Diego Arroyuelo, Rodrigo Cánovas, G. Navarro, K. Sadakane (2010)
Succinct Trees in Practice
J. Fischer, Volker Heun (2011)
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static ArraysSIAM J. Comput., 40
K. Sadakane (2007)
Succinct data structures for flexible text retrieval systemsJ. Discrete Algorithms, 5
Simon Gog, Timo Beller, Alistair Moffat, M. Petri (2013)
From Theory to Practice: Plug and Play with Succinct Data StructuresArXiv, abs/1311.1249
S. Zaks (1980)
Lexicographic Generation of Ordered TreesTheor. Comput. Sci., 10
R. Grossi, G. Ottaviano (2013)
Design of Practical Succinct Data Structures for Large Data Collections
R Grossi, G Ottaviano (2013)
SEA, volume 7933 of Lecture Notes in Computer Science
G. Jacobson (1988)
Succinct static data structures
D Arroyuelo, R Cánovas, G Navarro, K Sadakane (2010)
ALENEX
(2008)
Patrascu . Succincter . In FOCS , pages 305 – 313
M. Patrascu (2008)
Succincter2008 49th Annual IEEE Symposium on Foundations of Computer Science
R Raman, SS Rao (2013)
Space-Efficient Data Structures, Streams, and Algorithms, Volume 8066 of Lecture Notes in Computer Science
H. Gabow, J. Bentley, R. Tarjan (1984)
Scaling and related techniques for geometry problems
Arash Farzan, R. Raman, S. Rao (2009)
Universal Succinct Representations of Trees?
S. Muthukrishnan (2002)
Efficient algorithms for document retrieval problems
Arash Farzan, J. Munro (2008)
A Uniform Approach Towards Succinct Representation of Trees
K. Sadakane, G. Navarro (2009)
Fully Functional Static and Dynamic Succinct TreesArXiv, abs/0905.0768
Richard Geary, Naila Rahman, R. Raman, Venkatesh Raman (2004)
A simple optimal representation for balanced parenthesesTheor. Comput. Sci., 368
K. Sadakane, G. Navarro (2010)
Fully-functional succinct trees
Sanjeev Saxena (2009)
Dominance made simpleInf. Process. Lett., 109
K. Sadakane (2007)
Compressed Suffix Trees with Full FunctionalityTheory of Computing Systems, 41
We observe that a standard transformation between ordinal trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these transformations. Via these transformations we get four succinct representations of n-node binary trees that use $$2n + n/(\log n)^{\Theta (1)}$$ 2 n + n / ( log n ) Θ ( 1 ) bits and support (among other operations) navigation, inorder numbering, one of preorder or postorder numbering, subtree size and lowest common ancestor queries. While this functionality, and more, is also supported in O(1) time using $$2n + o(n)$$ 2 n + o ( n ) bits by Davoodi et al. (Phil Trans R Soc A 372:20130131, 2014) extension of a representation by Farzan and Munro (Algorithmica 6), their redundancy, or the o(n) term, is much larger, and their approach may not be suitable for practical implementations. One of these transformations is related to the Zaks’ sequence (Theor Comput Sci 10:63–82, 1980) for encoding binary trees, and we thus provide the first succinct binary tree representation based on Zaks’ sequence. The ability to support inorder numbering is crucial for the well-known range-minimum query problem on an array A of n ordered values. Another of these transformations is equivalent to Fischer and Heun’s (SIAM J Comput 40(2):465–492, 2011) 2d-Min-Heap structure for this problem. Yet another variant allows an encoding of the Cartesian tree of A to be constructed from A using only $$O(\sqrt{n} \log n)$$ O ( n log n ) bits of working space.
Mathematics in Computer Science – Springer Journals
Published: Mar 20, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.