English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Time-Randomness Tradeoff for Communication Complexity

MPS-Authors
/persons/resource/persons44431

Fleischer,  Rudolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Jung,  Hermann
Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

van Leeuwen,  Jan
Max Planck Society;

Santoro,  Nicola
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Fleischer, R., Jung, H., & Mehlhorn, K. (1991). A Time-Randomness Tradeoff for Communication Complexity. In Distributed Algorithms, 4th International Workshop (pp. 390-401). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE2E-D
Abstract
There is no abstract available