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

• The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs
  Mitsunori Ogihara, Seinosuke Toda
  Lecture Notes in Computer Science 2136, 2001, pp. 585-597
• From bidirectionality to alternation
  Nir Piterman, Moshe Y. Vardi
  Lecture Notes in Computer Science 2136, 2001, pp. 598-610
• Syntactic semiring of a language
  Libor Polák
  Lecture Notes in Computer Science 2136, 2001, pp. 611-620
• On reducibility and symmetry of disjoint NP-pairs
  Pavel Pudlák
  Lecture Notes in Computer Science 2136, 2001, pp. 621-632
• Hierarchy of monotonically computable real numbers
  Robert Rettinger, Xizhong Zheng
  Lecture Notes in Computer Science 2136, 2001, pp. 633-644
• On the equational definition of the least prefixed point
  Luigi Santocanale
  Lecture Notes in Computer Science 2136, 2001, pp. 645-656
• On the periods of partial words
  Arseny M. Shur, Yulia V. Konovalova
  Lecture Notes in Computer Science 2136, 2001, pp. 657-665
• The size of power automata
  Klaus Sutner
  Lecture Notes in Computer Science 2136, 2001, pp. 666-677
• On the approximability of the Steiner tree problem
  Martin Thimm
  Lecture Notes in Computer Science 2136, 2001, pp. 678-689
• Alignment between two RNA structures
  Zhuozhi Wang, Kaizhong Zhang
  Lecture Notes in Computer Science 2136, 2001, pp. 690-702
• Characterization of context-free languages with polynomially bounded ambiguity
  Klaus Wich
  Lecture Notes in Computer Science 2136, 2001, pp. 703-714