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

• Bisimulation and action refinement
  Walter Vogler
  Lecture Notes in Computer Science 480, 1991, pp. 309-321
• 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
• Complexity classification of truth maintenance systems
  Vladislav Rutenburg
  Lecture Notes in Computer Science 480, 1991, pp. 372-383
• 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
• Optimal parallel recognition of bracket languages on hypercubes
  Gisela Pitsch, Elmar Schömer
  Lecture Notes in Computer Science 480, 1991, pp. 434-443
• Constant queue routing on a mesh
  Sanguthevar Rajasekaran, Richard Overholt
  Lecture Notes in Computer Science 480, 1991, pp. 444-455
• 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
• Tight bounds on the path length of binary trees
  Alfredo de Santis, Giuseppe Persiano
  Lecture Notes in Computer Science 480, 1991, pp. 478-487
• The random testability of the n-input AND gate
  Joachim Hartmann
  Lecture Notes in Computer Science 480, 1991, pp. 488-498
• An observational subset of first-order logic cannot specify the behaviour of a counter
  Oliver Schoett
  Lecture Notes in Computer Science 480, 1991, pp. 499-510
• 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
• IPG - An interactive parser generator
  Jörg Kröger, Lothar Schmitz
  Lecture Notes in Computer Science 480, 1991, pp. 543-544
• A placement system for constrained blocks with flexible shapes
  Simone Pimont
  Lecture Notes in Computer Science 480, 1991, pp. 545-546