On Randomized One-Round Communication Complexity

Ilan Kremer, Noam Nisan, Dana Ron

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Original language	Undefined/Unknown
Title of host publication	Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing
Place of Publication	New York, NY, USA
Publisher	Association for Computing Machinery
Pages	596–605
ISBN (Print)	0897917189
DOIs	https://doi.org/10.1145/225058.225277
State	Published - 1995

Name	STOC '95
Publisher	Association for Computing Machinery

Access to Document

@inproceedings{90cd1c58d2b841b8b64c921f502f8321,

title = "On Randomized One-Round Communication Complexity",

author = "Ilan Kremer and Noam Nisan and Dana Ron",

year = "1995",

doi = "10.1145/225058.225277",

language = "???core.languages.und???",

isbn = "0897917189",

series = "STOC '95",

publisher = "Association for Computing Machinery",

pages = "596–605",

booktitle = "Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - On Randomized One-Round Communication Complexity

AU - Kremer, Ilan

AU - Nisan, Noam

AU - Ron, Dana

PY - 1995

Y1 - 1995

U2 - 10.1145/225058.225277

DO - 10.1145/225058.225277

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

SN - 0897917189

T3 - STOC '95

SP - 596

EP - 605

BT - Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing

PB - Association for Computing Machinery

CY - New York, NY, USA

ER -