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

• On the structure and properties of NP-complete problems and their associated optimization problems
  Giorgio Ausiello
  Lecture Notes in Computer Science 53, 1977, pp. 1-16
• A comparative review of some program verification methods
  Andrzej Blikle
  Lecture Notes in Computer Science 53, 1977, pp. 17-33
• Classification of the context-free languages
  L. Boasson
  Lecture Notes in Computer Science 53, 1977, pp. 34-43
• Finite automaton from a flowchart scheme point of view
  Calvin C. Elgot
  Lecture Notes in Computer Science 53, 1977, pp. 44-51
• A new type of models of computation
  E. Engeler
  Lecture Notes in Computer Science 53, 1977, pp. 52-58
• Correctness of mixed computation in Algol-like programs
  A.P. Ershov, V.E. Itkin
  Lecture Notes in Computer Science 53, 1977, pp. 59-77
• Algebra and logic in theoretical computer science
  Ferenc Gécseg, Péter E.-Tóth
  Lecture Notes in Computer Science 53, 1977, pp. 78-92
• A survey of recent problems and results in analytic computational complexity
  B. Kacewicz, H. Woźniakowski
  Lecture Notes in Computer Science 53, 1977, pp. 93-107
• Tree-structures for set manipulation problems
  H.A. Maurer, Th. Ottmann
  Lecture Notes in Computer Science 53, 1977, pp. 108-121
• Applied algorithmic logic
  Andrzej Salwicki
  Lecture Notes in Computer Science 53, 1977, pp. 122-134
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
  C.P. Schnorr
  Lecture Notes in Computer Science 53, 1977, pp. 135-147
• Frequency algorithms and computations
  B.A. Trakhtenbrot
  Lecture Notes in Computer Science 53, 1977, pp. 148-161
• Graph-theoretic arguments in low-level complexity
  Leslie G. Valiant
  Lecture Notes in Computer Science 53, 1977, pp. 162-176
• Properties of complexity classes - A short survey
  Gerd Wechsung
  Lecture Notes in Computer Science 53, 1977, pp. 177-191
• A uniform approach to inductive posets and inductive closure
  J.B. Wright, E.G. Wagner, J.W. Thatcher
  Lecture Notes in Computer Science 53, 1977, pp. 192-212
• Generalized probabilistic grammars
  V.N. Agafonov
  Lecture Notes in Computer Science 53, 1977, pp. 213-221
• Classes of structurally isomorphic NP-optimization problems
  Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
  Lecture Notes in Computer Science 53, 1977, pp. 222-230
• Pushdown-automata and families of languages generating cylinders
  Jean-Michel Autebert
  Lecture Notes in Computer Science 53, 1977, pp. 231-239
• Semantics of infinite processes using generalized trees
  J.W. de Bakker
  Lecture Notes in Computer Science 53, 1977, pp. 240-246
• Characterization of recognizable families by means of regular languages
  Václav Benda, Kamila Bendová
  Lecture Notes in Computer Science 53, 1977, pp. 247-252
• An algebraic approach to problem solution and problem semantics
  A. Bertoni, G. Mauri, M. Torelli
  Lecture Notes in Computer Science 53, 1977, pp. 253-262
• Complexity and minimality of context-free grammars and languages
  A. C̑erný
  Lecture Notes in Computer Science 53, 1977, pp. 263-271
• Comparison of the active visiting and the crossing complexities
  Michal P. Chytil
  Lecture Notes in Computer Science 53, 1977, pp. 272-281
• Arithmetical complexity of some problems in computer science
  P. Hájek
  Lecture Notes in Computer Science 53, 1977, pp. 282-287
• Formal transformations and the development of programs
  Friedrich W. von Henke
  Lecture Notes in Computer Science 53, 1977, pp. 288-296