Abstract is missing.
- Best Paper Awards [doi]
- FOCS 2005 - Copyright [doi]
- Committees [doi]
- Foreword [doi]
- Machtey Award [doi]
- Reviewers [doi]
- Knuth Prize [doi]
- Corporate Sponsors [doi]
- FOCS 2005 - Title Page [doi]
- On the Unique Games ConjectureSubhash Khot. 3 [doi]
- Algorithmic Techniques and Tools from Computational GeometryBernard Chazelle. 7 [doi]
- Agnostically Learning HalfspacesAdam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio. 11-20 [doi]
- Noise stability of functions with low in.uences invariance and optimalityElchanan Mossel, Ryan O Donnell, Krzysztof Oleszkiewicz. 21-30 [doi]
- Every decision tree has an in.uential variableRyan O Donnell, Michael E. Saks, Oded Schramm, Rocco A. Servedio. 31-39 [doi]
- Lower Bounds for the Noisy Broadcast ProblemNavin Goyal, Guy Kindler, Michael E. Saks. 40-52 [doi]
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l::1::Subhash Khot, Nisheeth K. Vishnoi. 53-62 [doi]
- The Closest Substring problem with small distancesDániel Marx. 63-72 [doi]
- Fitting tree metrics: Hierarchical clustering and PhylogenyNir Ailon, Moses Charikar. 73-82 [doi]
- Metric Embeddings with Relaxed GuaranteesIttai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins. 83-100 [doi]
- Nonembeddability theorems via Fourier analysisSubhash Khot, Assaf Naor. 101-112 [doi]
- On the Complexity of Two-PlayerWin-Lose GamesTimothy G. Abbott, Daniel Kane, Paul Valiant. 113-122 [doi]
- Nash Equilibria in Random GamesImre Bárány, Santosh Vempala, Adrian Vetta. 123-131 [doi]
- Query Incentive NetworksJon M. Kleinberg, Prabhakar Raghavan. 132-141 [doi]
- Sink Equilibria and ConvergenceMichel X. Goemans, Vahab S. Mirrokni, Adrian Vetta. 142-154 [doi]
- On the Complexity of Real FunctionsMark Braverman. 155-164 [doi]
- Linear Lower Bounds on Real-World Implementations of Concurrent ObjectsFaith Ellen Fich, Danny Hendler, Nir Shavit. 165-173 [doi]
- Towards a Final Analysis of Pairing HeapsSeth Pettie. 174-183 [doi]
- Structuring labeled trees for optimal succinctness, and beyondPaolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. 184-196 [doi]
- Approximation Algorithms for Unique GamesLuca Trevisan. 197-205 [doi]
- On Non-Approximability for Quadratic ProgramsSanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra. 206-215 [doi]
- Hardness of Approximating the Closest Vector Problem with Pre-ProcessingMikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi. 216-225 [doi]
- Hardness of the Undirected Edge-Disjoint Paths Problem with CongestionMatthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang. 226-244 [doi]
- A Recursive Greedy Algorithm for Walks in Directed GraphsChandra Chekuri, Martin Pál. 245-253 [doi]
- Approximation Algorithms for Scheduling on Multiple MachinesV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. 254-263 [doi]
- AdWords and Generalized On-line MatchingAranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani. 264-273 [doi]
- The Parking Permit ProblemAdam Meyerson. 274-284 [doi]
- Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial TimeFarzad Parvaresh, Alexander Vardy. 285-294 [doi]
- Error Correction via Linear ProgrammingEmmanuel J. Candès, Mark Rudelson, Terence Tao, Roman Vershynin. 295-308 [doi]
- Error-Correcting Codes for Automatic ControlRafail Ostrovsky, Yuval Rabani, Leonard J. Schulman. 309-316 [doi]
- Almost Orthogonal Linear Codes are Locally TestableTali Kaufman, Simon Litsyn. 317-326 [doi]
- On Delsarte s Linear Programming Bounds for Binary CodesMichael Navon, Alex Samorodnitsky. 327-338 [doi]
- Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update MethodSanjeev Arora, Elad Hazan, Satyen Kale. 339-348 [doi]
- Improved Smoothed Analysis of the Shadow Vertex Simplex MethodAmit Deshpande, Daniel A. Spielman. 349-356 [doi]
- Sampling-based Approximation Algorithms for Multi-stage StochasticChaitanya Swamy, David B. Shmoys. 357-366 [doi]
- How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering ProblemsKedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh. 367-378 [doi]
- Group-theoretic Algorithms for Matrix MultiplicationHenry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans. 379-388 [doi]
- Answering distance queries in directed graphs using fast matrix multiplicationRaphael Yuster, Uri Zwick. 389-396 [doi]
- A Randomness-Efficient Sampler for Matrix-valued Functions and ApplicationsAvi Wigderson, David Xiao. 397-406 [doi]
- Deterministic Extractors for Affine Sources over Large FieldsAriel Gabizon, Ran Raz. 407-418 [doi]
- Additive Approximation for Edge-Deletion ProblemsNoga Alon, Asaf Shapira, Benny Sudakov. 419-428 [doi]
- A Characterization of the (natural) Graph Properties Testable with One-Sided ErrorNoga Alon, Asaf Shapira. 429-438 [doi]
- An Algorithmic Version of the Hypergraph Regularity MethodPenny E. Haxell, Brendan Nagle, Vojtech Rödl. 439-448 [doi]
- Cryptography In the Bounded Quantum-Storage ModelIvan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner. 449-458 [doi]
- Quantum Information and the PCP TheoremRan Raz. 459-468 [doi]
- From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groupsDave Bacon, Andrew M. Childs, Wim van Dam. 469-478 [doi]
- The Symmetric Group Defies Strong Fourier SamplingCristopher Moore, Alexander Russell, Leonard J. Schulman. 479-490 [doi]
- On Learning Mixtures of Heavy-Tailed DistributionsAnirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler. 491-500 [doi]
- Learning mixtures of product distributions over discrete domainsJon Feldman, Ryan O Donnell, Rocco A. Servedio. 501-510 [doi]
- A general lower bound for mixing of single-site dynamics on graphsThomas P. Hayes, Alistair Sinclair. 511-520 [doi]
- Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)Tomás Brázdil, Javier Esparza, Antonín Kucera. 521-530 [doi]
- Safraless Decision ProceduresOrna Kupferman, Moshe Y. Vardi. 531-542 [doi]
- How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial SimulationBoaz Barak, Amit Sahai. 543-552 [doi]
- On the Impossibility of Obfuscation with Auxiliary InputShafi Goldwasser, Yael Tauman Kalai. 553-562 [doi]
- Concurrent Non-Malleable CommitmentsRafael Pass, Alon Rosen. 563-572 [doi]
- The Complexity of Online Memory CheckingMoni Naor, Guy N. Rothblum. 573-584 [doi]
- Rational Secure Computation and Ideal Mechanism DesignSergei Izmalkov, Silvio Micali, Matt Lepinski. 585-595 [doi]
- Truthful and Near-Optimal Mechanism Design via Linear ProgrammingRon Lavi, Chaitanya Swamy. 595-604 [doi]
- Mechanism Design via Machine LearningMaria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour. 605-614 [doi]
- Beyond VCG: Frugality of Truthful MechanismsAnna R. Karlin, David Kempe, Tami Tamir. 615-626 [doi]
- An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar GraphsJon M. Kleinberg. 627-636 [doi]
- Algorithmic Graph Minor Theory: Decomposition, Approximation, and ColoringErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. 637-646 [doi]
- A linear-time approximation scheme for planar weighted TSPPhilip N. Klein. 647-657 [doi]
- A Tale of Two Dimensional Bin PackingNikhil Bansal, Andrea Lodi, Maxim Sviridenko. 657-666 [doi]