Farid M. Ablayev. Lower Bounds for One-way Probabilistic Communication Complexity. In Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson, editors, Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings. Volume 700 of Lecture Notes in Computer Science, pages 241-252, Springer, 1993.
Abstract is missing.