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

• Probability one separation of the Boolean hierarchy
  J. Cai
  Lecture Notes in Computer Science 247, 1987, pp. 148-158
• Reversal complexity of multicounter and multihead machines
  J. Hromkovic̑
  Lecture Notes in Computer Science 247, 1987, pp. 159-168
• Computing the counting function of context-free languages
  A. Bertoni, M. Goldwurm, N. Sabadini
  Lecture Notes in Computer Science 247, 1987, pp. 169-179
• On the k-freeness of morphisms on free monoids
  V. Keränen
  Lecture Notes in Computer Science 247, 1987, pp. 180-188
• Avoidable patterns on 2 letters
  U. Schmidt
  Lecture Notes in Computer Science 247, 1987, pp. 189-197
• Polynomial operations on rational languages
  M. Arfi
  Lecture Notes in Computer Science 247, 1987, pp. 198-206
• Some structural aspects of hypergraph languages generated by hyperedge replacement
  A. Habel, H.J. Kreowski
  Lecture Notes in Computer Science 247, 1987, pp. 207-219
• Specification and implementation of concurrently accessed data structures: An abstract data type approach
  S. Kaplan, A. Pnueli
  Lecture Notes in Computer Science 247, 1987, pp. 220-244
• On implementations of loose abstract data type specifications and their vertical composition
  C. Beierle, A. Voß
  Lecture Notes in Computer Science 247, 1987, pp. 245-259
• Some remarks on presentations by finite Church-Rosser Thue systems
  V. Diekert
  Lecture Notes in Computer Science 247, 1987, pp. 272-285
• Ground term confluence in parametric conditional equational specifications
  H. Ganzinger
  Lecture Notes in Computer Science 247, 1987, pp. 286-298
• Comparing direct and continuation semantics styles for concurrent languages
  E. Astesiano, G. Reggio
  Lecture Notes in Computer Science 247, 1987, pp. 311-322
• Expressibility of first order logic with a nondeterministic inductive operator
  V. Arvind, S. Biswas
  Lecture Notes in Computer Science 247, 1987, pp. 323-335
• The step failure semantics
  D. Taubner, W. Vogler
  Lecture Notes in Computer Science 247, 1987, pp. 348-359
• On the complexity of containment, equivalence and reachibility for finite and 2-dimensional vector addition systems with states
  R.R. Howell, D.T. Huynh, L.E. Rosier, H.C. Yen
  Lecture Notes in Computer Science 247, 1987, pp. 360-370
• Closure properties of deterministic Petri nets
  E. Pelz
  Lecture Notes in Computer Science 247, 1987, pp. 371-382
• Some results on fairnes: the regular case
  L. Priese, R. Rehrmann, U. Willecke-Klemme
  Lecture Notes in Computer Science 247, 1987, pp. 383-395
• Decidability questions for fairness in Petri nets
  H. Carstensen
  Lecture Notes in Computer Science 247, 1987, pp. 396-407
• Optimal sorting on multi-dimensionally mesh-connected computers
  M. Kunde
  Lecture Notes in Computer Science 247, 1987, pp. 408-419
• On the contact-minimization problem
  P. Molitor
  Lecture Notes in Computer Science 247, 1987, pp. 420-431
• Making distributed spanning tree algorithms fault-resilient
  R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, S. Zaks
  Lecture Notes in Computer Science 247, 1987, pp. 432-444
• The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols
  G. Tel, R.B. Tan, J. van Leeuwen
  Lecture Notes in Computer Science 247, 1987, pp. 445-455
• On the expected complexity of distributed selection
  N. Santoro, J.B. Sidney, S.J. Sidney
  Lecture Notes in Computer Science 247, 1987, pp. 456-467
• LPG: A generic, logic and functional programming language
  D. Bert, P. Drabik, R. Echahed
  Lecture Notes in Computer Science 247, 1987, pp. 468-469
• REVEUR4: A laboratory for conditional rewriting
  W. Bousdira, J.-L. Remy
  Lecture Notes in Computer Science 247, 1987, pp. 472-473