2000 character limit reached
Enumeration and Succinct Encoding of AVL Trees
Published 27 Nov 2023 in math.CO and cs.DS | (2311.15511v2)
Abstract: We use a novel decomposition to create succinct data structures -- supporting a wide range of operations on static trees in constant time -- for a variety tree classes, extending results of Munro, Nicholson, Benkner, and Wild. Motivated by the class of AVL trees, we further derive asymptotics for the information-theoretic lower bound on the number of bits needed to store tree classes whose generating functions satisfy certain functional equations. In particular, we prove that AVL trees require approximately $0.938$ bits per node to encode.
- G. Adelson-Velsky and E. Landis. An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences (in Russian), 1962.
- Clark, David. Compact PAT trees. PhD thesis, University of Waterloo, 1997.
- A uniform paradigm to succinctly encode various families of trees. Algorithmica, 68(1):16–40, Jan 2014.
- Analytic combinatorics. Cambridge University Press, Cambridge, 2009.
- Succinct ordinal trees based on tree covering. In Automata, Languages and Programming, pages 509–520. 2007.
- G. Jacobson. Space-efficient static trees and graphs. In 30th Annual Symposium on Foundations of Computer Science, pages 549–554, 1989.
- Stephen Melczer. An Invitation to Analytic Combinatorics: From One to Several Variables. Texts and Monographs in Symbolic Computation. Springer International Publishing, 2021.
- J. Ian Munro. Tables. In Vijay Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings, volume 1180 of Lecture Notes in Computer Science, pages 37–42. Springer, 1996.
- Hypersuccinct trees – new universal tree source codes for optimal compressed tree data structures and range minima. In 29th Annual European Symposium on Algorithm, page 70:1–70:18, 2021.
- Representing dynamic binary trees succinctly. In S. Rao Kosaraju, editor, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA, pages 529–536. ACM/SIAM, 2001.
- Succinct representation of data structures. In Dinesh P. Mehta and Sartaj Sahni, editors, Handbook of Data Structures and Applications. Chapman and Hall/CRC, 2004.
- Gonzalo Navarro. Compact Data Structures: A Practical Approach. Cambridge University Press, 2016.
- A. M. Odlyzko. Some new methods and results in tree enumeration. In Proceedings of the thirteenth Manitoba conference on numerical mathematics and computing (Winnipeg, Man., 1983), volume 42, pages 27–52, 1984.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.