Rounds in communication complexity revisited
暂无分享,去创建一个
[1] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.
[2] Noam Nisan,et al. The computational complexity of universal hashing , 1990, STOC '90.
[3] Noam Nisan,et al. Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.
[4] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[5] Mihalis Yannakakis,et al. On monotone formulae with restricted depth , 1984, STOC '84.
[6] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[7] Andrew C. Yao,et al. Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[9] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..
[10] Rüdiger Reischuk,et al. On different modes of communication , 1988, STOC '88.
[11] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[12] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[13] Christos H. Papadimitriou,et al. Communication complexity , 1982, STOC '82.
[14] Ran Raz,et al. Probabilistic communication complexity of Boolean relations , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[16] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[17] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[18] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[19] Noam Nisan,et al. Pseudorandom generators for space-bounded computations , 1990, STOC '90.