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

• Free constructions in algebraic institutions
  Andrzej Tarlecki
  Lecture Notes in Computer Science 176, 1984, pp. 526-534
• Remarks on comparing expressive power of logics of programs
  Jerzy Tiuryn, Paweƚ Urzyczyn
  Lecture Notes in Computer Science 176, 1984, pp. 535-543
• The complexity of problems concerning graphs with regularities
  K. Wagner
  Lecture Notes in Computer Science 176, 1984, pp. 544-552
• On the complexity of slice functions
  I. Wegener
  Lecture Notes in Computer Science 176, 1984, pp. 553-561
• An exponential lower bound for one-time-only branching programs
  Stanislav Z̑ák
  Lecture Notes in Computer Science 176, 1984, pp. 562-566
• A topological view of some problems in complexity theory
  Michael Sipser
  Lecture Notes in Computer Science 176, 1984, pp. 567-572
• Propositional dynamic logic with strong loop predicate
  Ryszard Danecki
  Lecture Notes in Computer Science 176, 1984, pp. 573-581