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

Suche: Series=LNCS AND YEAR=2001

• Time and space bounds for reversible simulation
  Harry Buhrman, John Tromp, Paul Vitányi
  Lecture Notes in Computer Science 2076, 2001, pp. 1017-1027
• Finite-state dimension
  Jack J. Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo
  Lecture Notes in Computer Science 2076, 2001, pp. 1028-1039
• Kronecker algebra and (stochastic) Petri nets: Is it worth the effort?
  Susanna Donatelli
  Lecture Notes in Computer Science 2075, 2001, pp. 1-18
• Timed Petri nets and BQOs
  Parosh Aziz Abdulla, Aletta Nylén
  Lecture Notes in Computer Science 2075, 2001, pp. 53-70
• CPN/Tools: A post-WIMP interface for editing and simulating coloured Petri nets
  Michel Beaudouin-Lafon, Wendy E. Mackay, Peter Andersen, Paul Janecek, Mads Jensen, Michael Lassen, Kasper Lund, Kjeld Mortensen, Stephanie Munck, Anne Ratzer, Katrine Ravn, Sren Christensen, Kurt Jensen
  Lecture Notes in Computer Science 2075, 2001, pp. 71-80
• Petri net based design and implementation methodology for discrete event control systems
  Slavek Bulach, Anton Brauchle, Hans-Jörg Pfleiderer, Zdenek Kucerovsky
  Lecture Notes in Computer Science 2075, 2001, pp. 81-100
• Condensed state spaces for timed Petri nets
  Sren Christensen, Lars Michael Kristensen, Thomas Mailund
  Lecture Notes in Computer Science 2075, 2001, pp. 101-120
• Unfolding of products of symmetrical Petri nets
  Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud
  Lecture Notes in Computer Science 2075, 2001, pp. 121-143
• Partial order verification of programmable logic controllers
  Peter Deussen
  Lecture Notes in Computer Science 2075, 2001, pp. 144-163
• Recurrence in infinite words
  Julien Cassaigne
  Lecture Notes in Computer Science 2010, 2001, pp. 1-11
• 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