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

• On the limitation of the global time assumption in distributed systems
  Uri Abraham, Shai Ben-David, Shlomo Moran
  Lecture Notes in Computer Science 579, 1992, pp. 1-8
• Causal memory
  Mustaque Ahamad, James E. Burns, Phillip W. Hutto, Gil Neiger
  Lecture Notes in Computer Science 579, 1992, pp. 9-30
• More on the power of random walks: Uniform self-stabilizing randomized algorithms
  Efthymios Anagnostou, Ran El-Yaniv
  Lecture Notes in Computer Science 579, 1992, pp. 31-51
• Pseudo read-modify-write operations: Bounded wait-free implementations
  James H. Anderson, Bojan Gros̑elj
  Lecture Notes in Computer Science 579, 1992, pp. 52-70
• Maintaining digital clocks in step
  Anish Arora, Shlomi Dolev, Mohamed Gouda
  Lecture Notes in Computer Science 579, 1992, pp. 71-79
• Implementing FIFO queues and stacks
  Hagit Attiya
  Lecture Notes in Computer Science 579, 1992, pp. 80-94
• Optimal amortized distributed consensus
  Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
  Lecture Notes in Computer Science 579, 1992, pp. 95-107
• Optimally simulating crash failures in a Byzantine environment
  Rida Bazzi, Gil Neiger
  Lecture Notes in Computer Science 579, 1992, pp. 108-128
• Efficient distributed consensus with n = (3 + \varepsilon)t processors
  Piotr Berman, Juan A. Garay
  Lecture Notes in Computer Science 579, 1992, pp. 129-142
• Randomized consensus in expected O(n^2 \log n) operations
  Gabi Bracha, Ophir Rachman
  Lecture Notes in Computer Science 579, 1992, pp. 143-150
• Using adaptive timeouts to achieve at-most-once message delivery
  Choma Chaudhuri, Brian A. Coan, Jennifer L. Welch
  Lecture Notes in Computer Science 579, 1992, pp. 151-166
• Uniform dynamic self-stabilizing leader election
  Shlomi Dolev, Amos Israeli, Shlomo Moran
  Lecture Notes in Computer Science 579, 1992, pp. 167-180
• The quickest path problem in distributed computing systems
  Yung-Chen Hung, Gen-Huey Chen
  Lecture Notes in Computer Science 579, 1992, pp. 181-192
• The communication complexity of the two list problem
  Alon Itai
  Lecture Notes in Computer Science 579, 1992, pp. 193-199
• Distributed algorithms for updating shortest paths
  Giuseppe F. Italiano
  Lecture Notes in Computer Science 579, 1992, pp. 200-211
• Minimal shared information for concurrent reading and writing
  Prasad Jayanti, Adarshpal Sethi, Errol L. Lloyd
  Lecture Notes in Computer Science 579, 1992, pp. 212-228
• Reading many variables in one atomic operation solutions with linear or sublinear complexity
  Lefteris M. Kirousis, Paul Spirakis, Philippas Tsigas
  Lecture Notes in Computer Science 579, 1992, pp. 229-241
• Analysis of distributed algorithms based on recurrence relations
  Yossi Malka, Sergio Rajsbaum
  Lecture Notes in Computer Science 579, 1992, pp. 242-253
• Detection of global state predicates
  Keith Marzullo, Gil Neiger
  Lecture Notes in Computer Science 579, 1992, pp. 254-272
• Using consistent subcuts for detecting stable properties
  Keith Marzullo, Laura Sabel
  Lecture Notes in Computer Science 579, 1992, pp. 273-288
• Atomic m-register operations
  Michael Merritt, Gadi Taubenfeld
  Lecture Notes in Computer Science 579, 1992, pp. 289-294
• A robust distributed mutual exclusion algorithm
  Sampath Rangarajan, Satish K. Tripathi
  Lecture Notes in Computer Science 579, 1992, pp. 295-308
• Message delaying synchronizers
  Lior Shabtay, Adrian Segall
  Lecture Notes in Computer Science 579, 1992, pp. 309-318