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=1320

• Towards fault-tolerant and secure agentry
  Fred B. Schneider
  Lecture Notes in Computer Science 1320, 1997, pp. 1-14
• Workflow management - An exercise in distributed computing
  Andreas Reuter
  Lecture Notes in Computer Science 1320, 1997, pp. 15-19
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
  Anna Pogosyants, Roberto Segala, Nancy Lynch
  Lecture Notes in Computer Science 1320, 1997, pp. 22-36
• A simple DFS-based algorithm for linear interval routing
  T. Eilam, S. Moran, S. Zaks
  Lecture Notes in Computer Science 1320, 1997, pp. 37-51
• ATM layouts with bounded hop count and congestion
  Michele Flammini, Enrico Nardelli, Guido Proietti
  Lecture Notes in Computer Science 1320, 1997, pp. 52-65
• Scheduling in synchronous networks and the greedy algorithm
  King-Shan Lui, Shmuel Zaks
  Lecture Notes in Computer Science 1320, 1997, pp. 66-80
• Rapid convergence of a local load balancing algorithm for asynchronous rings
  Johannes E. Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
  Lecture Notes in Computer Science 1320, 1997, pp. 81-95
• Performing tasks on restartable message-passing processors
  Bogdan S. Chlebus, Roberto de Prisco, Alex A. Shvartsman
  Lecture Notes in Computer Science 1320, 1997, pp. 96-110
• Revisiting the Paxos algorithm
  Roberto de Prisco, Butler Lampson, Nancy Lynch
  Lecture Notes in Computer Science 1320, 1997, pp. 111-125
• Heartbeat: A timeout-free failure detector for quiescent reliable communication
  Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
  Lecture Notes in Computer Science 1320, 1997, pp. 126-140
• Genuine atomic multicast
  Rachid Guerraoui, André Schiper
  Lecture Notes in Computer Science 1320, 1997, pp. 141-154
• Low-overhead time-triggered group membership
  Shmuel Katz, Pat Lincoln, John Rushby
  Lecture Notes in Computer Science 1320, 1997, pp. 155-169
• Virtual precedence in asynchronous systems: Concept and applications
  Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal
  Lecture Notes in Computer Science 1320, 1997, pp. 170-184
• Detecting global predicates in distributed systems with clocks
  Scott D. Stoller
  Lecture Notes in Computer Science 1320, 1997, pp. 185-199
• Fault tolerance bounds for memory consistency
  Jerry James, Ambuj K. Singh
  Lecture Notes in Computer Science 1320, 1997, pp. 200-214
• Precedence-based memory models
  Victor Luchangco
  Lecture Notes in Computer Science 1320, 1997, pp. 215-229
• Strong interaction fairness in a fully distributed system with unbounded speed variability
  Yuh-Jzer Joung, Jen-Yi Liao
  Lecture Notes in Computer Science 1320, 1997, pp. 230-244
• Reliable communication over partially authenticated networks
  Amos Beimel, Matthew Franklin
  Lecture Notes in Computer Science 1320, 1997, pp. 245-259
• Self-stabilizing depth-first token passing on rooted networks
  Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy K. Datta
  Lecture Notes in Computer Science 1320, 1997, pp. 260-274
• Secure distributed storage and retrieval
  Juan A. Garay, Rosario Gennaro, Charanjit Jutla, Tal Rabin
  Lecture Notes in Computer Science 1320, 1997, pp. 275-289
• Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system
  Michiko Inoue, Sen Moriya, Toshimitsu Masuzawa, Hideo Fujiwara
  Lecture Notes in Computer Science 1320, 1997, pp. 290-304
• Transparent support for wait-free transactions
  Mark Moir
  Lecture Notes in Computer Science 1320, 1997, pp. 305-319
• On the power of multi-objects
  Prasad Jayanti, Sanjay Khanna
  Lecture Notes in Computer Science 1320, 1997, pp. 320-332