Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=312

• Optimal resilient ring election algorithms
  M.Y. Chan, F.Y.L. Chin
  Lecture Notes in Computer Science 312, 1988, pp. 345-354
• Fault-tolerant distributed algorithm for election in complete networks
  H.H. Abu-Amara
  Lecture Notes in Computer Science 312, 1988, pp. 355-373
• Lower bounds for synchronous networks and the advantage of local information
  R. Reischuk, M. Koshors
  Lecture Notes in Computer Science 312, 1988, pp. 374-387
• On the existence of generic broadcast algorithms in networks for communicating sequential processes
  L. Bougé
  Lecture Notes in Computer Science 312, 1988, pp. 388-407
• Stepwise removal of virtual channels in distributed algorithms
  K. Sere
  Lecture Notes in Computer Science 312, 1988, pp. 408-428