Encoding Data Structures

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.

[1]  Rajeev Raman,et al.  Space efficient data structures for nearest larger neighbor , 2016, J. Discrete Algorithms.

[2]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[3]  Alejandro López-Ortiz,et al.  Space-Efficient Data Structures, Streams, and Algorithms , 2013 .

[4]  S. Srinivasa Rao,et al.  On Space Efficient Two Dimensional Range Minimum Data Structures , 2011, Algorithmica.

[5]  Gad M. Landau,et al.  On Cartesian Trees and Range Minimum Queries , 2009, Algorithmica.

[6]  Gad M. Landau,et al.  On Cartesian Trees and Range Minimum Queries , 2009, ICALP.

[7]  Giuseppe F. Italiano,et al.  Algorithms – ESA 2013 , 2013, Lecture Notes in Computer Science.

[8]  Rajeev Raman,et al.  Asymptotically Optimal Encodings for Range Selection , 2014, FSTTCS.

[9]  Rajeev Raman,et al.  Encodings for Range Selection and Top-k Queries , 2013, ESA.

[10]  Stefan Kurtz,et al.  Reducing the space requirement of suffix trees , 1999 .

[11]  Johannes Fischer.  Combined data structure for previous- and next-smaller-values , 2011, Theor. Comput. Sci..

[12]  Rajeev Raman,et al.  Optimal Encodings and Indexes for Nearest Larger Value Problems , 2014 .

[13]  Rajeev Raman,et al.  On Succinct Representations of Binary Trees , 2017, Math. Comput. Sci..

[14]  John Iacono,et al.  Encoding 2-D Range Maximum Queries , 2016, Theor. Comput. Sci..

[15]  Rajeev Raman,et al.  Encoding range minima and range top-2 queries , 2014, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[16]  Rajeev Raman,et al.  Compact Encodings and Indexes for the Nearest Larger Neighbor Problem , 2015, WALCOM.

[17]  Volker Heun,et al.  Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays , 2011, SIAM J. Comput..

[18]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[19]  Pawel Gawrychowski,et al.  Optimal Encodings for Range Min-Max and Top-k , 2015, ICALP 2015.

[20]  Jean Vuillemin,et al.  A unifying look at data structures , 1980, CACM.

[21]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.