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

• Sparse sets, approximable sets, and parallel queries to NP
  Vikraman Arvind, Jacobo Torán
  Lecture Notes in Computer Science 1563, 1999, pp. 281-290
• External selection
  Jop F. Sibeyn
  Lecture Notes in Computer Science 1563, 1999, pp. 291-301
• Fast computations of the exponential function
  Timm Ahrendt
  Lecture Notes in Computer Science 1563, 1999, pp. 302-312
• A model of behaviour abstraction for communicating processes
  Maciej Koutny, Giuseppe Pappalardo
  Lecture Notes in Computer Science 1563, 1999, pp. 313-322
• Model checking lossy vector addition systems
  Ahmed Bouajjani, Richard Mayr
  Lecture Notes in Computer Science 1563, 1999, pp. 323-333
• Constructing light spanning trees with small routing cost
  Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
  Lecture Notes in Computer Science 1563, 1999, pp. 334-344
• Finding paths with the right cost
  Matti Nykänen, Esko Ukkonen
  Lecture Notes in Computer Science 1563, 1999, pp. 345-355
• In how many steps the k peg version of the towers of Hanoi game can be solved?
  Mario Szegedy
  Lecture Notes in Computer Science 1563, 1999, pp. 356-361
• Lower bounds for dynamic algebraic problems
  Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
  Lecture Notes in Computer Science 1563, 1999, pp. 362-372
• An explicit lower bound for TSP with distances one and two
  Lars Engebretsen
  Lecture Notes in Computer Science 1563, 1999, pp. 373-382
• Scheduling dynamic graphs
  Andreas Jacoby, Maciej Liśkiewicz, Rüdiger Reischuk
  Lecture Notes in Computer Science 1563, 1999, pp. 383-392
• Supporting increment and decrement operations in balancing networks
  William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
  Lecture Notes in Computer Science 1563, 1999, pp. 393-403
• Worst-case equilibria
  Elias Koutsoupias, Christos Papadimitriou
  Lecture Notes in Computer Science 1563, 1999, pp. 404-413
• A complete and tight average-case analysis of learning monomials
  Rüdiger Reischuk, Thomas Zeugmann
  Lecture Notes in Computer Science 1563, 1999, pp. 414-423
• Costs of general purpose learning
  John Case, Keh-Jiann Chen, Sanjay Jain
  Lecture Notes in Computer Science 1563, 1999, pp. 424-433
• Universal distributions and time-bounded Kolmogorov complexity
  Rainer Schuler
  Lecture Notes in Computer Science 1563, 1999, pp. 434-443
• The descriptive complexity approach to LOGCFL
  Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
  Lecture Notes in Computer Science 1563, 1999, pp. 444-454
• The weakness of self-complementation
  Orna Kupferman, Moshe Y. Vardi
  Lecture Notes in Computer Science 1563, 1999, pp. 455-466
• On the difference of Horn theories
  Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
  Lecture Notes in Computer Science 1563, 1999, pp. 467-477
• On quantum algorithms for noncommutative hidden subgroups
  Mark Ettinger, Peter Hyer
  Lecture Notes in Computer Science 1563, 1999, pp. 478-487
• On the size of randomized OBDDs and read-once branching programs for k-stable functions
  Martin Sauerhoff
  Lecture Notes in Computer Science 1563, 1999, pp. 488-499
• How to forget a secret
  Giovanni di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson
  Lecture Notes in Computer Science 1563, 1999, pp. 500-509
• A modal fixpoint logic with chop
  Markus Müller-Olm
  Lecture Notes in Computer Science 1563, 1999, pp. 510-520
• Completeness of neighbourhood logic
  Rana Barua, Suman Roy, Zhou Chaochen
  Lecture Notes in Computer Science 1563, 1999, pp. 521-530
• Eliminating recursion in the \mu-calculus
  Martin Otto
  Lecture Notes in Computer Science 1563, 1999, pp. 531-540