Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/29205
Title: Succinct representations of ordinal trees
Authors: Raman, Rajeev
Rao, S. Srinivasa
First Published: 2013
Publisher: Springer Berlin Heidelberg
Citation: Space-Efficient Data Structures, Streams, and Algorithms, Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, 2013, 8066 , pp. 319-332
Abstract: We survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.
Series/Report no.: Lecture Notes in Computer Science;8066
DOI Link: 10.1007/978-3-642-40273-9_20
ISSN: 0302-9743
978-3-642-40273-9
ISBN: 978-3-642-40272-2
eISSN: 1611-3349
Links: http://link.springer.com/chapter/10.1007%2F978-3-642-40273-9_20
http://hdl.handle.net/2381/29205
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © 2013, Springer-Verlag Berlin Heidelberg. Deposited with reference to the publisher’s archiving policy available on the SHERPA/RoMEO website.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
trees-survey.pdfPost-review (final submitted)477.54 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.