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

• Unreliable failure detectors with limited scope accuracy and an application to consensus
  Achour Mostéfaoui, Michel Raynal
  Lecture Notes in Computer Science 1738, 1999, pp. 329-340
• Graph isomorphism: Its complexity and algorithms
  Seinosuke Toda
  Lecture Notes in Computer Science 1738, 1999, pp. 341-341
• Computing with restricted nondeterminism: The dependence of the OBDD size on the number of nondeterministic variables
  Martin Sauerhoff
  Lecture Notes in Computer Science 1738, 1999, pp. 342-355
• Lower bounds for linear transformed OBDDs and FBDDs
  Detlef Sieling
  Lecture Notes in Computer Science 1738, 1999, pp. 356-368
• A unifying framework for model checking labeled Kripke structures, modal transition systems, and interval transition systems
  Michael Huth
  Lecture Notes in Computer Science 1738, 1999, pp. 369-380
• Graded modalities and resource bisimulation
  Flavio Corradini, Rocco de Nicola, Anna Labella
  Lecture Notes in Computer Science 1738, 1999, pp. 381-393
• The non-recursive power of erroneous computation
  Christian Schindelhauer, Andreas Jakoby
  Lecture Notes in Computer Science 1738, 1999, pp. 394-406
• Analysis of quantum functions
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 1738, 1999, pp. 407-419
• On sets growing continuously
  Bernhard Heinemann
  Lecture Notes in Computer Science 1738, 1999, pp. 420-431
• Model checking knowledge and time in systems with perfect recall
  Ron van der Meyden, Nikolay V. Shilov
  Lecture Notes in Computer Science 1738, 1999, pp. 432-445
• The engineering of some bipartite matching programs
  Kurt Mehlhorn
  Lecture Notes in Computer Science 1738, 1999, pp. 446-449