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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=1988

• Sparse sets, tally sets, and polynomial reducibilities
  R.W. Book
  Lecture Notes in Computer Science 324, 1988, pp. 1-13
• Functional programming and combinatory algebras
  C. Böhm
  Lecture Notes in Computer Science 324, 1988, pp. 14-26
• On models and algebras for concurrent processes
  L.A. Cherkasova
  Lecture Notes in Computer Science 324, 1988, pp. 27-43
• String matching with constraints
  M. Crochemore
  Lecture Notes in Computer Science 324, 1988, pp. 44-58
• Structure of complexity classes: separations, collapses, and completeness
  L.A. Hemachandra
  Lecture Notes in Computer Science 324, 1988, pp. 59-72
• Inductive syntactical synthesis of programs from sample computations
  E.B. Kinber
  Lecture Notes in Computer Science 324, 1988, pp. 73-84
• 3-dimensional shortest paths in the presence of polyhedral obstacles
  J.H. Reif, J.A. Storer
  Lecture Notes in Computer Science 324, 1988, pp. 85-92
• Robust oracle machines
  U. Schöning
  Lecture Notes in Computer Science 324, 1988, pp. 93-106
• Recognizable sets with multiplicities in the tropical semiring
  I. Simon
  Lecture Notes in Computer Science 324, 1988, pp. 107-120
• Comparing interconnection networks
  B. Monien, H. Sudborough
  Lecture Notes in Computer Science 324, 1988, pp. 138-153
• Probabilistic automata complexity of languages depends on language structure and error probability
  F.M. Ablayev
  Lecture Notes in Computer Science 324, 1988, pp. 154-161
• Breadth-first phrase structure grammars and queue automata
  E. Allevi, A. Cherubini, S. Crespi Reghizzi
  Lecture Notes in Computer Science 324, 1988, pp. 162-170
• Implementing abstract data structures in hardware
  F. Bauernöppel, H. Jung
  Lecture Notes in Computer Science 324, 1988, pp. 171-179
• Distribution of sequential processes
  J. Beauquier, A. Petit
  Lecture Notes in Computer Science 324, 1988, pp. 180-189
• Automata and rational expressions on planar graphs
  F. Bossut, M. Dauchet, B. Warin
  Lecture Notes in Computer Science 324, 1988, pp. 190-200
• On maximal prefix sets of words
  V. Bruyere
  Lecture Notes in Computer Science 324, 1988, pp. 201-209
• Infinite behaviour of deterministic Petri nets
  H. Carstensen
  Lecture Notes in Computer Science 324, 1988, pp. 210-219
• Testing isomorphism of outerplanar graphs in parallel
  B.S. Chlebus, K. Diks, T. Radzik
  Lecture Notes in Computer Science 324, 1988, pp. 220-230
• Efficient simulations between concurrent-read concurrent-write PRAM models
  B.S. Chlebus, K. Diks, T. Hagerup, T. Radzik
  Lecture Notes in Computer Science 324, 1988, pp. 231-239
• Multiple propositional dynamic logic of parallel programs (extended abstract)
  R. Danecki
  Lecture Notes in Computer Science 324, 1988, pp. 240-248
• Termination of rewriting is undecidable in the one-rule case
  M. Dauchet
  Lecture Notes in Computer Science 324, 1988, pp. 262-270
• Local checking of trace synchronizability (extended abstract)
  V. Diekert, W. Vogler
  Lecture Notes in Computer Science 324, 1988, pp. 271-279
• Edge separators for planar graphs and their applications
  K. Diks, H.N. Djidjev, O. Sýkora, I. Vrt̑o
  Lecture Notes in Computer Science 324, 1988, pp. 280-290
• A fast parallel algorithm for eigenvalue problem of Jacobi matrices
  M.A. Frumkin
  Lecture Notes in Computer Science 324, 1988, pp. 291-299
• Strong and robustly strong polynomial time reducibilities to sparse sets
  R. Gavaldà, J.L. Balcázar
  Lecture Notes in Computer Science 324, 1988, pp. 300-308