The Linear-Array Conjecture in Communication Complexity Is False
暂无分享,去创建一个
[1] Richard J. Lipton,et al. Lower bounds for VLSI , 1981, STOC '81.
[2] Eyal Kushilevitz,et al. Fractional Covers and Communication Complexity , 1995, SIAM J. Discret. Math..
[3] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[4] Noam Nisan,et al. Rounds in Communication Complexity Revisited , 1993, SIAM J. Comput..
[5] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[6] Prasoon Tiwari,et al. Lower bounds on communication complexity in distributed computer networks , 1984, JACM.
[7] Martin Dietzfelbinger,et al. The linear-array problem in communication complexity resolved , 1997, STOC '97.
[8] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[9] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[10] Zvi Galil,et al. Lower Bounds on Communication Complexity , 1987, Inf. Comput..