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

• Polynomial factorization 1987--1991
  Erich Kaltofen
  Lecture Notes in Computer Science 583, 1992, pp. 294-313
• Properties of recognizable {\cal M}-subsets of a free monoid
  Nami Kobayashi
  Lecture Notes in Computer Science 583, 1992, pp. 314-328
• On the Burnside semigroups x^n = x^{n+m}
  Alair Pereira do Lago
  Lecture Notes in Computer Science 583, 1992, pp. 329-343
• Massively parallel computing and factoring
  Arjen K. Lenstra
  Lecture Notes in Computer Science 583, 1992, pp. 344-355
• Some regularity conditions based on well quasi-orders
  Aldo de Luca, Stefano Varricchio
  Lecture Notes in Computer Science 583, 1992, pp. 356-371
• Approximate matching of network expressions with spacers
  Gene Myers
  Lecture Notes in Computer Science 583, 1992, pp. 372-386
• Unambiguous simulations of auxiliary pushdown automata and circuits
  Rolf Niedermeier, Peter Rossmanith
  Lecture Notes in Computer Science 583, 1992, pp. 387-400
• On reversible automata
  Jean-Eric Pin
  Lecture Notes in Computer Science 583, 1992, pp. 401-416
• Even induced cycles in planar graphs
  Oscar Porto
  Lecture Notes in Computer Science 583, 1992, pp. 417-429
• Arithmetic + logic + geometry = concurrency
  Vaughan Pratt
  Lecture Notes in Computer Science 583, 1992, pp. 430-447
• On the density and core of the complexity classes
  José D.P. Rolim
  Lecture Notes in Computer Science 583, 1992, pp. 448-459
• The ``last'' decision problem for rational trace languages
  Jacques Sakarovitch
  Lecture Notes in Computer Science 583, 1992, pp. 460-473
• Improved bounds for mixing rates of Markov chains and multicommodity flow
  Alistair Sinclair
  Lecture Notes in Computer Science 583, 1992, pp. 474-487
• Data structures and terminating Petri nets
  Daniel D. Sleator
  Lecture Notes in Computer Science 583, 1992, pp. 488-497
• Circuits constructed with MOD_q gates cannot compute AND in sublinear size
  Denis Thérien
  Lecture Notes in Computer Science 583, 1992, pp. 498-502
• Decomposing a k-valued transducer into k unambiguous ones
  Andreas Weber
  Lecture Notes in Computer Science 583, 1992, pp. 503-515
• An efficient algorithm for edge-coloring series-parallel multigraphs
  X. Zhou, S. Nakano, H. Suzuki, T. Nishizeki
  Lecture Notes in Computer Science 583, 1992, pp. 516-529
• Complexity issues in neural network computations
  Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
  Lecture Notes in Computer Science 583, 1992, pp. 530-544