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

• A natural metric for curves - computing the distance for polygonal chains and approximation algorithms
  Michael Godau
  Lecture Notes in Computer Science 480, 1991, pp. 127-136
• Decision problems for term rewriting systems and recognizable tree languages
  Rémi Gilleron
  Lecture Notes in Computer Science 480, 1991, pp. 148-159
• Actors as a parallel programming model
  Françoise Baude, Guy Vidal-Naquet
  Lecture Notes in Computer Science 480, 1991, pp. 184-195
• Average case analysis of unification algorithms
  Luc Albert, Rafael Casas, François Fages, Antonio Torrecillas, Paul Zimmermann
  Lecture Notes in Computer Science 480, 1991, pp. 196-213
• Computationally convincing proofs of knowledge
  Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger
  Lecture Notes in Computer Science 480, 1991, pp. 251-262
• Interactive proof systems and alternating time-space complexity
  Lance Fortnow, Carsten Lund
  Lecture Notes in Computer Science 480, 1991, pp. 263-274
• Unconditional Byzantine agreement with good majority
  Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner
  Lecture Notes in Computer Science 480, 1991, pp. 285-295
• A new compacting garbage-collection algorithm with a good average-case performance
  Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
  Lecture Notes in Computer Science 480, 1991, pp. 296-308
• Testing for unboundedness of FIFO channels
  Thierry Jeron
  Lecture Notes in Computer Science 480, 1991, pp. 322-333
• Detection of deadlocks in an infinite family of nets
  Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
  Lecture Notes in Computer Science 480, 1991, pp. 334-347
• Nondeterminism within P
  Jonathan F. Buss, Judy Goldsmith
  Lecture Notes in Computer Science 480, 1991, pp. 348-359
• Structure and importance of logspace-MOD-classes
  Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
  Lecture Notes in Computer Science 480, 1991, pp. 360-371
• Reachability in reversible free choice systems
  Jörg Desel, Javier Esparza
  Lecture Notes in Computer Science 480, 1991, pp. 384-397
• Compositional generation of home states in free choice systems
  Eike Best, Ludmila Cherkasova, Jörg Desel
  Lecture Notes in Computer Science 480, 1991, pp. 398-409
• Bounded reductions
  Harry Buhrman, Edith Spaan, Leen Torenvliet
  Lecture Notes in Computer Science 480, 1991, pp. 410-421
• Functional oracle queries as a measure of parallel time
  Carme Álvarez, José L. Balcázar, Birgit Jenner
  Lecture Notes in Computer Science 480, 1991, pp. 422-433
• The complexity of the max word problem
  Anne Condon
  Lecture Notes in Computer Science 480, 1991, pp. 456-465
• The expressive power of second order Horn logic
  Erich Grädel
  Lecture Notes in Computer Science 480, 1991, pp. 466-477
• The random testability of the n-input AND gate
  Joachim Hartmann
  Lecture Notes in Computer Science 480, 1991, pp. 488-498
• Unfolding, procedural and fixpoint semantics of logic programs
  Françoise Denis, Jean-Paul Delahaye
  Lecture Notes in Computer Science 480, 1991, pp. 511-522
• A modal semantics for the negation as failure and the closed world assumption rules
  Philippe Balbiani
  Lecture Notes in Computer Science 480, 1991, pp. 523-534
• The RELVIEW system
  Rudolf Berghammer, Gunther Schmidt
  Lecture Notes in Computer Science 480, 1991, pp. 535-536
• Geometry models design system \GammaPOM
  E.V. Biryalcev, A.M. Gusenkov, Ildar R. Nasyrov, A.A. Saveliev
  Lecture Notes in Computer Science 480, 1991, pp. 537-538
• The PROSPECTRA system
  Berthold Hoffmann, Bernd Krieg-Brückner
  Lecture Notes in Computer Science 480, 1991, pp. 539-540
• Prototype of a verification tool
  Thierry Jeron
  Lecture Notes in Computer Science 480, 1991, pp. 541-542