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

• Improved approximation for the directed spanner problem
  Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
  Lecture Notes in Computer Science 6755, 2011, pp. 1-12
• An improved approximation algorithm for minimum-cost subset k-connectivity
  Bundit Laekhanukit
  Lecture Notes in Computer Science 6755, 2011, pp. 13-24
• Approximation schemes for capacitated geometric network design
  Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6755, 2011, pp. 25-36
• An O(\log n)-competitive algorithm for online constrained forest problems
  Jiawei Qian, David P. Williamson
  Lecture Notes in Computer Science 6755, 2011, pp. 37-48
• On the power of lower bound methods for one-way quantum communication complexity
  Shengyu Zhang
  Lecture Notes in Computer Science 6755, 2011, pp. 49-60
• Advice coins for classical and quantum computation
  Scott Aaronson, Andrew Drucker
  Lecture Notes in Computer Science 6755, 2011, pp. 61-72
• Quantum commitments from complexity assumptions
  André Chailloux, Iordanis Kerenidis, Bill Rosgen
  Lecture Notes in Computer Science 6755, 2011, pp. 73-85
• Limitations on quantum dimensionality reduction
  Aram W. Harrow, Ashley Montanaro, Anthony J. Short
  Lecture Notes in Computer Science 6755, 2011, pp. 86-97
• On tree-constrained matchings and generalizations
  Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, Julián Mestre
  Lecture Notes in Computer Science 6755, 2011, pp. 98-109
• Tight bounds for linkages in planar graphs
  Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios Thilikkos
  Lecture Notes in Computer Science 6755, 2011, pp. 110-121
• A tighter insertion-based approximation of the crossing number
  Markus Chimani, Petr Hlinȇný
  Lecture Notes in Computer Science 6755, 2011, pp. 122-134
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
  Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer
  Lecture Notes in Computer Science 6755, 2011, pp. 135-146
• Stochastic mean payoff games: Smoothed analysis and approximation schemes
  Endre Boros, Khaled Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
  Lecture Notes in Computer Science 6755, 2011, pp. 147-158
• Pairwise-interaction games
  Martin Dyer, Velumailum Mohanaraj
  Lecture Notes in Computer Science 6755, 2011, pp. 159-170
• Settling the complexity of local max-cut (almost) completely
  Robert Elsässer, Tobias Tscheuschner
  Lecture Notes in Computer Science 6755, 2011, pp. 171-182
• Clique clustering yields a PTAS for max-coloring interval graphs
  Tim Nonner
  Lecture Notes in Computer Science 6755, 2011, pp. 183-194
• On variants of file caching
  Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
  Lecture Notes in Computer Science 6755, 2011, pp. 195-206
• On the advice complexity of the k-server problem
  Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic̑, Richard Královic̑
  Lecture Notes in Computer Science 6755, 2011, pp. 207-218
• Sleep management on multiple machines for energy and flow time
  Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee, Chi-Man Liu, Hing-Fung Ting
  Lecture Notes in Computer Science 6755, 2011, pp. 219-231
• Meeting deadlines: How much speed suffices?
  S. Anand, Naveen Garg, Nicole Megow
  Lecture Notes in Computer Science 6755, 2011, pp. 232-243
• Range majority in constant time and linear space
  Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
  Lecture Notes in Computer Science 6755, 2011, pp. 244-255
• Dynamic planar range maxima queries
  Gerth Stlting Brodal, Konstantinos Tsakalidis
  Lecture Notes in Computer Science 6755, 2011, pp. 256-267
• Compact navigation and distance oracles for graphs with small treewidth
  Arash Farzan, Shahin Kamali
  Lecture Notes in Computer Science 6755, 2011, pp. 268-280
• Player-centric Byzantine agreement
  Martin Hirt, Vassilis Zikas
  Lecture Notes in Computer Science 6755, 2011, pp. 281-292
• Limits on the computational power of random strings
  Eric Allender, Luke Friedman, William Gasarch
  Lecture Notes in Computer Science 6755, 2011, pp. 293-304