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 Volume=1373

• Constructing of non-intersecting colored flows through a planar cellular figure
  Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila
  Lecture Notes in Computer Science 1373, 1998, pp. 587-595
• Recursively enumerable reals and Chaitin \Omega numbers
  Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, Yongge Wang
  Lecture Notes in Computer Science 1373, 1998, pp. 596-606
• Uniformly defining complexity classes of functions
  Sven Kosub, Heinz Schmitz, Heribert Vollmer
  Lecture Notes in Computer Science 1373, 1998, pp. 607-617
• Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width
  Denis Lapoire
  Lecture Notes in Computer Science 1373, 1998, pp. 618-628