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

• Sharing in nondeterminism
  E. Astesiano, G. Costa
  Lecture Notes in Computer Science 71, 1979, pp. 1-15
• Sur les mots sans carré définis par un morphisme
  J. Berstel
  Lecture Notes in Computer Science 71, 1979, pp. 16-25
• A characterization of abstract data as model-theoretic invariants
  A. Bertoni, G. Mauri, P.A. Miglioli
  Lecture Notes in Computer Science 71, 1979, pp. 26-37
• Inherent ambiguities in families of grammars
  M. Blattner
  Lecture Notes in Computer Science 71, 1979, pp. 38-48
• Representing complexity classes by equality sets
  R.V. Book, F.-J. Brandenburg
  Lecture Notes in Computer Science 71, 1979, pp. 49-57
• Supercounter machines
  B. von Braunmühl, E. Hotzel
  Lecture Notes in Computer Science 71, 1979, pp. 58-72
• Existential quantifiers in abstract data types
  M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing
  Lecture Notes in Computer Science 71, 1979, pp. 73-87
• A generalization of Ginsburg and Rose's characterization of G-S-M mappings
  C. Choffrut
  Lecture Notes in Computer Science 71, 1979, pp. 88-103
• Strict deterministic languages and controlled rewriting systems
  L. Chottin
  Lecture Notes in Computer Science 71, 1979, pp. 104-117
• A string matching algorithm fast on the average
  B. Commentz-Walter
  Lecture Notes in Computer Science 71, 1979, pp. 118-132
• Functional characterization of some semantic equalities inside \lambda-calculus
  M. Coppo, M. Dezani-Ciancaglini, P. Sallé
  Lecture Notes in Computer Science 71, 1979, pp. 133-146
• Arbitration and queueing under limited shared storage requirements
  A.B. Cremers, T.N. Hibbard
  Lecture Notes in Computer Science 71, 1979, pp. 147-160
• On the homomorphic characterizations of families of languages
  K. Culik II
  Lecture Notes in Computer Science 71, 1979, pp. 161-170
• Two level grammars: CF-grammars with equation schemes
  P. Dembinski, J. Maluszynski
  Lecture Notes in Computer Science 71, 1979, pp. 171-187
• Proving termination with multiset orderings
  N. Dershowitz, Z. Manna
  Lecture Notes in Computer Science 71, 1979, pp. 188-202
• One abstract accepting algorithm for all kinds of parsers
  P. Deussen
  Lecture Notes in Computer Science 71, 1979, pp. 203-217
• Studies in abstract/concrete mappings in proving algorithm correctness
  A.G. Duncan, L. Yelowitz
  Lecture Notes in Computer Science 71, 1979, pp. 218-229
• A characterization of a dot-depth two analogue of generalized definite languages
  F.E. Fich, J.A. Brzozowski
  Lecture Notes in Computer Science 71, 1979, pp. 230-244
• Partitioned LL(k) grammars
  D. Friede
  Lecture Notes in Computer Science 71, 1979, pp. 245-255
• Recursion schemes and generalized interpretations
  J.H. Gallier
  Lecture Notes in Computer Science 71, 1979, pp. 256-270
• A rational theory of AFLs
  J. Goldstine
  Lecture Notes in Computer Science 71, 1979, pp. 271-281
• On the succinctness of different representations of languages
  J. Hartmanis
  Lecture Notes in Computer Science 71, 1979, pp. 282-288
• A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs
  S. Istrail
  Lecture Notes in Computer Science 71, 1979, pp. 289-303
• Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisions
  W. Janko
  Lecture Notes in Computer Science 71, 1979, pp. 304-315
• A unique termination theorem for a theory with generalised commutative axioms
  H.J. Jeanrond
  Lecture Notes in Computer Science 71, 1979, pp. 316-330