25th Annual Symposium onFoundations of Computer Science, 1984. (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
P. Tiwari , University of Illinois at Urbana-Champaign
We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication complexity on general networks by simulating them on linear arrays. Using this technique, we derive optimal lower bounds for ranking, distinctness, uniqueness and triangle-detection problems on the ring. The application of this technique to meshes and trees yields nontrivial near optimal lower bounds on the communicaton complexity of ranking and distinctness problems on these networks.
P. Tiwari, "Lower Bounds On Communication Complexity In Distributed Computer Networks," 25th Annual Symposium onFoundations of Computer Science, 1984.(FOCS), Singer Island, FL, 1984, pp. 109-117.