Works of Nancy Lynch: Recent submissions

Now showing items 76-78 of 100

    • Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication 

      Newport, Calvin Charles; Kuhn, Fabian; Lynch, Nancy Ann (Association for Computing Machinery, 2009)
      We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ...

    • Brief announcement: Minimum spanning trees and cone-based topology control 

      Cornejo Collado, Alex; Lynch, Nancy Ann (Association for Computing Machinery, 2009)
      Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensuring the communication graph remains ...

    • Distributed Computation in Dynamic Networks 

      Oshman, Rotem; Lynch, Nancy; Kuhn, Fabian (2009-11-10)
      In this report we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ...