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

• Dual lower bounds for approximate degree and Markov-Bernstein inequalities
  Mark Bun, Justin Thaler
  Lecture Notes in Computer Science 7965, 2013, pp. 303-314
• New doubling spanners: Better and simpler
  T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
  Lecture Notes in Computer Science 7965, 2013, pp. 315-327
• Maximum edge-disjoint paths in k-sums of graphs
  Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
  Lecture Notes in Computer Science 7965, 2013, pp. 328-339
• On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
  Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla
  Lecture Notes in Computer Science 7965, 2013, pp. 340-351
• Counting matchings of size k is \#W[1]-hard
  Radu Curticapean
  Lecture Notes in Computer Science 7965, 2013, pp. 352-363
• Faster exponential-time algorithms in graphs of bounded average degree
  Marek Cygan, Marcin Pilipczuk
  Lecture Notes in Computer Science 7965, 2013, pp. 364-375
• A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
  Anindya De, Ilias Diakonikolas, Rocco Servedio
  Lecture Notes in Computer Science 7965, 2013, pp. 376-387
• Combining binary search trees
  Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
  Lecture Notes in Computer Science 7965, 2013, pp. 388-399
• The two-handed tile assembly model is not intrinsically universal
  Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damian Woods
  Lecture Notes in Computer Science 7965, 2013, pp. 400-412
• Clustering in the Boolean hypercube in a list decoding regime
  Irit Dinur, Elazar Goldenberg
  Lecture Notes in Computer Science 7965, 2013, pp. 413-424
• A combinatorial polynomial algorithm for the linear Arrow-Debreu market
  Ran Duan, Kurt Mehlhorn
  Lecture Notes in Computer Science 7965, 2013, pp. 425-436
• Towards an understanding of polynomial calculus: New separations and lower bounds
  Yuval Filmus, Massimo Lauria, Mladen Miks̑a, Jakob Nordström, Marc Vinyals
  Lecture Notes in Computer Science 7965, 2013, pp. 437-448
• On the power of deterministic mechanisms for facility location games
  Dimitris Fotakis, Christos Tzamos
  Lecture Notes in Computer Science 7965, 2013, pp. 449-460
• \ell_2/\ell_2-foreach sparse recovery with low risk
  Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss
  Lecture Notes in Computer Science 7965, 2013, pp. 461-472
• Autoreducibility of complete sets for log-space and polynomial-time reductions
  Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek
  Lecture Notes in Computer Science 7965, 2013, pp. 473-484
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
  Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
  Lecture Notes in Computer Science 7965, 2013, pp. 485-496
• Deciding the winner of an arbitrary finite poset game is PSPACE-complete
  Daniel Grier
  Lecture Notes in Computer Science 7965, 2013, pp. 497-503
• Dynamic compressed strings with random access
  Roberto Grossi, Rajeev Raman, Satti Srinivasa Rao, Rossano Venturini
  Lecture Notes in Computer Science 7965, 2013, pp. 504-515
• The complexity of planar Boolean \#CSP with complex weights
  Heng Guo, Tyson Williams
  Lecture Notes in Computer Science 7965, 2013, pp. 516-527
• Arthur-Merlin streaming complexity
  Tom Gur, Ran Raz
  Lecture Notes in Computer Science 7965, 2013, pp. 528-539
• Local correctability of expander codes
  Brett Hemenway, Rafail Ostrovsky, Mary Wootters
  Lecture Notes in Computer Science 7965, 2013, pp. 540-551
• On the complexity of broadcast setup
  Martin Hirt, Pavel Raykov
  Lecture Notes in Computer Science 7965, 2013, pp. 552-563
• On model-based RIP-1 matrices
  Piotr Indyk, Ilya Razenshteyn
  Lecture Notes in Computer Science 7965, 2013, pp. 564-575
• Robust pseudorandom generators
  Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
  Lecture Notes in Computer Science 7965, 2013, pp. 576-588
• A robust AFPTAS for online bin packing with polynomial migration
  Klaus Jansen, Kim-Manuel Klein
  Lecture Notes in Computer Science 7965, 2013, pp. 589-600