On Data Structures and Asymmetric Communication Complexity

Journal of Computer and System Sciences

Volumn 57, Issue 1, 1998, Pages 37-49

  Miltersen, Peter Bro ^a   Nisan, Noam ^b   Safra, Shmuel ^c   Wigderson, Avi ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; COMPUTATIONAL COMPLEXITY; GAME THEORY; MATHEMATICAL MODELS; THEOREM PROVING;

COMMUNICATION COMPLEXITY;

DATA STRUCTURES;

EID: 0032142025     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1577     Document Type: Article

References (26)

1. A. Andersson, Sublogarithmic searching without multiplications, in "Proc. FOCS 95," to appear.
2. A. Andersson and K. Swanson, On the difficulty of range searching, in "Proc. 4th International Workshop on Algorithms and Data Structures (WADS)," 1995, pp. 473-481.
3. M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica 8 (1988), 235-247.
4. P. Beame and F. Fich, personal communication.
5. B. Chazelle, Lower bounds for orthogonal range searching. I. the reporting case, J. Assoc. Comput. Mach. 37 (1990), 200-212.
6. P. Duris, Z. Galil, and G. Schnitger, Lower bounds of communication complexity, in "Proc. 16th ACM Symposium on Theory of Computing (STOC)", 1984, pp. 81-91.
7. M. L. Fredman, J. Komlòs, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), 538-544.
8. M. L. Fredman and D. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), 424-436.
9. B. Halstenberg, and R. Reischuk, On different codes of communication, in "Proc. 20th ACM Symposium on Theory of Computing (STOC)," 1988, pp. 162-172.
10. M. Karchmer and A. Widgerson, Monotone circuits for connectivity require superlogarithmic depth, SIAM J. Discrete Math. 3 (1990), 255-265.
11. M. Klawe, W. J. Paul, N. Pippenger, and M. Yannakakis, On monotone formulae with restricted, depth, in "Proc. 16th ACM Symposium on Theory of Computing (STOC)," 1984, pp. 480-487.
12. K. Mehlhorn, and E. M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, in "Proc. 14th ACM Symposium on Theory of Computing (STOC)," 1982, pp. 330-337.
13. P. B. Miltersen, The bit probe complexity measure revisited, in "Proc. 10th Symp. on Theoretical Aspects of Computer Science (STACS)," 1993, pp. 662-671.
14. P. B. Miltersen, Lower bounds for union-split-find related problems on random access machines, in "Proc. 26th ACM Symposium on Theory of Computing (STOC)," 1994, pp. 625-634.
15. P. B. Miltersen, On the cell probe complexity of polynomial evaluation, Theor. Comput. Sci. 143 (1995), 167-174.
16. N. Nisan, The communication complexity of threshold gates, in "Proc. of Combinatorics, Paul Erdös is Eighty," 1993, pp. 301-315.
17. N. Nisan and A. Wigderson, Rounds in communication complexity revisited, SIAM J. Comput. 22, No. 1 (1993), 211-219.
18. R. Rivest, Partial-match retrieval algorithms, SIAM J. Comput. 5 (1976), 19-50.
19. D. V. Smirnov, "Shannon's Information Methods for Lower Bounds for Probabilistic Communication Complexity," Master's thesis, Moscow University, 1988.
20. I. Wegener, "The Complexity of Boolean Functions," Computer Science Series, Wiley-Teubner, New York, 1987.
21. D. E. Willard, Log-logarithmic worst case range queries are possible in space θ(n), Inform. Process. Lett. 17 (1983), 81-84.
22. B. Xiao, "New Bounds in Cell Probe Model," Ph.D thesis, U.C. San Diego, La Jolla, 1992.
23. A. C. Yao, Probabilistic computations: Toward a unified measure of complexity, in "Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS)," 1977, pp. 222-227.
24. A. C. Yao, Some complexity questions related to distributive computing, in "Proc. 11th ACM Symposium on Theory of Computing (STOC)," 1979, pp. 209-213.
25. A. C. Yao, Should tables be sorted? J. Assoc. Comput. Mach. 28 (1981), 615-628.
26. A. C. Yao, Lower bounds by probabilistic arguments, in "Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS)," 1983, pp. 420-428.