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

• CEC
  H. Bertling, H. Ganzinger, H. Baumeister
  Lecture Notes in Computer Science 247, 1987, pp. 470
• ASSPEGIQUE - an integrated specification environment
  M. Bidoit, F. Capy, C. Choppy, M.-A. Choquet, S. Kaplan, F. Schlienger, F. Voisin
  Lecture Notes in Computer Science 247, 1987, pp. 471
• An interactive, incremental and portable computer algebra system for \lambda-calculus and combinatory logic based on video edition and rewriting techniques
  N. Girard
  Lecture Notes in Computer Science 247, 1987, pp. 474
• An algebraic transformation system for OCCAM programs
  M. Goldsmith, A. Cox, G. Barrett
  Lecture Notes in Computer Science 247, 1987, pp. 481
• Towards a theory of relativizations: Positive relativizations
  R.V. Book
  Lecture Notes in Computer Science 247, 1987, pp. 1-21
• Natural semantics
  G. Kahn
  Lecture Notes in Computer Science 247, 1987, pp. 22-39
• On local routing of two-terminal nets
  K. Mehlhorn, M. Kaufmann
  Lecture Notes in Computer Science 247, 1987, pp. 40-52
• Geometric relations among Voronoi diagrams
  F. Aurenhammer, H. Imai
  Lecture Notes in Computer Science 247, 1987, pp. 53-65
• Finding the largest empty rectangle on a grated surface
  J.D. Brock
  Lecture Notes in Computer Science 247, 1987, pp. 66-75
• Efficient graph algorithms using limited communication on a fixed-size array of processors
  K. Doshi, P. Varman
  Lecture Notes in Computer Science 247, 1987, pp. 76-87
• On selecting the largest element in spite of erroneous information
  B. Ravikumar, K. Ganesan, K.B. Lakshmanan
  Lecture Notes in Computer Science 247, 1987, pp. 88-99
• The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems
  T. Lengauer, K.W. Wagner
  Lecture Notes in Computer Science 247, 1987, pp. 100-113
• Graph isomorphism is in the low hierarchy
  U. Schöning
  Lecture Notes in Computer Science 247, 1987, pp. 114-124
• A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees
  J.G. Geske, D.T. Huynh, A.L. Selman
  Lecture Notes in Computer Science 247, 1987, pp. 125-135
• Self-reducibility
  J.L. Balcázar
  Lecture Notes in Computer Science 247, 1987, pp. 136-147
• 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