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

• Unsatisfiability bounds for random CSPs from an energetic interpolation method
  Dimitris Achlioptas, Ricardo Menchaca-Mendez
  Lecture Notes in Computer Science 7391, 2012, pp. 1-12
• The NOF multiparty communication complexity of composed functions
  Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen
  Lecture Notes in Computer Science 7391, 2012, pp. 13-24
• Quantum strategies are better than classical in almost any XOR game
  Andris Ambainis, Artūrs Bac̑kurs, Kaspars Balodis, Dmitrijs Kravc̑enko, Raitis Ozolsand Juris Smotrovs, Madars Virza
  Lecture Notes in Computer Science 7391, 2012, pp. 25-37
• Efficient submodular function maximization under linear packing constraints
  Yossi Azar, Iftah Gamzu
  Lecture Notes in Computer Science 7391, 2012, pp. 38-50
• Polynomial-time isomorphism test for groups with no Abelian normal subgroups
  László Babai, Paolo Codenotti, Youming Qiao
  Lecture Notes in Computer Science 7391, 2012, pp. 51-62
• Clustering under perturbation resilience
  Maria Florina Balcan, Yingyu Liang
  Lecture Notes in Computer Science 7391, 2012, pp. 63-74
• Secretary problems with convex costs
  Siddharth Barman, Seeun Umboh, Shuchi Chawla, David Malec
  Lecture Notes in Computer Science 7391, 2012, pp. 75-87
• Nearly simultaneously resettable black-box zero knowledge
  Joshua Baron, Rafail Ostrovsky, Ivan Visconti
  Lecture Notes in Computer Science 7391, 2012, pp. 88-99
• Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity
  Bruno Bauwens
  Lecture Notes in Computer Science 7391, 2012, pp. 100-108
• On quadratic programming with a ratio objective
  Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan
  Lecture Notes in Computer Science 7391, 2012, pp. 109-120
• De-amortizing binary search trees
  Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman
  Lecture Notes in Computer Science 7391, 2012, pp. 121-132
• Efficient sampling methods for discrete distributions
  Karl Bringmann, Konstantinos Panagiotou
  Lecture Notes in Computer Science 7391, 2012, pp. 133-144
• Approximation algorithms for online weighted rank function maximization under matroid constraints
  Niv Buchbinder, Joseph (Seffi) Naor, R. Ravi, Mohit Singh
  Lecture Notes in Computer Science 7391, 2012, pp. 145-156
• Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
  Jaroslaw Byrka, Bartosz Rybicki
  Lecture Notes in Computer Science 7391, 2012, pp. 157-169
• Testing coverage functions
  Deeparnab Chakrabarty, Zhiyi Huang
  Lecture Notes in Computer Science 7391, 2012, pp. 170-181
• Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
  T.-H. Hubert Chan, Mingfei Li, Li Ning
  Lecture Notes in Computer Science 7391, 2012, pp. 182-193
• A dependent LP-rounding approach for the k-median problem
  Moses Charikar, Shi Li
  Lecture Notes in Computer Science 7391, 2012, pp. 194-205
• Node-weighted network design in planar and minor-closed families of graphs
  Chandra Chekuri, Alina Ene, Ali Vakilian
  Lecture Notes in Computer Science 7391, 2012, pp. 206-217
• Computing the visibility polygon of an island in a polygonal domain
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 7391, 2012, pp. 218-229
• Directed subset feedback vertex set is fixed-parameter tractable
  Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi, Dániel Marx
  Lecture Notes in Computer Science 7391, 2012, pp. 230-241
• Max-cut parameterized above the Edwards-Erdŏs bound
  Robert Crowston, Mark Jones, Matthias Mnich
  Lecture Notes in Computer Science 7391, 2012, pp. 242-253
• Clique cover and graph separation: New incompressibility results
  Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michaƚ Pilipczuk, Magnus Wahlström
  Lecture Notes in Computer Science 7391, 2012, pp. 254-265
• The inverse Shapley value problem
  Anindya De, Ilias Diakonikolas, Rocco Servedio
  Lecture Notes in Computer Science 7391, 2012, pp. 266-277
• Zero-one rounding of singular vectors
  Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
  Lecture Notes in Computer Science 7391, 2012, pp. 278-289
• Label cover instances with large girth and the hardness of approximating basic k-spanner
  Michael Dinitz, Guy Kortsarz, Ran Raz
  Lecture Notes in Computer Science 7391, 2012, pp. 290-301