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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1992

• 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
• Structuring and modularizing algebraic specifications: The PLUSS specification language, evolutions and perspectives
  Marie-Claude Gaudel
  Lecture Notes in Computer Science 577, 1992, pp. 3-18
• The parallel complexity of tree embedding problems
  Arvind Gupta, Naomi Nishimura
  Lecture Notes in Computer Science 577, 1992, pp. 21-32
• A theory of strict \P-completeness
  Anne Condon
  Lecture Notes in Computer Science 577, 1992, pp. 33-44
• Fast and optimal simulations between CRCW PRAMs
  Torben Hagerup
  Lecture Notes in Computer Science 577, 1992, pp. 45-56
• Axiomatizations of backtracking
  Michel Billaud
  Lecture Notes in Computer Science 577, 1992, pp. 71-82
• Equality and disequality constraints on direct subterms in tree automata
  B. Bogaert, S. Tison
  Lecture Notes in Computer Science 577, 1992, pp. 161-171
• Deterministic regular languages
  Anne Brüggemann-Klein, Derick Wood
  Lecture Notes in Computer Science 577, 1992, pp. 173-184
• Locally definable acceptance types for polynomial time machines
  Ulrich Hertrampf
  Lecture Notes in Computer Science 577, 1992, pp. 199-207
• The theory of the polynomial many-one degrees of recursive sets is undecidable
  Klaus Ambos-Spies, André Nies
  Lecture Notes in Computer Science 577, 1992, pp. 209-218
• A plane-sweep algorithm for finding a closest pair among convex planar objects
  Frank Bartling, Klaus Hinrichs
  Lecture Notes in Computer Science 577, 1992, pp. 221-232
• The log-star revolution
  Torben Hagerup
  Lecture Notes in Computer Science 577, 1992, pp. 259-278
• Separating counting communication complexity classes
  Carsten Damm, Matthias Krause, Christoph Meinel, Stephen Waack
  Lecture Notes in Computer Science 577, 1992, pp. 281-292
• A nonlinear lower bound on the practical combinatorial complexity
  Xaver Gubás, Juraj Hromkovic̑, Juraj Waczulik
  Lecture Notes in Computer Science 577, 1992, pp. 293-302
• Characterizations of some complexity classes between \Theta^p_n and \Delta^p_2
  Jorge Castro, Carlos Seara
  Lecture Notes in Computer Science 577, 1992, pp. 305-317
• On complexity classes and algorithmically random languages
  Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
  Lecture Notes in Computer Science 577, 1992, pp. 319-328
• Interval approximations of message causality in distributed executions
  Claire Diehl, Claude Jard
  Lecture Notes in Computer Science 577, 1992, pp. 363-374