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

• Context-free sets of infinite words
  L. Boasson
  Lecture Notes in Computer Science 67, 1979, pp. 1-9
• New aspects of homomorphisms
  H. Maurer
  Lecture Notes in Computer Science 67, 1979, pp. 10-24
• An algebraic theory for synchronization
  R. Milner
  Lecture Notes in Computer Science 67, 1979, pp. 27-35
• Storage modification machines
  A. Schönhage
  Lecture Notes in Computer Science 67, 1979, pp. 36-37
• Negative results on counting
  L.G. Valiant
  Lecture Notes in Computer Science 67, 1979, pp. 38-46
• Strong non-deterministic context-free languages
  J. Beauquier
  Lecture Notes in Computer Science 67, 1979, pp. 47-57
• Information content characterizations of complexity theoretic properties
  V.L. Bennison
  Lecture Notes in Computer Science 67, 1979, pp. 58-66
• Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
  N. Blum, K. Mehlhorn
  Lecture Notes in Computer Science 67, 1979, pp. 67-78
• A new recursion induction principle
  G. Boudol
  Lecture Notes in Computer Science 67, 1979, pp. 79-90
• Finite-change automata
  B. von Braunmühl, R. Verbeek
  Lecture Notes in Computer Science 67, 1979, pp. 91-100
• Move rules and trade-offs in the pebble game
  P. van Emde Boas, J. van Leeuwen
  Lecture Notes in Computer Science 67, 1979, pp. 101-112
• Transition diagrams and strict deterministic grammars
  D. Friede
  Lecture Notes in Computer Science 67, 1979, pp. 113-123
• Exact expressions for some randomness tests
  P. Gács
  Lecture Notes in Computer Science 67, 1979, pp. 124-131
• On storage optimization for automatically generated compilers
  H. Ganzinger
  Lecture Notes in Computer Science 67, 1979, pp. 132-141
• On continuous completions
  I. Guessarian
  Lecture Notes in Computer Science 67, 1979, pp. 142-152
• A new method to show lower bounds for polynomials which are hard to compute
  J. Heintz
  Lecture Notes in Computer Science 67, 1979, pp. 153-157
• On zerotesting-bounded multicounter machines
  M. Jantzen
  Lecture Notes in Computer Science 67, 1979, pp. 158-169
• Sur deux langages linéaires
  M. Latteux
  Lecture Notes in Computer Science 67, 1979, pp. 182-189
• An efficient on-line position tree construction algorithm
  M. Majster, A. Reiser
  Lecture Notes in Computer Science 67, 1979, pp. 190-198
• Sorting presorted files
  K. Mehlhorn
  Lecture Notes in Computer Science 67, 1979, pp. 199-212
• Node-visit optimal 1-2 brother trees
  T. Ottmann, A.L. Rosenberg, H.W. Six, D. Wood
  Lecture Notes in Computer Science 67, 1979, pp. 213-221
• A graph theoretic approach to determinism versus non-determinism
  W.J. Paul, R. Reischuk
  Lecture Notes in Computer Science 67, 1979, pp. 222-232
• Une caractérisation de trois variétés de langages bien connues
  J.E. Pin
  Lecture Notes in Computer Science 67, 1979, pp. 233-243
• über eine minimale universelle Turing-Maschine
  L. Priese
  Lecture Notes in Computer Science 67, 1979, pp. 244-259
• Sur les variétés de langages et de monoides
  C. Reutenauer
  Lecture Notes in Computer Science 67, 1979, pp. 260-265