A Uniform Paradigm to Succinctly Encode Various Families of Trees
- 9 June 2012
- journal article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 68 (1), 16-40
- https://doi.org/10.1007/s00453-012-9664-0
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Compact Navigation and Distance Oracles for Graphs with Small TreewidthLecture Notes in Computer Science, 2011
- Universal Succinct Representations of Trees?Lecture Notes in Computer Science, 2009
- Dynamic Succinct Ordered TreesLecture Notes in Computer Science, 2009
- A Uniform Approach Towards Succinct Representation of TreesLecture Notes in Computer Science, 2008
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Optimal Bounds for the Predecessor Problem and Related ProblemsJournal of Computer and System Sciences, 2002
- Catalan, Motzkin, and Riordan numbersDiscrete Mathematics, 1999
- Membership in Constant Time and Almost-Minimum SpaceSIAM Journal on Computing, 1999
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Non-Associate Powers and a Functional EquationThe Mathematical Gazette, 1937