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

• Exact weight subgraphs and the k-sum conjecture
  Amir Abboud, Kevin Lewi
  Lecture Notes in Computer Science 7965, 2013, pp. 1-12
• Minimizing maximum (weighted) flow-time on related and unrelated machines
  S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
  Lecture Notes in Computer Science 7965, 2013, pp. 13-24
• Tight lower bound for linear sketches of moments
  Alexandr Andoni, Huy L. Nguy{\skew1\tilde{\mbox{\^e}}}n, Yury Polyanskiy, Yihong Wu
  Lecture Notes in Computer Science 7965, 2013, pp. 25-32
• Optimal partitioning for dual pivot quicksort
  Martin Aumüller, Martin Dietzfelbinger
  Lecture Notes in Computer Science 7965, 2013, pp. 33-44
• Space-time tradeoffs for subset sum: An improved worst case algorithm
  Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä
  Lecture Notes in Computer Science 7965, 2013, pp. 45-56
• On the extension complexity of combinatorial polytopes
  David Avis, Hans Raj Tiwary
  Lecture Notes in Computer Science 7965, 2013, pp. 57-68
• Algorithms for hub label optimization
  Maxim Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
  Lecture Notes in Computer Science 7965, 2013, pp. 69-80
• Improved approximation algorithms for (budgeted) node-weighted Steiner problems
  MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat
  Lecture Notes in Computer Science 7965, 2013, pp. 81-92
• Search-space size in contraction hierarchies
  Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
  Lecture Notes in Computer Science 7965, 2013, pp. 93-104
• Time-efficient quantum walks for 3-distinctness
  Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez
  Lecture Notes in Computer Science 7965, 2013, pp. 105-122
• An algebraic characterization of testable Boolean CSPs
  Arnab Bhattacharyya, Yuichi Yoshida
  Lecture Notes in Computer Science 7965, 2013, pp. 123-134
• Approximation algorithms for the joint replenishment problem with deadlines
  Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Świrszcz, Neal E. Young
  Lecture Notes in Computer Science 7965, 2013, pp. 135-147
• Sparse suffix tree construction in small space
  Philip Bille, Johannes Fischer, Inge Li Grtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhj
  Lecture Notes in Computer Science 7965, 2013, pp. 148-159
• Tree compression with top trees
  Philip Bille, Inge Li Grtz, Gad M. Landau, Oren Weimann
  Lecture Notes in Computer Science 7965, 2013, pp. 160-171
• Noncommutativity makes determinants hard
  Markus Bläser
  Lecture Notes in Computer Science 7965, 2013, pp. 172-183
• Optimal orthogonal graph drawing with convex bend costs
  Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
  Lecture Notes in Computer Science 7965, 2013, pp. 184-195
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
  Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
  Lecture Notes in Computer Science 7965, 2013, pp. 196-207
• On the complexity of higher order abstract Voronoi diagrams
  Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou Maksym Zavershynskyi
  Lecture Notes in Computer Science 7965, 2013, pp. 208-219
• A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
  Lecture Notes in Computer Science 7965, 2013, pp. 220-231
• Direct product via round-preserving compression
  Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff
  Lecture Notes in Computer Science 7965, 2013, pp. 232-243
• How hard is counting triangles in the streaming model?
  Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik
  Lecture Notes in Computer Science 7965, 2013, pp. 244-254
• Online checkpointing with improved worst-case guarantees
  Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
  Lecture Notes in Computer Science 7965, 2013, pp. 255-266
• Exact and efficient generation of geometric random variates and random graphs
  Karl Bringmann, Tobias Friedrich
  Lecture Notes in Computer Science 7965, 2013, pp. 267-278
• Finding short paths on polytopes by the shadow vertex algorithm
  Tobias Brunsch, Heiko Röglin
  Lecture Notes in Computer Science 7965, 2013, pp. 279-290
• On randomized online labeling with polynomially many labels
  Jan Bulánek, Michal Koucký, Michael Saks
  Lecture Notes in Computer Science 7965, 2013, pp. 291-302