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

• 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
• Correctness of concurrent processes
  E.-R. Olderog
  Lecture Notes in Computer Science 379, 1989, pp. 107-132
• Understanding nets (abstract)
  B. Trakhtenbrot
  Lecture Notes in Computer Science 379, 1989, pp. 133-134
• 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
• Control flow versus logic: A denotational and declarative model for guarded Horn clauses
  F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten
  Lecture Notes in Computer Science 379, 1989, pp. 165-176
• 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
• Logical characterizations of nonmonotonic TMSs
  Ch. Elkan
  Lecture Notes in Computer Science 379, 1989, pp. 218-224
• Proving correctness of constructor implementations
  J. Farrés-Casals
  Lecture Notes in Computer Science 379, 1989, pp. 225-236
• Equivalence notions for concurrent systems and refinement of actions (extended abstract)
  R. van Glabbeek, U. Goltz
  Lecture Notes in Computer Science 379, 1989, pp. 237-248
• System simulation and the sensitivity of self-stabilization (extended abstract)
  M.G. Gouda, R.R. Howell, L.E. Rosier
  Lecture Notes in Computer Science 379, 1989, pp. 249-258
• Polynomial-time functions generate SAT: on P-splinters
  L.A. Hemachandra, A. Hoene, D. Siefkes
  Lecture Notes in Computer Science 379, 1989, pp. 259-269
• Generalized definite tree languages
  U. Heuter
  Lecture Notes in Computer Science 379, 1989, pp. 270-280
• Pinwheel scheduling with two distinct numbers
  R. Holte, L. Rosier, I. Tulchinsky, D. Varvel
  Lecture Notes in Computer Science 379, 1989, pp. 281-290
• Testing approximate symmetry in the plane is NP-hard
  S. Iwanowski
  Lecture Notes in Computer Science 379, 1989, pp. 291-304
• Memory and algebra
  C. Jousselin, J.-P. Moskowitz
  Lecture Notes in Computer Science 379, 1989, pp. 305-313
• Integer relations among algebraic numbers
  B. Just
  Lecture Notes in Computer Science 379, 1989, pp. 314-320
• An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract)
  J.N. Kok
  Lecture Notes in Computer Science 379, 1989, pp. 321-330