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

• Separating, strongly separating, and collapsing relativized complexity classes
  José Luis Balcázar
  Lecture Notes in Computer Science 176, 1984, pp. 1-16
• Complexity of quantifier elimination in the theory of algebraically closed fields
  A.L. Chistov, D.Yu. Grigor'ev
  Lecture Notes in Computer Science 176, 1984, pp. 17-31
• Systolic automata - Power, characterizations, nonhomogeneity
  Jozef Gruska
  Lecture Notes in Computer Science 176, 1984, pp. 32-49
• A note on unique decipherability
  Christoph M. Hoffmann
  Lecture Notes in Computer Science 176, 1984, pp. 50-63
• Outline of an algebraic language theory
  Günter Hotz
  Lecture Notes in Computer Science 176, 1984, pp. 64-79
• Thue systems and the Church-Rosser property
  Matthias Jantzen
  Lecture Notes in Computer Science 176, 1984, pp. 80-95
• Limits, higher type computability and type-free languages
  G. Longo
  Lecture Notes in Computer Science 176, 1984, pp. 96-114
• Traces, histories, graphs: Instances of a process monoid
  Antoni Mazurkiewicz
  Lecture Notes in Computer Science 176, 1984, pp. 115-133
• Recent results on automata and infinite words
  Dominique Perrin
  Lecture Notes in Computer Science 176, 1984, pp. 134-148
• VLSI algorithms and architectures
  Franco P. Preparata
  Lecture Notes in Computer Science 176, 1984, pp. 149-161
• Decidability of monadic theories
  A.L. Semenov
  Lecture Notes in Computer Science 176, 1984, pp. 162-175
• On the Ehrenfeucht conjecture on test sets and its dual version
  J. Albert
  Lecture Notes in Computer Science 176, 1984, pp. 176-184
• Sparse oracles, lowness, and highness
  José L. Balcázar, Ronald V. Book, Uwe Schöning
  Lecture Notes in Computer Science 176, 1984, pp. 185-193
• Computability of probabilistic parameters for some classes of formal languages
  Joffroy Beauquier, Loÿs Thimonier
  Lecture Notes in Computer Science 176, 1984, pp. 194-204
• A truely morphic characterization of recursively enumerable sets
  Franz Josef Brandenburg
  Lecture Notes in Computer Science 176, 1984, pp. 205-213
• On the Herbrand Kleene universe for nondeterministic computations
  Manfred Broy
  Lecture Notes in Computer Science 176, 1984, pp. 214-222
• An investigation of controls for concurrent systems by abstract control languages
  H.D. Burkhard
  Lecture Notes in Computer Science 176, 1984, pp. 223-231
• On generalized words of Thue-Morse
  A. C̑erný
  Lecture Notes in Computer Science 176, 1984, pp. 232-239
• Nondeterminism is essential for two-way counter machines
  Marek Chrobak
  Lecture Notes in Computer Science 176, 1984, pp. 240-244
• Weak and strong fairness in CCS
  Gerardo Costa, Colin Stirling
  Lecture Notes in Computer Science 176, 1984, pp. 245-254
• On the complexity of inductive inference
  Robert P. Daley, Carl H. Smith
  Lecture Notes in Computer Science 176, 1984, pp. 255-264
• Monotone edge sequences in line arrangements and applications
  Herbert Edelsbrunner, Emmerich Welzl
  Lecture Notes in Computer Science 176, 1984, pp. 265-272
• Many-sorted temporal logic for multi-processes systems
  P. Enjalbert, M. Michel
  Lecture Notes in Computer Science 176, 1984, pp. 273-281
• Process logics: Two decidability results
  Z. Habasiński
  Lecture Notes in Computer Science 176, 1984, pp. 282-290
• On searching of special classes of mazes and finite embedded graphs
  A. Hemmerling, K. Kriegel
  Lecture Notes in Computer Science 176, 1984, pp. 291-300