A generalization of a lower bound technique due to Fredman and Saks

Algorithmica (New York)

Volumn 30, Issue 1, 2001, Pages 34-66

  Ben Amram, A M ^a   Galil, Z ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Cell probe; Chronogram method; Dynamic data structures; Prefix sums; Union find

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING;

CELL PROBES;

DATA STRUCTURES;

EID: 0005308461     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010077     Document Type: Article

References (32)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. M. Ajtai, M. L. Fredman and J. Komlós, Hash functions for priority queues, Information and Control, 63(3) (1984), 217-225.
3. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
4. S. Alstrup, A. M. Ben-Amram and T. Rauhe, Worst-case and amortised optimality in union-find, Proc. 31st ACM Symposium on Theory of Computing (STOC), 1999, pp. 499-506.
5. S. Alstrup, T. Husfeldt and T. Rauhe, Marked ancestor problems, Proc. 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 534-543.
6. L. Banachowski, A complement to Tarjan's result about the lower bound on the complexity of the set union problem. Information Processing Letters, 11 (1980), 59-65.
7. P. Beame and F. Fich, Optimal bounds for the predecessor problem, Proc. 31st ACM Symposium on Theory of Computing (STOC), 1999, pp. 295-304.
8. A. M. Ben-Amram, On the Power of Random Access Machines, Thesis, Tel-Aviv University, 1995.
9. A. M. Ben-Amram and Z. Galil, Lower bounds for data structure problems in RAMs, 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), San Juan, PR, 1991, pp. 622-631.
10. N. Blum, On the single-operation worst-case time complexity of the disjoint set union problem, SIAM Journal on Computing, 15(4) (1986), 1021-1024.
11. N. H. Bshouty, Lower bounds for the complexity of functions in random access machines, Journal of the ACM, 40(2) (1993), 211-223.
12. P. F. Dietz, Optimal algorithms for list indexing and subset rank, Proc. Workshop on Algorithms and Data Structures (WADS), 1989, pp. 39-46.
13. M. L. Fredman, Lower bounds for dynamic algorithms, Proc. 4th Scandinavian Workshop on Algorithm Theory (1994), pp. 167-171 (LNCS 824, Springer-Verlag, Berlin).
14. M. L. Fredman, Observations on the complexity of generating quasi-Gray codes, SIAM Journal on Computing, 7(3) (1978), 134-146.
15. M. L. Fredman, The complexity of maintaining an array and computing its partial sums, Journal of the ACM, 29(1) (1982), 250-260.
16. M. L. Fredman and M. R. Henzinger, Lower bounds for fully dynamic connectivity problems in graphs, Algorithmica, 22(3) (1998), 351-362.
17. M. L. Fredman and M. E. Saks, On the cell probe complexity of dynamic data structures, Proc. 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, 1989, pp. 345-354.
18. M. L. Fredman, J. Komlós and E. Szemerédi, Storing a sparse table with Ο(1) worst case access time, Journal of the ACM, 31(3) (1984), 538-544.
19. H. N. Gabow, A scaling algorithm for weighted matching on general graphs, Proc. 26th Symposium on Foundations of Computer Science (FOCS), 1995, pp. 90-100.
20. H. N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proc. 1st Symposium on Discrete Algorithms (SODA), 1990, pp. 434-443.
21. H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Journal of Computer and System Sciences, 30 (1985), 209-221.
22. Z. Galil and G. F. Italiano, Data structures and algorithms for disjoint set union problems, ACM Computing Surveys, 23(3) (1991), pp. 319-344.
23. T. Husfeldt and T. Rauhe, Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method, Proc. 25th International Conference on Automata, Languages and Programming (ICALP), 1998, pp. 67-78.
24. J. A. La Poutré, New techniques for the union-find problem, Proc. First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 54-63. Full version: Technical Report RUU-CS-89-19, Department of Computer Science, Utrecht University, 1989.
25. J. A. La Poutré, Lower bounds for the Union-Find and the Split-Find problem on pointer machines, Journal of Computer and System Sciences, 52(1) (1996), 87-99.
26. P. B. Miltersen, Lower bounds for union-split-find related problems on random access machines, Proc. 26th ACM Symposium on Theory of Computing (STOC), 1994, pp. 625-634.
27. P. B. Miltersen, N. Nisan, S. Safra and A. Wigderson, On data structures and asymmetric communication complexity, Proc. 27th ACM Symposium on Theory of Computing (STOC), 1995, pp. 103-111.
28. R. Péter, Recursive Functions, I. Földes (tr.), Academic Press, New York, and Akadémiai Kiadó, Budapest, 1967.
29. M. H. M. Smid, A data structure for the Union-Find problem having good single-operation complexity, in ALCOM: Algorithms Review, Newsletter of the ESPRIT II Basic Research Actions Program Project No. 3075 (ALCOM), 1990.
30. R. E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, Journal of Computer and System Sciences, 18 (1979), 110-127.
31. R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
32. A. C. Yao, Should tables be sorted?, Journal of the ACM, 28 (1981), 615-628.