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 YEAR=1979

• Relative succinctness of representations of languages and separation of complexity classes
  Juris Hartmanis, T.P. Baker
  Lecture Notes in Computer Science 74, 1979, pp. 70-88
• On two types of loops
  Ivan M. Havel
  Lecture Notes in Computer Science 74, 1979, pp. 89-107
• Full abstraction for a simple parallel programming language
  M.C.B. Hennessy, G.D. Plotkin
  Lecture Notes in Computer Science 74, 1979, pp. 108-120
• On some developments in cryptography and their applications to computer science
  Hermann A. Maurer
  Lecture Notes in Computer Science 74, 1979, pp. 121-130
• Searching, sorting and information theory
  Kurt Mehlhorn
  Lecture Notes in Computer Science 74, 1979, pp. 131-145
• LCF: A way of doing proofs with a machine
  Robin Milner
  Lecture Notes in Computer Science 74, 1979, pp. 146-159
• Axioms or algorithms
  Vaughan R. Pratt
  Lecture Notes in Computer Science 74, 1979, pp. 160-169
• Power from power series
  Arto Salomaa
  Lecture Notes in Computer Science 74, 1979, pp. 170-181
• Computational complexity of string and graph identification
  A.O. Slisenko
  Lecture Notes in Computer Science 74, 1979, pp. 182-190
• A survey of grammar and L forms-1978
  Derick Wood
  Lecture Notes in Computer Science 74, 1979, pp. 191-200
• A theoretical study on the time analysis of programs
  Akeo Adachi, Takumi Kasai, Etsuro Moriya
  Lecture Notes in Computer Science 74, 1979, pp. 201-207
• Completeness problems in verification of programs and program schemes
  H. Andréka, I. Németi, I. Sain
  Lecture Notes in Computer Science 74, 1979, pp. 208-218
• Relationships between AFDL's and cylinders
  Jean-Michel Autebert
  Lecture Notes in Computer Science 74, 1979, pp. 219-227
• Computable data types
  G. Comyn, G. Werner
  Lecture Notes in Computer Science 74, 1979, pp. 228-236
• Program equivalence and provability
  G. Cousineau, P. Enjalbert
  Lecture Notes in Computer Science 74, 1979, pp. 237-245
• Interactive L systems with almost interactionless behaviour
  K. Culik II, J. Karhumäki
  Lecture Notes in Computer Science 74, 1979, pp. 246-257
• On the simplification of constructions in degrees of unsolvability via computational complexity
  Robert P. Daley
  Lecture Notes in Computer Science 74, 1979, pp. 258-265
• An algebraic extension of the Chomsky-hierarchy
  W. Damm
  Lecture Notes in Computer Science 74, 1979, pp. 266-276
• Bounds on computational complexity and approximability of initial segments of recursive sets
  M.I. Dekhtjar
  Lecture Notes in Computer Science 74, 1979, pp. 277-283
• On the weighted path length of binary search trees for unknown access probabilities
  Thomas Fischer
  Lecture Notes in Computer Science 74, 1979, pp. 284-291
• Computational complexity of approximation algorithms for combinatorial problems
  G.V. Gens, E.V. Levner
  Lecture Notes in Computer Science 74, 1979, pp. 292-300
• A reduct-and-closure algorithm for graphs
  Alla Goralc̑íková, Václav Koubek
  Lecture Notes in Computer Science 74, 1979, pp. 301-307
• Small universal Minsky machines
  L̑udmila Gregus̑ová, Ivan Korec
  Lecture Notes in Computer Science 74, 1979, pp. 308-316
• Parallel and two-way recognizers of directed acyclic graphs
  Tsutomu Kamimura, Giora Slutzki
  Lecture Notes in Computer Science 74, 1979, pp. 317-325
• Fully effective solutions of recursive domain equations
  Akira Kanda
  Lecture Notes in Computer Science 74, 1979, pp. 326-336