Journal Articles and Proceedings: Recent submissions

Now showing items 58-60 of 60

    • On the weakest failure detector ever 

      Kuznetsov, Petr; Herlihy, Maurice; Newport, Calvin Charles; Lynch, Nancy Ann; Guerraoui, Rachid (Springer Berlin Heidelberg, 2009-01)
      Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some ...

    • 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 ...