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

• 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
• Efficient algorithms on context-free graph languages
  C. Lautemann
  Lecture Notes in Computer Science 317, 1988, pp. 362-378
• Efficient analysis of graph properties on context-free graph languages (extended abstract)
  T. Lengauer, E. Wanke
  Lecture Notes in Computer Science 317, 1988, pp. 379-393
• A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs
  A. Lingas, M.M. Syslo
  Lecture Notes in Computer Science 317, 1988, pp. 394-409
• Constructive Hopf's theorem: or how to untangle closed planar curves
  K. Mehlhorn, C.-K. Yap
  Lecture Notes in Computer Science 317, 1988, pp. 410-423
• Maximal dense intervals of grammar forms
  V. Niemi
  Lecture Notes in Computer Science 317, 1988, pp. 424-438
• Computations, residuals, and the power of indeterminacy
  P. Panangaden, E.W. Stark
  Lecture Notes in Computer Science 317, 1988, pp. 439-454
• Nested annealing: A provable improvement to simulated annealing
  S. Rajasekaran, J.H. Reif
  Lecture Notes in Computer Science 317, 1988, pp. 455-472
• Nonlinear pattern matching in trees
  R. Ramesh, I.V. Ramakrishnan
  Lecture Notes in Computer Science 317, 1988, pp. 473-488
• Invertibility of linear finite automata over a ring
  Tao Renji
  Lecture Notes in Computer Science 317, 1988, pp. 489-501
• Moving discs between polygons
  H. Rohnert
  Lecture Notes in Computer Science 317, 1988, pp. 502-515
• Optimal circuits and transitive automorphism groups
  S. Rudich, L. Berman
  Lecture Notes in Computer Science 317, 1988, pp. 516-524