Lower bounds for dynamic connectivity

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 546-553

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cell probe complexity; Dynamic connectivity; Dynamic graph problems; Lower bounds for data structures; Partial sums problem

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; GRAPH THEORY; PROBLEM SOLVING; RANDOM ACCESS STORAGE; THEOREM PROVING;

CELL PROBE COMPLEXITY; DYNAMIC CONNECTIVITY; DYNAMIC GRAPH PROBLEMS; PARTIAL SUMS PROBLEMS;

DATA STRUCTURES;

EID: 4544221120     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007435     Document Type: Conference Paper

References (19)

1. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38-72, 2002.
2. P. F. Dietz. Optimal algorithms for list indexing and subset rank. In Proc. 1st Workshop on Algorithms and Data Structures (WADS), pages 39-46, 1989.
3. 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. Journal of Computer and System Sciences, 13(1):33-54, 1992.
4. P. M. Fenwick. A new data structure for cumulative frequency tables. Software: Practice and Experience, 24(3):327-336, 1994.
5. M. L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250-260, 1982.
6. M. L. Fredman and M. R. Henzinger. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica, 22(3):351-362, 1998.
7. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM Symposium on Theory of Computing (STOC), pages 345-354, 1989.
8. H. Hampapuram and M. L. Fredman. Optimal biweighted binary trees and the complexity of maintaining partial sums. SIAM Journal on Computing, 28(1):1-9, 1998.
9. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4):502-516, 1999.
10. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM, 48(4):723-760, 2001.
11. W.-K. Hon, K. Sadakane, and W.-K. Sung. Succinct data structures for searchable partial sums. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC), pages 505-516, 2003.
12. T. Husfeldt and T. Rauhe. New lower bound techniques for dynamic partial sums and related problems. SIAM Journal on Computing, 32(3):736-753, 2003.
13. P. B. Miltersen. Cell probe complexity - a survey. In Advances in Data Structures Workshop, Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999.
14. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130(1):203-236, 1994.
15. M. Pǎtraşcu and E. D. Demaine. Tight bounds for the partial-sums problem. In Proc. 15th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 20-29, 2004.
16. R. Raman, V. Raman, and S. S. Rao. Succinct dynamic data structures. In Proc. 7th Workshop on Algorithms and Data Structures (WADS), pages 426-437, 2001.
17. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
18. M. Thorup. Near-optimal fully-dynamic graph connectivity. In Proc. 32nd ACM Symposium on Theory of Computing (STOC), pages 343-350, 2000.
19. A. C.-C. Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, 1981.