On Randomized One-Round Communication Complexity

Ilan Kremer, Noam Nisan, Dana Ron

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Original languageUndefined/Unknown
Title of host publicationProceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Pages596–605
ISBN (Print)0897917189
DOIs
StatePublished - 1995

Publication series

NameSTOC '95
PublisherAssociation for Computing Machinery

Cite this