Cell-probe lower bounds for succinct partial sums

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 117-122

  Pǎtraşcu, Mihai ^a   Viola, Emanuele ^b  

^a AT AND T LABS RESEARCH   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; PARTIAL SUMS; PREPROCESS; SPARSE ARRAYS; SUCCINCT DATA STRUCTURE; T CELLS;

DATA STRUCTURES;

EID: 77951689932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. [CM96] David R. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. In Proc. 7th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 383-391, 1996.
2. +07] Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, and S. Srinivasa Rao. On the size of succinct indices. In Proc. 15th European Symposium on Algorithms (ESA), pages 371-382, 2007.
3. [GM03] Anna Gál and Peter Bro Miltersen. The cell probe complexity of succinct data structures. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP), pages 332-344, 2003.
4. [Gol07] Alexander Golynski. Optimal lower bounds for rank and select indexes. Theoretical Computer Science, 387(3):348-359, 2007. See also ICALP'06.
5. [Gol09] Alexander Golynski. Cell probe lower bounds for succinct data structures. In Proc. 20th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 625-634, 2009.
6. [GRR08] Alexander Golynski, Rajeev Raman, and S. Srinivasa Rao. On the redundancy of succinct data structures. In Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008.
7. [Jac89] Guy Jacobson. Space-efficient static trees and graphs. In Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pages 549-554, 1989.
8. [Mil99] Peter Bro Miltersen. Cell probe complexity - a survey. In Proc. 19th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999. Advances in Data Structures Workshop.
9. [Mil105] Peter Bro Miltersen. Lower bounds on the size of selection and rank indexes. In Proc. 16th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 11-12, 2005.
10. [MRR01] J. Ian Munro, Venkatesh Raman, and S. Srinivasa Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001. See also FSTTCS'98.
11. [Mun96] J. Ian Munro. Tables. In Proc. 16th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 37-40, 1996.
12. [Pag01] Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2001. See also ICALP'99.
13. [Pat08] Mihai Pǎtraşcu. Succincter. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pages 305-313, 2008.
14. [PT06] Mihai Pǎtraşcu and Mikkel Thorup. Time-space trade-offs for predecessor search. In Proc. 38th ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.
15. [PT07] Mihai Pǎtraşcu and Mikkel Thorup. Randomization does not help searching predecessors. In Proc. 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 555-564, 2007.
16. [RRR02] Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 233-242, 2002.
17. [Vio09a] Emanuele Viola. Bit-probe lower bounds for succinct data structures. In Proc. 41st ACM Symposium on Theory of Computing (STOC), pages 475-482, 2009.
18. [Vio09b] Emanuele Viola. Cell-probe lower bounds for prefix sums. arXiv:0906.1370v1, 2009.