Lower bounds for Union-Split-Find related problems on random access machines

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 625-634

  Miltersen, Peter Bro ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA COMMUNICATION SYSTEMS; DATA REDUCTION; DATA STRUCTURES; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; THEOREM PROVING;

COMMUNICATION COMPLEXITY; DYNAMIC DATA STRUCTURE; LOWER BOUNDS; MONOTONE CIRCUIT; PERFECT HASHING; RANDOM ACCESS MACHINES; RANGE QUERY; STATIC PROBLEMS;

DATA STRUCTURES; COMPUTATIONAL COMPLEXITY;

PERFECT HASHING; RANDOM ACCESS MACHINES; UNION SPLIT FIND PROBLEMS;

EID: 0028016999     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195415     Document Type: Conference Paper

References (25)

1. A. Aggarwal, J. Scott Vitter, The I/O complexity of sorting and related problems, in: Proc. 14th International Colloquium on Automata, Languages and Programming (1987) 467-478.
2. M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica 8 (1988) 235-247.
3. M. Ajtai, Personal communication.
4. M. Ajtai, M. Fredman, J. Komlos, Hash functions for priority queues, in: Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science (1983) 299-303.
5. D. Angluin, L.G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, J. Comput. System Sci. 18 (1979) 155-193.
6. B. Chazelle, Lower bounds for orthogonal range searching, II: The arithmetic model, J. Assoc. Comp. Mach. 37 (1990) 439-463.
7. P. Elias, R.A. Flower, The complexity of some simple retrieval problems, J. Assoc. Comp. Mach. 22 (1975) 367-379.
8. G.S. Frandsen, P.B. Miltersen, S. Skyum, Dynamic word problems, in: Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science (1993) 470-479.
9. M.L. Fredman, Observations on the complexity of generating quasi-Gray codes, SIAM J. Comput. 7 (1978) 134-146.
10. M.L. Fredman, The complexity of maintaining an array and computing its partial sums, J. Assoc. Comput. Mach. 29 (1982) 250-260.
11. M.L. Fredman, J. Komlos, E. Szemeredi, Storing a sparse table with 0(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984) 538-544.
12. M.L. Fredman, M.E. Saks, The cell probe complexity of dynamic data structures, in: Proc. 21st Ann. ACM Symp. on Theory of Computing (1989) 345-354.
13. T. Imai, T. Asano, Dynamic segment intersection with applications, in: Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science (1984) 393-402.
14. M. Karchmer, A. Wigderson, Monotone circuits for connectivity require super-logarithmic depth, in: Proc. 18th Ann. ACM Symp. on Theory of Computing (1988) 539-550.
15. J.A. La Poutre, Lower bounds for the Union- Find and the Split-Find problem on pointer machines, in: Proc. 20th Ann. ACM Symp. on Theory of Computing (1990) 34-44.
16. K. Mehlhorn, S. Naher, Dynamic fractional cascading, Algorithmica 5 (1990).
17. K. Mehlhorn, S. Naher, H. Alt, A lower bound on the complexity of the union-split-find problem, SIAM J. Comput. 17(1988) 1093-1102.
18. P.B. Miltersen, The bit probe complexity measure revisited, in: Proc. 10th Symp. on Theoretical Aspects of Computer Science (1993) 662-671.
19. P.B. Miltersen, On the cell probe complexity of polynomial evaluation, Manuscript 1994.
20. P.B. Miltersen, S. Subramanian, J.S. Vitter, R. Tamassia, Complexity models for incremental computation, Theoretical Computer Science, to appear.
21. P.M. Vaidya, Space-Time tradeoffs for orthogonal range queries, SIAM J. Comput. 18 (1989) 748-458.
22. P. Van Emde Boas, R. Kaas, E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977) 99-127.
23. D.E. Willard, Log-logarithmic worst case range queries are possible in space 0(n), Inform. Process. Lett. 17 (1983) 81-84.
24. A.C. Yao, Should tables be sorted?, J. Assoc. Comput. Mach. 28 (1981) 615-628.
25. A.C. Yao, On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985) 277-288.