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	Hilfe

Suche: Series=LNCS AND Volume=972

• The triumph and tribulation of system stabilization
  Mohamed G. Gouda
  Lecture Notes in Computer Science 972, 1995, pp. 1-18
• Wait-free computing
  Prasad Jayanti
  Lecture Notes in Computer Science 972, 1995, pp. 19-50
• On real-time and non real-time distributed computing
  G. Le Lann
  Lecture Notes in Computer Science 972, 1995, pp. 51-70
• Theory and practice in distributed systems
  Danny Dolev
  Lecture Notes in Computer Science 972, 1995, pp. 71-71
• The inherent cost of strong-partial view-synchronous communication
  Özalp Babaoğlu, Renzo Davoli, Luigi Giachini, Paolo Sabattini
  Lecture Notes in Computer Science 972, 1995, pp. 72-86
• Revisiting the relationship between non-blocking atomic commitment and consensus
  Rachid Guerraoui
  Lecture Notes in Computer Science 972, 1995, pp. 87-100
• Dissecting distributed coordination
  Aleta Ricciardi
  Lecture Notes in Computer Science 972, 1995, pp. 101-115
• Optimal broadcast with partial knowledge
  Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg
  Lecture Notes in Computer Science 972, 1995, pp. 116-130
• Multi-dimensional interval routing schemes
  Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
  Lecture Notes in Computer Science 972, 1995, pp. 131-144
• Data transmission in processor networks
  Andreas Jakoby, Rüdiger Reischuk
  Lecture Notes in Computer Science 972, 1995, pp. 145-159
• Distributed protocols against mobile eavesdroppers
  P. Spirakis, B. Tampakas, H. Antonopoulou
  Lecture Notes in Computer Science 972, 1995, pp. 160-167
• Universal constructions for large objects
  James H. Anderson, Mark Moir
  Lecture Notes in Computer Science 972, 1995, pp. 168-182
• Load balancing: An exercise in constrained convergence
  Anish Arora, Mohamed G. Gouda
  Lecture Notes in Computer Science 972, 1995, pp. 183-197
• Larchant-RDOSS: A distributed shared persistent memory and its garbage collector
  Marc Shapiro, Paulo Ferreira
  Lecture Notes in Computer Science 972, 1995, pp. 198-214
• Broadcasting in hypercubes with randomly distributed Byzantine faults
  Feng Bao, Yoshihide Igarashi, Keiko Katano
  Lecture Notes in Computer Science 972, 1995, pp. 215-229
• On the number of authenticated rounds in Byzantine agreement
  Malte Borcherding
  Lecture Notes in Computer Science 972, 1995, pp. 230-241
• Total ordering algorithms for asynchronous Byzantine systems
  Louise E. Moser, P.M. Melliar-Smith
  Lecture Notes in Computer Science 972, 1995, pp. 242-256
• A uniform self-stabilizing minimum diameter spanning tree algorithm
  Franck Butelle, Christian Lavault, Marc Bui
  Lecture Notes in Computer Science 972, 1995, pp. 257-272
• Self-stabilization of wait-free shared memory objects
  Jaap-Henk Hoepman, Marina Papatriantafilou, Philippas Tsigas
  Lecture Notes in Computer Science 972, 1995, pp. 273-287
• Deterministic, constant space, self-stabilizing leader election on uniform rings
  Gene Itkis, Chengdian Lin, Janos Simon
  Lecture Notes in Computer Science 972, 1995, pp. 288-302
• Efficient detection of restricted classes of global predicates
  Craig M. Chase, Vijay K. Garg
  Lecture Notes in Computer Science 972, 1995, pp. 303-317
• Faster possibility detection by combining two approaches
  Scott D. Stoller, Fred B. Schneider
  Lecture Notes in Computer Science 972, 1995, pp. 318-332