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

• A new category for semantics
  Dana S. Scott
  Lecture Notes in Computer Science 2136, 2001, pp. 1-2
• On implications between P-NP-hypotheses: Decision versus computation in algebraic complexity
  Peter Bürgisser
  Lecture Notes in Computer Science 2136, 2001, pp. 3-17
• Playing games with algorithms: Algorithmic combinatorial game theory
  Erik D. Demaine
  Lecture Notes in Computer Science 2136, 2001, pp. 18-32
• Some recent results on data mining and search
  Amos Fiat
  Lecture Notes in Computer Science 2136, 2001, pp. 33-36
• Hypertree decompositions: A survey
  Georg Gottlob, Nicola Leone, Francesco Scarcello
  Lecture Notes in Computer Science 2136, 2001, pp. 37-57
• The strength of non-size-increasing computation
  Martin Hofmann
  Lecture Notes in Computer Science 2136, 2001, pp. 58-61
• Introduction to recent quantum algorithms
  Peter Hyer
  Lecture Notes in Computer Science 2136, 2001, pp. 62-73
• Decomposition methods and sampling circuits in the Cartesian lattice
  Dana Randall
  Lecture Notes in Computer Science 2136, 2001, pp. 74-86
• New algorithms for k-SAT based on the local search principle
  Uwe Schöning
  Lecture Notes in Computer Science 2136, 2001, pp. 87-95
• Linear temporal logic and finite semigroups
  Thomas Wilke
  Lecture Notes in Computer Science 2136, 2001, pp. 96-110
• Refined search tree technique for DOMINATING SET on planar graphs
  Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Fran Rosamond, Ulrike Stege
  Lecture Notes in Computer Science 2136, 2001, pp. 111-122
• The computational power of a family of decision forests
  Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
  Lecture Notes in Computer Science 2136, 2001, pp. 123-134
• Exact results for accepting probabilities of quantum automata
  Andris Ambainis, Arnolds Ķikusts
  Lecture Notes in Computer Science 2136, 2001, pp. 135-147
• Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
  Albert Atserias
  Lecture Notes in Computer Science 2136, 2001, pp. 148-158
• Analysis problems for sequential dynamical systems and communicating state machines
  Chris Barrett, Harry B. Hunt III, Madhav V. Marathe, S.S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
  Lecture Notes in Computer Science 2136, 2001, pp. 159-172
• The complexity of tensor circuit evaluation
  Martin Beaudry, Markus Holzer
  Lecture Notes in Computer Science 2136, 2001, pp. 173-185
• Computing reciprocals of bivariate power series
  Markus Bläser
  Lecture Notes in Computer Science 2136, 2001, pp. 186-197
• Automatic verification of recursive procedures with one integer parameter
  Ahmed Bouajjani, Peter Habermehl, Richard Mayr
  Lecture Notes in Computer Science 2136, 2001, pp. 198-211
• Graph-driven free parity BDDs: Algorithms and lower bounds
  Henrik Brosenne, Matthias Homeister, Stephan Waack
  Lecture Notes in Computer Science 2136, 2001, pp. 212-223
• Computable versions of Baire's category theorem
  Vasco Brattka
  Lecture Notes in Computer Science 2136, 2001, pp. 224-235
• Automata on linear orderings
  Véronique Bruyère, Olivier Carton
  Lecture Notes in Computer Science 2136, 2001, pp. 236-247
• Algorithmic information theory and cellular automata dynamics
  Julien Cervelle, Bruno Durand, Enrico Formenti
  Lecture Notes in Computer Science 2136, 2001, pp. 248-259
• The k-median problem for directed trees
  Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
  Lecture Notes in Computer Science 2136, 2001, pp. 260-271
• On pseudorandom generators in NC^0
  Mary Cryan, Peter Bro Miltersen
  Lecture Notes in Computer Science 2136, 2001, pp. 272-284
• There are no sparse NP_w-hard sets
  Felipe Cucker, Dima Grigoriev
  Lecture Notes in Computer Science 2136, 2001, pp. 285-291