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

• Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
  Marek Karpinski
  Lecture Notes in Computer Science 1269, 1997, pp. 1-14
• Average-case complexity of shortest-paths problems in the vertex-potential model
  Colin Cooper, Alan Frieze, Kurt Mehlhorn, Volker Priebe
  Lecture Notes in Computer Science 1269, 1997, pp. 15-26
• Approximation algorithms for covering polygons with squares and similar problems
  Christos Levcopoulos, Joachim Gudmundsson
  Lecture Notes in Computer Science 1269, 1997, pp. 27-41
• Greedily approximating the r-independent set and k-center problems on random instances
  Bernd Kreuter, Till Nierhoff
  Lecture Notes in Computer Science 1269, 1997, pp. 43-53
• Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
  Sanjeev Arora
  Lecture Notes in Computer Science 1269, 1997, pp. 55-55
• Random sampling of Euler tours
  Prasad Tetali, Santosh Vempala
  Lecture Notes in Computer Science 1269, 1997, pp. 57-66
• A combinatorial consistency lemma with application to proving the PCP theorem
  Oded Goldreich, Shmuel Safra
  Lecture Notes in Computer Science 1269, 1997, pp. 67-84
• Super-bits, demi-bits, and N{\tilde P}/qpoly natural proofs
  Steven Rudich
  Lecture Notes in Computer Science 1269, 1997, pp. 85-93
• Sample spaces with small bias on neighborhoods
  Michael Saks, Shiyu Zhou
  Lecture Notes in Computer Science 1269, 1997, pp. 95-109
• Approximation on the Web: A compendium of NP optimization problems
  P. Crescenzi, V. Kann
  Lecture Notes in Computer Science 1269, 1997, pp. 111-118
• Random-based scheduling - New approximations and LP lower bounds
  Andreas S. Schulz, Martin Skutella
  Lecture Notes in Computer Science 1269, 1997, pp. 119-133
• ``Go with the Winners'' generators with applications to molecular modeling
  Marcus Peinado, Thomas Lengauer
  Lecture Notes in Computer Science 1269, 1997, pp. 135-149
• Probabilistic approximation of some NP optimization problems by finite-state machines
  Dawei Hong, Jean-Camille Birget
  Lecture Notes in Computer Science 1269, 1997, pp. 151-164
• Using hard problems to derandomize algorithms: An incomplete survey
  Russell Impagliazzo
  Lecture Notes in Computer Science 1269, 1997, pp. 165-173
• Weak and strong recognition by 2-way randomized automata
  Andris Ambainis, Rūsiņs̑ Freivalds, Marek Karpinski
  Lecture Notes in Computer Science 1269, 1997, pp. 175-185
• Tally languages accepted by Monte Carlo pushdown automata
  Jānis Kaņeps, Dainis Geidmanis, Rūsiņs̑ Freivalds
  Lecture Notes in Computer Science 1269, 1997, pp. 187-195
• Resource-bounded randomness and compressibility with respect to nonuniform measures
  Steven M. Kautz
  Lecture Notes in Computer Science 1269, 1997, pp. 197-211
• Randomness, stochasticity and approximations
  Yongge Wang
  Lecture Notes in Computer Science 1269, 1997, pp. 213-225