Please use this identifier to cite or link to this item:
Title: Encoding Data Structures
Authors: Raman, Rajeev
First Published: 25-Feb-2015
Presented at: Algorithms and Computation - 9th International Workshop, WALCOM 2015. Dhaka, Bangladesh
Start Date: 26-Feb-2015
End Date: 28-Feb-2015
Publisher: Springer Verlag (Germany)
Citation: Lecture Notes in Computer Science, 2015, 8973, pp. 1-7
Abstract: In recent years, there has been an explosion of interest in succinct data structures, which store the given data in compact or compressed formats and answer queries on the data rapidly while it is still in its compressed format. Our focus in this talk is to introduce encoding data structures. Encoding data structures consider the data together with the queries and aim to store only as much information about the data as is needed to store the queries. Once this is done, the original data can be deleted. In many cases, one can obtain space-efficient encoding data structures even when the original data is incompressible.
DOI Link: 10.1007/978-3-319-15612-5_1
ISSN: 0302-9743
ISBN: 978-3-319-15611-8
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Archived with reference to SHERPA/RoMEO and publisher website. The final publication is available at Springer via
Description: Abstract of invited talk.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
invited_paper_3(1).pdfPost-review (final submitted)238.09 kBAdobe PDFView/Open

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