Learn More
We prove the following four results on communication complexity: 1) For every k &#8805; 2, the language L<subscrpt>k</subscrpt> of encodings of directed graphs of out degree one that contain a path of length k+1 from the first vertex to the last vertex and can be recognized by exchanging O(k log n) bits using a simple k-round protocol requires exchanging(More)
K e y w o r d s : c o m p u t a t i o n a l and s t r u c t u r a l complexi ty , Las Vegas, d e t e r m i n ism, c o m m u n i c a t i o n complexi ty , a u t o m a t a * The work of this author has been supported by DFG Project HR 14/3-1. Reischuk, Morvan (Eds.): STACS'97 Proceedings, LNCS 1200 (~) Sprlnger-Verlag Berlin Heidelberg 1997 118 P. Duri~, J.(More)
We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communication delays and crossing sequence arguments with consideration of the speed of propagation of messages, together with careful counting of messages in different parts of(More)