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

• A distributed spanning tree algorithm
  K.E. Johansen, U.L. Jrgensen, S.H. Nielsen, S. Skyum
  Lecture Notes in Computer Science 312, 1988, pp. 1-12
• Directed network protocols
  G. Tel
  Lecture Notes in Computer Science 312, 1988, pp. 13-29
• Fault tolerant queries in computer networks
  A. Baratz, I. Gopal, T.J. Watson, A. Segall
  Lecture Notes in Computer Science 312, 1988, pp. 30-40
• General and efficient decentralized consensus protocols
  J.-C. Bermond, J.-C. Konig, M. Raynal
  Lecture Notes in Computer Science 312, 1988, pp. 41-56
• A framework for agreement
  K.J. Perry
  Lecture Notes in Computer Science 312, 1988, pp. 57-75
• Byzantine firing squad using a faulty external source
  E.T. Ordman
  Lecture Notes in Computer Science 312, 1988, pp. 76-83
• An improved multiple identification algorithmm for synchronous broadcasting networks
  W. Vogler
  Lecture Notes in Computer Science 312, 1988, pp. 84-91
• Distributed algorithms for tree pattern matching
  G. Singh, S.A. Smolka, I.V. Ramakrishnan
  Lecture Notes in Computer Science 312, 1988, pp. 92-107
• On the packet complexity of distributed selection
  A. Negro, N. Santoro, J. Urrutia
  Lecture Notes in Computer Science 312, 1988, pp. 108-115
• Load balancing in a network of transputers
  O. Vornberger
  Lecture Notes in Computer Science 312, 1988, pp. 116-126
• Experience with a new distributed termination detection algorithm
  F. Mattern
  Lecture Notes in Computer Science 312, 1988, pp. 127-143
• A distributed deadlock avoidance technique
  F. Belik
  Lecture Notes in Computer Science 312, 1988, pp. 144-154
• How to detect a failure and regenerate the token in the log(N) distributed algorithm for mutual exclusion
  M. Naimi, M. Trehel
  Lecture Notes in Computer Science 312, 1988, pp. 155-166
• Verification of conncection-management protocols
  A.A. Schoone
  Lecture Notes in Computer Science 312, 1988, pp. 167-186
• Generalized scheme for topology-update in dynamic networks
  E. Gafni
  Lecture Notes in Computer Science 312, 1988, pp. 187-196
• Local fail-safe network reset procedure
  Y. Afek, B. Awerbuch, E. Gafni
  Lecture Notes in Computer Science 312, 1988, pp. 197-211
• Synchronizing asynchronous bounded delay networks
  C.-T. Chou, I. Cidon, I.S. Gopal, S. Zaks
  Lecture Notes in Computer Science 312, 1988, pp. 212-218
• A modular proof of correctness for a network synchronizer
  A. Fekete, N. Lynch, L. Shrira
  Lecture Notes in Computer Science 312, 1988, pp. 219-256
• On the use of synchronizers for asynchronous communication networks
  K.B. Lakshmanan, K. Thulasiraman
  Lecture Notes in Computer Science 312, 1988, pp. 257-277
• Atomic multireader register
  L.M. Kirousis, E. Kranakis, P.M.B. Vitányi
  Lecture Notes in Computer Science 312, 1988, pp. 278-296
• An optimistic resiliency control scheme for distributed database systems
  K. Vidyasankar, T. Minoura
  Lecture Notes in Computer Science 312, 1988, pp. 297-309
• A failsafe scheme for replicated information
  R. Kerboul, R. Kung, F. Richard
  Lecture Notes in Computer Science 312, 1988, pp. 310-323
• Randomized function evaluation on a ring
  K. Abrahamson, A. Adler, L. Higham, D. Kirkpatrick
  Lecture Notes in Computer Science 312, 1988, pp. 324-331
• A distributed ring orientation algorithm
  V. Syrotiuk, J. Pachl
  Lecture Notes in Computer Science 312, 1988, pp. 332-336
• Constructing efficient election algorithms from efficient traversal algorithms
  H. Attiya
  Lecture Notes in Computer Science 312, 1988, pp. 337-344