Information Transfer under Different Sets of Protocols

DOI10.1137/0213052MaRDI QIDQ3340150zbMATH OpenOpenAlexFDO

Authors V. K. Prasanna Kumar, Janos Simon, Joseph Ja'Ja'

Publication date 1984

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0213052

zbMATH Keywords

distributed computinglower boundscomplexity classescommunication complexityVLSIprotocolsprobabilistic methodsinformation transfer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Theory of operating systems (68N25)

Recommendations

• Different Modes of Communication
• scientific article; zbMATH DE number 88975
• scientific article; zbMATH DE number 2083798
• scientific article; zbMATH DE number 1857650
• Determinism vs. Nondeterminism in Multiparty Communication Complexity

Cited in

(15)

• scientific article; zbMATH DE number 5951053 (Why is no real title available?)
• scientific article; zbMATH DE number 2083798 (Why is no real title available?)
• Lower bounds for one-way probabilistic communication complexity
• Results on communication complexity classes
• Communication complexity of multi-processor systems
• Communication complexity and combinatorial lattice theory
• Minimum vertex cover, distributed decision-making, and communication complexity
• Different Modes of Communication
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• Information transfer across Chu spaces
• On the P versus NP intersected with co-NP question in communication complexity
• Lower bounds on communication complexity
• Information transmission in il systems^∗
• Lower time bounds for randomized computation
• Information transfer with a twist

This page was built for publication: Information Transfer under Different Sets of Protocols

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