Information Transfer under Different Sets of Protocols
From MaRDI portal
Publication:3340150
DOI10.1137/0213052zbMath0548.68042MaRDI QIDQ3340150
Janos Simon, V. K. Prasanna Kumar, Joseph F. 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
lower bounds; VLSI; distributed computing; communication complexity; probabilistic methods; complexity classes; protocols; information transfer
68Q25: Analysis of algorithms and problem complexity
94A15: Information theory (general)
68N25: Theory of operating systems
Related Items
Lower bounds for one-way probabilistic communication complexity, Lower time bounds for randomized computation, Minimum vertex cover, distributed decision-making, and communication complexity, On the P versus NP intersected with co-NP question in communication complexity, Lower bounds on communication complexity, Communication complexity of multi-processor systems, Results on communication complexity classes, Communication complexity and combinatorial lattice theory, Lower bounds for one-way probabilistic communication complexity and their application to space complexity