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

• Simple EOL forms under uniform interpretation generating CF languages
  J. Albert, H. Maurer, G. Rozenberg
  Lecture Notes in Computer Science 62, 1978, pp. 1-14
• Codes: Unequal probabilities unequal letter costs
  D. Altenkamp, K. Mehlhorn
  Lecture Notes in Computer Science 62, 1978, pp. 15-25
• Sur l'inversion des morphismes d'arbres
  A. Arnold, M. Dauchet
  Lecture Notes in Computer Science 62, 1978, pp. 26-35
• Grammars with dynamic control sets
  G. Barth
  Lecture Notes in Computer Science 62, 1978, pp. 36-51
• Ambiguité forte
  J. Beauquier
  Lecture Notes in Computer Science 62, 1978, pp. 52-62
• Relationship between density and deterministic complexity of NP-complete languages
  P. Berman
  Lecture Notes in Computer Science 62, 1978, pp. 63-71
• Stable models of typed \lambda-calculi
  G. Berry
  Lecture Notes in Computer Science 62, 1978, pp. 72-89
• Path measures of Turing machines computations
  J. Biskup
  Lecture Notes in Computer Science 62, 1978, pp. 90-104
• Une famille remarquable de codes indécomposables
  J.M. Boe
  Lecture Notes in Computer Science 62, 1978, pp. 105-112
• Comparisons and reset machines
  R.V. Book, S. Greibach, C. Wrathall
  Lecture Notes in Computer Science 62, 1978, pp. 113-124
• Size-depth tradeoff in Boolean formulas
  B. Commentz-Walter
  Lecture Notes in Computer Science 62, 1978, pp. 125-141
• (Semi)-separability of finite sets of terms in Scott's D_\infty-models of the \lambda-calculus
  M. Coppo, M. Dezani-Ciancaglini, S. Ronchi
  Lecture Notes in Computer Science 62, 1978, pp. 142-164
• Mutual exclusion of N processors using an O(N)-valued message variable
  A.B. Cremers, T.N. Hibbard
  Lecture Notes in Computer Science 62, 1978, pp. 165-176
• On the power of self-application and higher type recursion
  W. Damm, E. Fehr
  Lecture Notes in Computer Science 62, 1978, pp. 177-191
• Time and space bounds for selection problems
  D. Dobkin, I. Munro
  Lecture Notes in Computer Science 62, 1978, pp. 192-204
• Stepwise specification and implementation of abstract data types
  H. Ehrig, H.J. Kreowski, P. Padawitz
  Lecture Notes in Computer Science 62, 1978, pp. 205-226
• The complexity of equivalence and containment for free single variable program schemes
  S. Fortune, J. Hopcroft, E.M. Schmidt
  Lecture Notes in Computer Science 62, 1978, pp. 227-240
• On improving the worst case running time of the Boyer-Moore string matching algorithm
  Z. Galil
  Lecture Notes in Computer Science 62, 1978, pp. 241-250
• Semantics and correctness of nondeterministic flowchart programs with recursive procedures
  J. Gallier
  Lecture Notes in Computer Science 62, 1978, pp. 251-267
• Arithmetical completeness in logics of programs
  G. Harel
  Lecture Notes in Computer Science 62, 1978, pp. 268-288
• Covering a graph by circuits
  A. Itai, M. Rodeh
  Lecture Notes in Computer Science 62, 1978, pp. 289-299
• A P-SPACE complete problem related to a pebble game
  A. Lingas
  Lecture Notes in Computer Science 62, 1978, pp. 300-321
• Some effective results about linear recursive sequences
  M. Mignotte
  Lecture Notes in Computer Science 62, 1978, pp. 322-329
• On the parsing and covering of simple chain grammars
  A. Nijholt
  Lecture Notes in Computer Science 62, 1978, pp. 330-344
• Sur un cas particulier de la conjecture de Cerny
  J.E. Pin
  Lecture Notes in Computer Science 62, 1978, pp. 345-352