Some bounds on multiparty communication complexity of pointer jumping

Computational Complexity

Volumn 7, Issue 2, 1998, Pages 109-127

  Damm, Carsten ^a   Sgall, Jiří ^b   Jukna, Stasys ^a,c  

^a UNIVERSITY OF TRIER   (Germany)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c Institute of Mathematics   (Lithuania)

Author keywords

Multiparty communication complexity; One way protocols; Pointer jumping

Indexed keywords

EID: 0040098263     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001595     Document Type: Article

References (23)

1. A. AMBAINIS, Upper bounds on multiparty communication complexity of shifts. In Proc. 13th Ann. Symp. on Theor. Aspects of Comput. Sci. Springer Lecture Notes in Comput. Sci., 1046 (1996), 631-642.
2. L. BABAI, N. NISAN, AND M. SZEGEDY, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci. 45 (1992), 204-232.
3. L. BABAI, G. KIMMEL, AND S. V. LOKAM, Simultaneous messages vs. communication. In Proc. 12th Ann. Symp. on Theor. Aspects of Comput. Sci. Springer Lecture Notes in Comput. Sci., 900 (1995), 361-372.
4. R. BEIGEL AND J. TARUI, On ACC. Comput complexity (1994), 350-366.
5. B. BOLLIG, M. SAUERHOFF, D. SIELING, AND I. WEGENER, On the power of different types of restricted branching programs. Electronic Colloqium on Computational Complexity, Report Nr. TR94-026) 1994. To appear in: Theoretical Comput. Sci.
6. A. K. CHANDRA, M. L. FURST, AND R. J. LIPTON, Multi-party protocols. In Proc. 15th Ann. ACM Symp. Theory of Computing, 1983, 94-99.
7. F.R.K. CHUNG AND P. TETALI, Communication complexity and quasi-randomness SIAM J. Disc. Math. 6(1) (1993), 110-123.
8. C. DAMM AND S. JUKNA, On multiparty games for pointer jumping. Tech. Rep. Forschungsbericht Mathematik/Informatik Nr. 95-09, Universität Trier, 1995.
9. C. DAMM, S. JUKNA AND J. SGALL, Some bounds on multiparty communication complexity of pointer jumping. In Proc. 13th Ann. Symp. on Theor. Aspects of Comput. Sci., Springer Lecture Notes in Comput. Sci., 1046 (1996), 643-654.
10. P. DURIŠ, Z. GALIL, AND G. SCHNITGER, Lower bounds on communication complexity. Inform. and Comput. 73 (1987), 1-22.
11. 1. In Proc. 6th Structure in Complexity Theory. IEEE, 1991, 294-298.
12. V. GROLMUSZ, The BNS Lower Bound for Multi-party Protocols is Nearly Optimal. Inform. and Comput. 112 (1994), 51-54.
13. J. HÅSTAD AND M. GOLDMANN, On the power of small-depth threshold circuits. Comput complexity 1 (1991), 113-129.
14. R. IMPAGLIAZZO. Personal communication, 1995.
15. E. KUSHILEVITZ AND N. NISAN, Communication Complexity. Cambridge University Press, to appear.
16. N. NISAN AND A. WIGDERSON, Rounds in communication complexity revisited. SIAM J. Comput. 22(1) (1993).
17. C. PAPADIMITRIOU AND M. SIPSER, Communication complexity. J. Comput. System Sci. 28 (1984), 260-269.
18. P. PUDLÁK AND V. RÖDL, Modified ranks of tensors and the size of circuits. In Proc 24th Ann. ACM Symp. Theory of Computing, 1993, 523-531.
19. P. PUDLÁK, V. RÖDL, AND J. SGALL, Boolean circuits, tensor ranks and communication complexity. SIAM J. Comput. (to appear).
20. R. RAZ, The BNS-Chung criterion for multi-party communication complexity. Manuscript, 1995.
21. L. G. VALIANT, Graph-theoretic arguments in low level complexity. In Proc. 6th Symp. Math. Found. of Comput. Sci., Springer Lecture Notes in Comput. Science (1977), 162-176.
22. A. WIGDERSON. Personal communication, 1996.
23. A. C.-C. YAO, On ACC and threshold circuits. In Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, 619-627.