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

• The decimation process in random k-SAT
  Amin Coja-Oghlan, Angelica Y. Pachon-Pinzon
  Lecture Notes in Computer Science 6755, 2011, pp. 305-316
• Improved bounds for the randomized decision tree complexity of recursive majority
  Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
  Lecture Notes in Computer Science 6755, 2011, pp. 317-329
• The Fourier entropy-influence conjecture for certain classes of Boolean functions
  Ryan O'Donnell, John Wright, Yuan Zhou
  Lecture Notes in Computer Science 6755, 2011, pp. 330-341
• Nonmonotone submodular maximization via a structural continuous greedy algorithm
  Moran Feldman, Joseph (Seffi) Naor, Roy Schwartz
  Lecture Notes in Computer Science 6755, 2011, pp. 342-353
• Submodular cost allocation problem and applications
  Chandra Chekuri, Alina Ene
  Lecture Notes in Computer Science 6755, 2011, pp. 354-366
• Robust independence systems
  Naonori Kakimura, Kazuhisa Makino
  Lecture Notes in Computer Science 6755, 2011, pp. 367-378
• Buyback problem - Approximate matroid intersection with cancellation costs
  Ashwinkumar Badanidiyuru Varadaraja
  Lecture Notes in Computer Science 6755, 2011, pp. 379-390
• Tamper-proof circuits: How to trade leakage for tamper-resilience
  Sebastian Faust, Krzysztof Pietrzak, Daniele Venturi
  Lecture Notes in Computer Science 6755, 2011, pp. 391-402
• New algorithms for learning in presence of errors
  Sanjeev Arora, Rong Ge
  Lecture Notes in Computer Science 6755, 2011, pp. 403-415
• Exact learning algorithms, betting games, and circuit lower bounds
  Ryan C. Harkins, John M. Hitchcock
  Lecture Notes in Computer Science 6755, 2011, pp. 416-423
• Constraint satisfaction parameterized by solution size
  Andrei A. Bulatov, Dániel Marx
  Lecture Notes in Computer Science 6755, 2011, pp. 424-436
• Preprocessing for treewidth: A combinatorial analysis through kernelization
  Hans L. Bodlaender, Bart M.P. Jansen, Stefan Kratsch
  Lecture Notes in Computer Science 6755, 2011, pp. 437-448
• Subset feedback vertex set is fixed-parameter tractable
  Marek Cygan, Marcin Pilipczuk, Michaƚ Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6755, 2011, pp. 449-461
• Domination when the stars are out
  Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
  Lecture Notes in Computer Science 6755, 2011, pp. 462-473
• A simple deterministic reduction for the gap minimum distance of code problem
  Per Austrin, Subhash Khot
  Lecture Notes in Computer Science 6755, 2011, pp. 474-485
• Recoverable values for independent sets
  Uriel Feige, Daniel Reichman
  Lecture Notes in Computer Science 6755, 2011, pp. 486-497
• Vertex cover in graphs with locally few colors
  Fabian Kuhn, Monaldo Mastrolilli
  Lecture Notes in Computer Science 6755, 2011, pp. 498-509
• Maximizing polynomials subject to assignment constraints
  Konstantin Makarychev, Maxim Sviridenko
  Lecture Notes in Computer Science 6755, 2011, pp. 510-520
• A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid
  Leslie Ann Goldberg, Mark Jerrum
  Lecture Notes in Computer Science 6755, 2011, pp. 521-532
• Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
  Magnus Bordewich, Ross J. Kang
  Lecture Notes in Computer Science 6755, 2011, pp. 533-544
• Efficient sample extractors for juntas with applications
  Sourav Chakraborty, David García-Soriano, Arie Matsliah
  Lecture Notes in Computer Science 6755, 2011, pp. 545-556
• Efficiently decodable error-correcting list disjunct matrices and applications
  Hung Q. Ngo, Ely Porat, Atri Rudra
  Lecture Notes in Computer Science 6755, 2011, pp. 557-568
• Robust simulations and significant separations
  Lance Fortnow, Rahul Santhanam
  Lecture Notes in Computer Science 6755, 2011, pp. 569-580
• A PCP characterization of AM
  Andrew Drucker
  Lecture Notes in Computer Science 6755, 2011, pp. 581-592
• Lower bounds for online integer multiplication and convolution in the cell-probe model
  Raphaël Clifford, Markus Jalsenius
  Lecture Notes in Computer Science 6755, 2011, pp. 593-604