Randomized communication protocols (a survey)

DOI10.1007/3-540-45322-9_1MaRDI QIDQ4739596zbMATH OpenFDO

Authors Juraj Hromkovič

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2264/22640001.htm

zbMATH Keywords

communication complexityrandomized computingtwo-party protocols

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 1857650
• scientific article; zbMATH DE number 4197419
• scientific article; zbMATH DE number 1263236
• scientific article; zbMATH DE number 1769898
• Information Transfer under Different Sets of Protocols

Cited in

(9)

• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
• Information Transfer under Different Sets of Protocols
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
• Randomised Broadcasting: Memory vs. Randomness
• Randomized parallel communications on an extension of the omega network
• scientific article; zbMATH DE number 1769898 (Why is no real title available?)
• scientific article; zbMATH DE number 1857650 (Why is no real title available?)
• The Power of Shared Randomness in Uncertain Communication
• scientific article; zbMATH DE number 7204504 (Why is no real title available?)

This page was built for publication: Randomized communication protocols (a survey)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739596)