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

• Communication complexity of PRAMs (preliminary version)
  A. Aggarwal, A.K. Chandra
  Lecture Notes in Computer Science 317, 1988, pp. 1-17
• Average case complexity analysis of the RETE multi-pattern match algorithm
  L. Albert, F. Fages
  Lecture Notes in Computer Science 317, 1988, pp. 18-37
• Problems easy for tree-decomposable graphs (extended abstract)
  S. Arnborg, J. Lagergren, D. Seese
  Lecture Notes in Computer Science 317, 1988, pp. 38-51
• Serializability in distributed systems with handshaking
  R.J.R. Back, R. Kurki-Suonio
  Lecture Notes in Computer Science 317, 1988, pp. 52-66
• Algorithms for planar geometric models
  C. Bajaj, M.-S. Kim
  Lecture Notes in Computer Science 317, 1988, pp. 67-81
• Nonuniform learnability
  G.M. Benedek, A. Itai
  Lecture Notes in Computer Science 317, 1988, pp. 82-92
• Zeta functions of recognizable languages
  J. Berstel, C. Reutenauer
  Lecture Notes in Computer Science 317, 1988, pp. 93-104
• Dynamic programming on graphs with bounded treewidth
  H.L. Bodlaender
  Lecture Notes in Computer Science 317, 1988, pp. 105-118
• Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's
  J.H. Chang, O.H. Ibarra, M.A. Palis
  Lecture Notes in Computer Science 317, 1988, pp. 119-132
• Optimal slope selection
  R. Cole, J. Salowe, W.L. Steiger, E. Szemerédi
  Lecture Notes in Computer Science 317, 1988, pp. 133-146
• Approximation of a trace, asynchronous automata and the ordering of events in a distributed system
  R. Cori, Y. Métivier
  Lecture Notes in Computer Science 317, 1988, pp. 147-161
• New techniques for proving the decidability of equivalence problems
  K. Culik II
  Lecture Notes in Computer Science 317, 1988, pp. 162-175
• Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids
  V. Diekert
  Lecture Notes in Computer Science 317, 1988, pp. 176-187
• The complexity of matrix transposition on one-tape off-line Turing machines with output tape
  M. Dietzfelbinger, W. Maass
  Lecture Notes in Computer Science 317, 1988, pp. 188-200
• Geometric structures in computational geometry
  H. Edelsbrunner
  Lecture Notes in Computer Science 317, 1988, pp. 201-213
• Arrangements of curves in the plane - topology, combinatorics, and algorithms
  H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir
  Lecture Notes in Computer Science 317, 1988, pp. 214-229
• Reset sequences for finite automata with application to design of parts orienters
  D. Eppstein
  Lecture Notes in Computer Science 317, 1988, pp. 230-238
• Random allocations and probabilistic languages
  P. Flajolet, D. Gardy, L. Thimonier
  Lecture Notes in Computer Science 317, 1988, pp. 239-253
• Systolic architectures, systems and computations
  J. Gruska
  Lecture Notes in Computer Science 317, 1988, pp. 254-270
• New developments in structural complexity theory
  J. Hartmanis
  Lecture Notes in Computer Science 317, 1988, pp. 271-286
• Operational semantics of OBJ-3
  C. Kirchner, H. Kirchner, J. Meseguer
  Lecture Notes in Computer Science 317, 1988, pp. 287-301
• Do we really need to balance Patricia tries
  P. Kirschenhofer, H. Prodinger, W. Szpankowski
  Lecture Notes in Computer Science 317, 1988, pp. 302-316
• Contractions in comparing concurrency semantics
  J.N. Kok, J.J.M.M. Rutten
  Lecture Notes in Computer Science 317, 1988, pp. 317-332
• A complexity theory of efficient parallel algorithms
  C.P. Kruskal, L. Rudolph, M. Snir
  Lecture Notes in Computer Science 317, 1988, pp. 333-346
• On the learnability of DNF formulae
  L. Kuc̑era, A. Marchetti-Spaccamela, M. Protasi
  Lecture Notes in Computer Science 317, 1988, pp. 347-361