Communication versus computation

DOI10.1007/978-3-540-27836-8_63MaRDI QIDQ5466510zbMATH OpenOpenAlexFDO

Authors Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh

Publication date 24 August 2005

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

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Communication vs. computation
• Communication complexity
• Communication Complexity
• Communication complexity
• scientific article; zbMATH DE number 3881884
• Communication complexity
• scientific article; zbMATH DE number 4147508
• Communication complexity and parallel computing
• Communication Complexity

Cited in

(9)

• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Trade-offs between communication and space
• Optimal series-parallel trade-offs for reducing a function to its own graph
• The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
• Communication vs. computation
• scientific article; zbMATH DE number 981682 (Why is no real title available?)
• The hardness of median in the synchronized bit communication model
• A Communication-Time Tradeoff
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols

This page was built for publication: Communication versus computation

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