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

• Context-free NCE graph grammars
  J. Engelfriet
  Lecture Notes in Computer Science 380, 1989, pp. 148-161
• Dynamic data structures with finite population: a combinatorial analysis
  J. Françon, B. Randrianarimanana, R. Schott
  Lecture Notes in Computer Science 380, 1989, pp. 162-174
• Iterated deterministic top-down look-ahead
  Z. Fülöp, S. Vágvölgyi
  Lecture Notes in Computer Science 380, 1989, pp. 175-184
• Using generating functions to compute concurrency
  D. Geniet, L. Thimonier
  Lecture Notes in Computer Science 380, 1989, pp. 185-196
• A logic for nondeterministic functional programs
  A. Gil-Luezas
  Lecture Notes in Computer Science 380, 1989, pp. 197-208
• Decision problems and Coxeter groups
  B. Graw
  Lecture Notes in Computer Science 380, 1989, pp. 209-223
• Complexity of formula classes in first order logic with functions
  E. Grädel
  Lecture Notes in Computer Science 380, 1989, pp. 224-233
• Normal and sinkless Petri nets
  R.R. Howell, L.E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 380, 1989, pp. 234-243
• Descriptive and computational complexity
  N. Immerman
  Lecture Notes in Computer Science 380, 1989, pp. 244-245
• The effect of null-chains on the complexity of contact schemes
  S.P. Jukna
  Lecture Notes in Computer Science 380, 1989, pp. 246-256
• Monte-Carlo inference and its relations to reliable frequency identification
  E. Kinber, T. Zeugmann
  Lecture Notes in Computer Science 380, 1989, pp. 257-266
• Semilinear real-time systolic trellis automata
  I. Korec
  Lecture Notes in Computer Science 380, 1989, pp. 267-276
• Inducibility of the composition of frontier-to-root tree transformations
  T. Kovács
  Lecture Notes in Computer Science 380, 1989, pp. 277-286
• On oblivious branching programs of linear length
  M. Krause, S. Waack
  Lecture Notes in Computer Science 380, 1989, pp. 287-296
• Monadic second-order logic and context-free graph-grammars
  B. Courcelle
  Lecture Notes in Computer Science 379, 1989, pp. 18-34
• A thesis for bounded concurrency
  D. Harel
  Lecture Notes in Computer Science 379, 1989, pp. 35-48
• Space bounded computations: Review and new separation results
  J. Hartmanis, D. Ranjan
  Lecture Notes in Computer Science 379, 1989, pp. 49-66
• Concurrent nondeterministic processes: Adequacy of structure and behaviour
  V.E. Kotov, L.A. Cherkasova
  Lecture Notes in Computer Science 379, 1989, pp. 67-87
• On the strength of temporal proofs
  H. Andréka, I. Németi, I. Sain
  Lecture Notes in Computer Science 379, 1989, pp. 135-144
• Proof-theoretic characterisations of logic programming
  J.H. Andrews
  Lecture Notes in Computer Science 379, 1989, pp. 145-154
• Algebraically closed theories
  E. Badouel
  Lecture Notes in Computer Science 379, 1989, pp. 155-164
• Ehrenfeucht test set theorem and Hilbert basis theorem: A constructive glimpse
  C. Calude, D. Vaida
  Lecture Notes in Computer Science 379, 1989, pp. 177-184
• Parallel complexity of lexicographically first problems for tree-structured graphs (extended abstract)
  B. Chlebus, K. Diks, W. Rytter, T. Szymacha
  Lecture Notes in Computer Science 379, 1989, pp. 185-195
• On the power of synchronization in parallel computations
  J. Dassow, J. Hromkovic̑, J. Karhumäki, B. Rovan, A. Slobodová
  Lecture Notes in Computer Science 379, 1989, pp. 196-206
• Optimal parallel algorithms for the recognition and colouring outerplanar graphs
  K. Diks, T. Hagerup, W. Rytter
  Lecture Notes in Computer Science 379, 1989, pp. 207-217