Information Transfer in Distributed Computing with Applications to VLSI

DOI10.1145/2422.322421MaRDI QIDQ3028340zbMATH OpenOpenAlexFDO

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

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422.322421

zbMATH Keywords

amount of interprocessor communicationarea-time complexitychip complexitydistributed computinginformation transferlower boundsVLSI

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(7)

• Area-time lower-bound techniques with applications to sorting
• Lower bounds on communication complexity
• Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
• The communication complexity of several problems in matrix computation
• Probabilistic communication complexity
• Semelectivity is not sufficient
• Communication complexity of PRAMs

This page was built for publication: Information Transfer in Distributed Computing with Applications to VLSI

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