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 YEAR=1988

• On the packet complexity of distributed selection
  A. Negro, N. Santoro, J. Urrutia
  Lecture Notes in Computer Science 312, 1988, pp. 108-115
• 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
• 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
• Constructing efficient election algorithms from efficient traversal algorithms
  H. Attiya
  Lecture Notes in Computer Science 312, 1988, pp. 337-344
• 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
• From T(m) triangular graphs to single-error-correcting codes
  J.M. Basart, L. Huguet
  Lecture Notes in Computer Science 307, 1988, pp. 5-12
• Integration of graphical tools in a computer algebra system
  Guilherme Bittencourt
  Lecture Notes in Computer Science 307, 1988, pp. 13-24
• Type inference using unification in computer algebra
  J. Calmet, H. Comon, D. Lugiez
  Lecture Notes in Computer Science 307, 1988, pp. 25-28
• The weight distribution of double-error-correcting Goppa codes
  Arne Dür
  Lecture Notes in Computer Science 307, 1988, pp. 29-42
• A simple analysis of the Blokh-Zyablov decoding algorithm
  Thomas Ericson
  Lecture Notes in Computer Science 307, 1988, pp. 43-57
• Design of a Viterbi decoder with microprocessor-based serial implementation
  F.J. García-Ugalde, R.H. Morelos-Zaragoza A.
  Lecture Notes in Computer Science 307, 1988, pp. 58-67