Communication complexity of multi-processor systems

DOI10.1016/0020-0190(89)90110-5zbMath0668.68042OpenAlexW2043617806MaRDI QIDQ1118403

Rudolf Fleischer

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90110-5

zbMATH Keywords

communication complexitynondeterministic computationscommunicating processorsLas Vegas computationsmulti-processor systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Cites Work

• Unnamed Item
• Probabilistic communication complexity
• Rank and optimal computation of generic tensors
• Communication complexity
• Lectures on the complexity of bilinear problems
• Distributed algorithms in synchronous broadcasting networks
• Information Transfer under Different Sets of Protocols
• Lower bounds on communication complexity in distributed computer networks

This page was built for publication: Communication complexity of multi-processor systems