Selected papers that cite this one
- Benny Chor, Mihály Geréb-Graus, and Eyal Kushilevitz. Private computations over the integers. SIAM Journal on Computing, 24(2):376-386, April 1995.
- Martin Dietzfelbinger. The linear-array problem in communication complexity resolved. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 373-382, El Paso, Texas, 4-6 May 1997.
- Eyal Kushilevitz, Nathan Linial, and Rafail Ostrovsky. The linear-array conjecture of communication complexity is false. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 1-10, Philadelphia, Pennsylvania, 22-24 May 1996.