Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds

DOI10.1007/s002240000131zbMath0951.68003OpenAlexW4233979608MaRDI QIDQ1818090

Franco P. Preparata, Gianfranco Bilardi

Publication date: 2 February 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

closed-dichotomy-size technique

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Communication lower bounds and optimal algorithms for numerical linear algebra