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

• Nondeterministic instance complexity and hard-to-prove tautologies
  Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
  Lecture Notes in Computer Science 1770, 2000, pp. 314-323
• Hard instances of hard problems
  Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
  Lecture Notes in Computer Science 1770, 2000, pp. 324-333
• Simulation and bisimulation over one-counter processes
  Petr Janc̑ar, Antonín Kuc̑era, Faron Moller
  Lecture Notes in Computer Science 1770, 2000, pp. 334-345
• Decidability of reachability problems for classes of two counters automata
  Alain Finkel, Grégoire Sutre
  Lecture Notes in Computer Science 1770, 2000, pp. 346-357
• Hereditary history preserving bisimilarity is undecidable
  Marcin Jurdziński, Mogens Nielsen
  Lecture Notes in Computer Science 1770, 2000, pp. 358-369
• The hardness of approximating spanner problems
  Michael Elkin, David Peleg
  Lecture Notes in Computer Science 1770, 2000, pp. 370-381
• An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality
  Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Ralf Klasing, Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 1770, 2000, pp. 382-394
• \lambda-coloring of graphs
  Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
  Lecture Notes in Computer Science 1770, 2000, pp. 395-406
• Optimal proof systems and sparse sets
  Harry Buhrman, Steve Fenner, Lance Fortnow, Dieter van Melkebeek
  Lecture Notes in Computer Science 1770, 2000, pp. 407-418
• Almost complete sets
  Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn
  Lecture Notes in Computer Science 1770, 2000, pp. 419-430
• Graph isomorphism is low for ZPP(NP) and other lowness results
  Vikraman Arvind, Johannes Köbler
  Lecture Notes in Computer Science 1770, 2000, pp. 431-442
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
  Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
  Lecture Notes in Computer Science 1770, 2000, pp. 443-454
• Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem
  Klaus Jansen, Maxim I. Sviridenko
  Lecture Notes in Computer Science 1770, 2000, pp. 455-465
• Controlled conspiracy-2 search
  Ulf Lorenz
  Lecture Notes in Computer Science 1770, 2000, pp. 466-478
• The stability of saturated linear dynamical systems is undecidable
  Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
  Lecture Notes in Computer Science 1770, 2000, pp. 479-490
• Tilings: Recursivity and regularity
  Julien Cervelle, Bruno Durand
  Lecture Notes in Computer Science 1770, 2000, pp. 491-502
• Listing all potential maximal cliques of a graph
  Vincent Bouchitté, Ioan Todinca
  Lecture Notes in Computer Science 1770, 2000, pp. 503-515
• Distance labeling schemes for well-separated graph classes
  Michal Katz, Nir A. Katz, David Peleg
  Lecture Notes in Computer Science 1770, 2000, pp. 516-528
• Pruning graphs with digital search trees - Application to distance hereditary graphs
  Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry
  Lecture Notes in Computer Science 1770, 2000, pp. 529-541
• Characterizing and deciding MSO-definability of macro tree transductions
  Joost Engelfriet, Sebastian Maneth
  Lecture Notes in Computer Science 1770, 2000, pp. 542-554
• Languages of dot-depth 3/2
  Christian Glass̈er, Heinz Schmitz
  Lecture Notes in Computer Science 1770, 2000, pp. 555-566
• Random generation and approximate counting of ambiguously described combinatorial structures
  Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
  Lecture Notes in Computer Science 1770, 2000, pp. 567-580
• The CNN problem and other k-server variants
  Elias Koutsoupias, David Scot Taylor
  Lecture Notes in Computer Science 1770, 2000, pp. 581-592
• The weighted 2-server problem
  Marek Chrobak, Jiȓí Sgall
  Lecture Notes in Computer Science 1770, 2000, pp. 593-604
• On the competitive ratio of the work function algorithm for the k-server problem
  Yair Bartal, Elias Koutsoupias
  Lecture Notes in Computer Science 1770, 2000, pp. 605-613