Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Errata for: ``On randomized one-round communication complexity

From MaRDI portal
Publication:1405739
Jump to:navigation, search

DOI10.1007/S000370100003zbMath1039.68553OpenAlexW1977601838MaRDI QIDQ1405739

Ilan Kremer, Dana Ron, Noam Nisan

Publication date: 26 August 2003

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370100003



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (1)

The role of randomness in the broadcast congested clique model







This page was built for publication: Errata for: ``On randomized one-round communication complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1405739&oldid=13564199"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 16:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki