Information Transfer under Different Sets of Protocols

DOI10.1137/0213052zbMath0548.68042OpenAlexW2082036845MaRDI 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

zbMATH Keywords

lower boundsVLSIdistributed computingcommunication complexityprobabilistic methodscomplexity classesprotocolsinformation transfer

Mathematics Subject Classification ID

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

Related Items

Lower bounds on communication complexity ⋮ Lower bounds for one-way probabilistic communication complexity and their application to space complexity ⋮ Communication complexity of multi-processor systems ⋮ Minimum vertex cover, distributed decision-making, and communication complexity ⋮ Lower bounds for one-way probabilistic communication complexity ⋮ Results on communication complexity classes ⋮ Lower time bounds for randomized computation ⋮ On the P versus NP intersected with co-NP question in communication complexity ⋮ Communication complexity and combinatorial lattice theory