Logarithmic lower bounds in the cell-probe model

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 932-963

  Pǎtraşcu, Mihai ^a   Demaine, Erik D ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cell probe complexity; Data structures; Dynamic graph problems; Lower bounds; Partial sums problem

Indexed keywords

CELL-PROBE COMPLEXITY; DYNAMIC GRAPH PROBLEMS; LOWER BOUNDS; PARTIAL-SUMS PROBLEM;

GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 33747197541     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447256     Document Type: Conference Paper

References (37)

1. [AHR98] S. ALSTRUP, T. HUSFELDT, AND T. RAUHE, Marked ancestor problems, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 534-543.
2. [Ajt88] M. AJTAI, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica, 8 (1988), pp. 235-247.
3. 0 instructions only, Theoret. Comput. Sci., 215 (1999), pp. 337-344.
4. [Arg03] L. ARGE, The buffer tree: A technique for designing batched external data structures, Algorithmica, 37 (2003), pp. 1-24. See also WADS '95.
5. [BAG01] A. M. BEN-AMRAM AND Z. GALIL, A generalization of a lower bound technique due to Fredman and Saks, Algorithmica, 30 (2001), pp. 34-66. See also FOCS '91.
6. [BAG02] A. M. BEN-AMRAM AND Z. GALIL, Lower bounds for dynamic data structures on algebraic RAMs, Algorithmica, 32 (2002), pp. 364-395. See also FOCS '91.
7. [BF02] P. BEAME AND F. E. FICH, Optimal bounds for the predecessor problem and related problems, J. Comput. System Sci., 65 (2002), pp. 38-72. See also STOC '99.
8. +78] L. CARTER, R. FLOYD, J. GILL, G. MARKOWSKY, AND M. WEGMAN, Exact and approximate membership testers, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC), 1978, pp. 59-65.
9. [Cha97] B. CHAZELLE, Lower bounds for off-line range searching, Discrete Comput. Geom., 17 (1997), pp. 53-65. See also STOC '95.
10. [CT91] T. M. COVER AND J. A. THOMAS, Elements of Information Theory, John Wiley & Sons, New York, 1991.
11. [dBSvKO00] M. DE BERG, O. SCHWARZKOPF, M. VAN KREVELD, AND M. OVERMARS, Computational Geometry: Algorithms and Applications, 2nd ed., Springer-Verlag, Berlin, New York, 2000.
12. [Die89] P. F. DIETZ, Optimal algorithms for list indexing and subset rank, in Proceedings of the 1st Annual Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Comput. Sci. 382, Springer-Verlag, Berlin, 1989, pp. 39-46.
13. +92] D. EPPSTEIN, G. F. ITALIANO, R. TAMASSIA, R. E. TARJAN, J. R. WESTBROOK, AND M. YUNG, Maintenance of a minimum spanning forest in a dynamic planar graph, J. Algorithms, 13 (1992), pp. 33-54. See also SODA '90.
14. [Fen94] P. M. FENWICK, A new data structure for cumulative frequency tables, Software: Practice and Experience, 24 (1994), pp. 327-336.
15. [FH98] M. L. FREDMAN AND M. R. HENZINGER, Lower bounds for fully dynamic connectivity problems in graphs, Algorithmica, 22 (1998), pp. 351-362.
16. [Fre81] M. L. FREDMAN, A lower bound on the complexity of orthogonal range queries, J. ACM, 28 (1981), pp. 696-705.
17. [Fre82] M. L. FREDMAN, The complexity of maintaining an array and computing its partial sums, J. ACM, 29 (1982), pp. 250-260.
18. [FS89] M. FREDMAN AND M. SAKS, The cell probe complexity of dynamic data structures, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 345-354.
19. [FW93] M. L. FREDMAN AND D. E. WILLARD, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci., 47 (1993), pp. 424-436. See also STOC '90.
20. [HdLT01] J. HOLM, K. DE LICHTENBERG, AND M. THORUP, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, J. ACM, 48 (2001), pp. 723-760. See also STOC '98.
21. [HF98] H. HAMPAPURAM AND M. L. FREDMAN, Optimal biweighted binary trees and the complexity of maintaining partial sums, SIAM J. Comput., 28 (1998), pp. 1-9. See also FOCS '93.
22. [HK99] M. R. HENZINGER AND V. KING, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, J. ACM, 46 (1999), pp. 502-516. See also STOC '95.
23. [HR03] T. HUSFELDT AND T. RAUHE, New lower bound techniques for dynamic partial sums and related problems, SIAM J. Comput., 32 (2003), pp. 736-753. See also ICALP '98.
24. [HRS96] T. HUSFELDT, T. RAUHE, AND S. SKYUM, Lower bounds for dynamic transitive closure, planar point location, and parentheses matching, Nordic J. Comput., 3 (1996), pp. 323-336.
25. [HSS03] W.-K. HON, K. SADAKANE, AND W.-K. SUNG, Succinct data structures for searchable partial sums, in Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Comput. Sci. 2906, Springer-Verlag, Berlin, 2003, pp. 505-516.
26. [HT97] M. R. HENZINGER AND M. THORUP, Sampling to provide or to bound: With applications to fully dynamic graph algorithms, Random Structures Algorithms, 11 (1997), pp. 369-379. See also ICALP '96.
27. [IPH93] G. F. ITALIANO, J. A. LA POUTRE, AND M. R. HENZINGER, Fully dynamic planarity testing in embedded graphs, in Proceedings of the 1st Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 726, Springer-Verlag, Berlin, 1993, pp. 212-223.
28. [Mil99] P. B. MILTERSEN, Cell probe complexity - a survey, presented at the Pre-Conference Workshop on Advances in Data Structures at the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999. Available online at http://www.daimi.au.dk/~bromille/ Papers/
29. [MNSW98] P. B. MILTERSEN, N. NISAN, S. SAFRA, AND A. WIGDERSON, On data structures and asymmetric communication complexity, J. Comput. System Sci., 57 (1998), pp. 37-49. See also STOC '95.
30. [MSVT94] P. B. MILTERSEN, S. SUBRAMANIAN, J. S. VITTER, AND R. TAMASSIA, Complexity models for incremental computation, Theoret. Comput. Sci., 130 (1994), pp. 203-236. See also STAGS '93.
31. [RRR01] R. RAMAN, V. RAMAN, AND S. S. RAO, Succinct dynamic data structures, in Proceedings of the 7th Annual Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Comput. Sci. 2125, Springer-Verlag, Berlin, 2001, pp. 426-437.
32. [ST83] D. D. SLEATOR AND R. E. TARJAN, A data structure for dynamic trees, J. Comput. System Sci., 26 (1983), pp. 362-391. See also STOC '81.
33. [SV] P. SEN AND S. VENKATESH, Lower Bounds for Predecessor Searching in the Cell Probe Model, http://www.arxiv.org/abs/cs.CC/0309033 (2003). See also ICALP '01 and CCC '03.
34. [Tho00] M. THORUP, Near-optimal fully-dynamic graph connectivity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 343-350.
35. [Wil89] R. WILBER, Lower bounds for accessing binary search trees with rotations, SIAM J. Comput., 18 (1989), pp. 56-67. See also FOCS '86.
36. [Yao77] A. C.-C. YAO, Probabilistic computations: Toward a unified measure of complexity, in Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1977, pp. 222-227.
37. [Yao85] A. C.-C. YAO, On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), pp. 277-288.