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: Booktitle=Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2001 (Dresden, Germany, February 15-17, 2001)

• Recurrence in infinite words
  Julien Cassaigne
  Lecture Notes in Computer Science 2010, 2001, pp. 1-11
• Generalized model-checking problems for first-order logic
  Martin Grohe
  Lecture Notes in Computer Science 2010, 2001, pp. 12-26
• Myhill-Nerode relations on automatic systems and the completeness of Kleene algebra
  Dexter Kozen
  Lecture Notes in Computer Science 2010, 2001, pp. 27-38
• 2-nested simulation is not finitely equationally axiomatizable
  Luca Aceto, Wan Fokking, Anna Ingólfsdóttir
  Lecture Notes in Computer Science 2010, 2001, pp. 39-50
• On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
  Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
  Lecture Notes in Computer Science 2010, 2001, pp. 51-62
• Matching polygonal curves with respect to the Fréchet distance
  Helmut Alt, Christian Knauer, Carola Wenk
  Lecture Notes in Computer Science 2010, 2001, pp. 63-74
• On the class of languages recognizable by 1-way quantum finite automata
  Andris Ambainis, Arnolds Ķikusts, Māris Valdats
  Lecture Notes in Computer Science 2010, 2001, pp. 75-86
• Star-free open languages and aperiodic loops
  Martin Beaudry, François Lemieux, Denis Thérien
  Lecture Notes in Computer Science 2010, 2001, pp. 87-98
• A \frac{5}{2}n^2-lower bound for the multiplicative complexity of n\times n-matrix multiplication
  Markus Bläser
  Lecture Notes in Computer Science 2010, 2001, pp. 99-109
• Evasiveness of subgraph containment and related properties
  Amit Chakrabarti, Subhash Khot, Yaoyun Shi
  Lecture Notes in Computer Science 2010, 2001, pp. 110-120
• On the complexity of computing minimum energy consumption broadcast subgraphs
  Andrea E.F. Clementi, Pilu Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
  Lecture Notes in Computer Science 2010, 2001, pp. 121-131
• On Presburger liveness of discrete timed automata
  Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
  Lecture Notes in Computer Science 2010, 2001, pp. 132-143
• Residual finite state automata
  François Denis, Aurélien Lemay, Alain Terlutte
  Lecture Notes in Computer Science 2010, 2001, pp. 144-157
• Deterministic radio broadcasting at low cost
  Anders Dessmark, Andrzej Pelc
  Lecture Notes in Computer Science 2010, 2001, pp. 158-169
• The existential theory of equations with rational constraints in free groups is PSPACE-complete
  Volker Diekert, Claudio Gutiérrez, Christian Hagenah
  Lecture Notes in Computer Science 2010, 2001, pp. 170-182
• Recursive randomized coloring beats fair dice random colorings
  Benjamin Doerr, Anand Srivastav
  Lecture Notes in Computer Science 2010, 2001, pp. 183-194
• Randomness, computability, and density
  Rod G. Downey, Denis R. Hirschfeldt, André Nies
  Lecture Notes in Computer Science 2010, 2001, pp. 195-205
• On multipartition communication complexity
  Pavol D̑uris̑, Juraj Hromkovic̑, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
  Lecture Notes in Computer Science 2010, 2001, pp. 206-217
• Scalable sparse topologies with small spectrum
  Robert Elsässer, Rastislav Královic̑, Burkhard Monien
  Lecture Notes in Computer Science 2010, 2001, pp. 218-229
• Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios
  Leah Epstein
  Lecture Notes in Computer Science 2010, 2001, pp. 230-237
• The UPS problem
  Cristina G. Fernandes, Till Nierhoff
  Lecture Notes in Computer Science 2010, 2001, pp. 238-246
• Gathering of asynchronous oblivious robots with limited visibility
  Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
  Lecture Notes in Computer Science 2010, 2001, pp. 247-258
• Generalized Langton's ant: Dynamical behavior and complexity
  Anahí Gajardo, Eric Goles, Andrés Moreira
  Lecture Notes in Computer Science 2010, 2001, pp. 259-270
• Optimal and approximate station placement in networks (With applications to multicasting and space efficient traversals)
  Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano
  Lecture Notes in Computer Science 2010, 2001, pp. 271-282
• Learning expressions over monoids
  Ricard Gavaldà, Denis Thérien
  Lecture Notes in Computer Science 2010, 2001, pp. 283-293