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.
@inproceedings{Ablayev93,
title = {Lower Bounds for One-way Probabilistic Communication Complexity},
author = {Farid M. Ablayev},
year = {1993},
researchr = {https://researchr.org/publication/Ablayev93},
cites = {0},
citedby = {0},
pages = {241-252},
booktitle = {Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
editor = {Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson},
volume = {700},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-56939-1},
}