Journal of the ACM · 1984 · 44 citations · 9 references
ComputingComputer EngineeringComputer ScienceComputer NetworksDigital CommunicationDistributed SystemsDistributed ComputingInterprocess CommunicationVlsi Implementation
Simple general lower bound techniques are developed for measuring the amount of interprocessor commumcatlon required in distributed computing. Optimal bounds are shown for many problems, such as integer multiplication, integer division, matrix squaring, matrix inversion, solving a linear system of equations, and computing square roots. Using these techniques, one can unify and strengthen the area-time trade-off results known in the literature. Many new trade-off results are also shown in several of the existing models Categories and SubJect Descriptors: B.7. l
9
<i>Transmission of Information</i>
Robert M. Fano, W. T. Wintringham · Physics Today · 1961 · 540 citations
Clark D. Thompson · 1979 · 474 citations
Engineering, Computer Engineering, Electrical Engineering +17
Amiel Feinstein, Robert M. Fano · Journal of the American Statistical Association · 1962 · 364 citations
Richard J. Lipton, Robert Sedgewick · 1981 · 144 citations