Abstract is missing.
- Parallel repetition in projection games and a concentration boundAnup Rao. 1-10 [doi]
- Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labelingRajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz. 11-20 [doi]
- Unique games on expanding constraint graphs are easy: extended abstractSanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi. 21-28 [doi]
- The complexity of temporal constraint satisfaction problemsManuel Bodirsky, Jan Kára. 29-38 [doi]
- An effective ergodic theorem and some applicationsSatyadev Nandakumar. 39-44 [doi]
- Algorithms for subset selection in linear regressionAbhimanyu Das, David Kempe. 45-54 [doi]
- Rethinking internet routingJennifer Rexford. 55-56 [doi]
- Interdomain routing and gamesHagay Levin, Michael Schapira, Aviv Zohar. 57-66 [doi]
- Optimal approximation for the submodular welfare problem in the value oracle modelJan Vondrák. 67-74 [doi]
- Optimal mechanism design and money burningJason D. Hartline, Tim Roughgarden. 75-84 [doi]
- The pattern matrix method for lower bounds on quantum communicationAlexander A. Sherstov. 85-94 [doi]
- Classical interaction cannot replace a quantum messageDmitry Gavinsky. 95-102 [doi]
- Span-program-based quantum algorithm for evaluating formulasBen Reichardt, Robert Spalek. 103-112 [doi]
- Delegating computation: interactive proofs for mugglesShafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum. 113-122 [doi]
- Universal semantic communication IBrendan Juba, Madhu Sudan. 123-132 [doi]
- Infeasibility of instance compression and succinct PCPs for NPLance Fortnow, Rahul Santhanam. 133-142 [doi]
- A (de)constructive approach to program checkingShafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum. 143-152 [doi]
- An o(log:::2::: k)-approximation algorithm for the k-vertex connected spanning subgraph problemJittat Fakcharoenphol, Bundit Laekhanukit. 153-158 [doi]
- Minimum k-way cuts via deterministic greedy tree packingMikkel Thorup. 159-166 [doi]
- Network design for vertex connectivityTanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna. 167-176 [doi]
- A fixed-parameter algorithm for the directed feedback vertex set problemJianer Chen, Yang Liu 0002, Songjian Lu, Barry O Sullivan, Igor Razgon. 177-186 [doi]
- Lossy trapdoor functions and their applicationsChris Peikert, Brent Waters. 187-196 [doi]
- Trapdoors for hard lattices and new cryptographic constructionsCraig Gentry, Chris Peikert, Vinod Vaikuntanathan. 197-206 [doi]
- Finding short lattice vectors within mordell s inequalityNicolas Gama, Phong Q. Nguyen. 207-216 [doi]
- Tight rmr lower bounds for mutual exclusion and other problemsHagit Attiya, Danny Hendler, Philipp Woelfel. 217-226 [doi]
- Randomized k-server on hierarchical binary treesAaron Cote, Adam Meyerson, Laura J. Poplawski. 227-234 [doi]
- Randomized competitive algorithms for generalized cachingNikhil Bansal, Niv Buchbinder, Joseph Naor. 235-244 [doi]
- Optimal algorithms and inapproximability results for every CSP?Prasad Raghavendra. 245-254 [doi]
- Optimal hierarchical decompositions for congestion minimization in networksHarald Räcke. 255-264 [doi]
- List-decoding reed-muller codes over small fieldsParikshit Gopalan, Adam R. Klivans, David Zuckerman. 265-274 [doi]
- Decodability of group homomorphisms beyond the johnson boundIrit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan. 275-284 [doi]
- Combinatorial construction of locally testable codesOr Meir. 285-294 [doi]
- Balanced outcomes in social exchange networksJon M. Kleinberg, Éva Tardos. 295-304 [doi]
- Pricing combinatorial markets for tournamentsYiling Chen, Sharad Goel, David M. Pennock. 305-314 [doi]
- Fast-converging tatonnement algorithms for one-time and ongoing market problemsRichard Cole, Lisa Fleischer. 315-324 [doi]
- A combinatorial construction of almost-ramanujan graphs using the zig-zag productAvraham Ben-Aroya, Amnon Ta-Shma. 325-334 [doi]
- An optimal sdp algorithm for max-cut, and equally optimal long code testsRyan O Donnell, Yi Wu. 335-344 [doi]
- On hardness of learning intersection of two halfspacesSubhash Khot, Rishi Saket. 345-354 [doi]
- Inapproximability of pure nash equilibriaAlexander Skopalik, Berthold Vöcking. 355-364 [doi]
- The myth of the folk theoremChristian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou. 365-372 [doi]
- Regret minimization and the price of total anarchyAvrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth. 373-382 [doi]
- Testing symmetric properties of distributionsPaul Valiant. 383-392 [doi]
- Every minor-closed property of sparse graphs is testableItai Benjamini, Oded Schramm, Asaf Shapira. 393-402 [doi]
- Algebraic property testing: the role of invarianceTali Kaufman, Madhu Sudan. 403-412 [doi]
- Complete fairness in secure two-party computationS. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell. 413-422 [doi]
- Games for exchanging informationGillat Kol, Moni Naor. 423-432 [doi]
- Cryptography with constant computational overheadYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 433-442 [doi]
- The vpn conjecture is trueNavin Goyal, Neil Olver, F. Bruce Shepherd. 443-450 [doi]
- Faster approximate lossy generalized flow via interior point algorithmsSamuel I. Daitch, Daniel A. Spielman. 451-460 [doi]
- On partitioning graphs via single commodity flowsLorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi. 461-470 [doi]
- Graph and map isomorphism and all polyhedral embeddings in linear timeKen-ichi Kawarabayashi, Bojan Mohar. 471-480 [doi]
- Fast polynomial factorization and modular composition in small characteristicChristopher Umans. 481-490 [doi]
- A quadratic lower bound for the permanent and determinant problem over any characteristic != 2Jin-yi Cai, Xi Chen, Dong Li. 491-498 [doi]
- Fast integer multiplication using modular arithmeticAnindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi. 499-506 [doi]
- Read-once polynomial identity testingAmir Shpilka, Ilya Volkovich. 507-516 [doi]
- The chow parameters problemRyan O Donnell, Rocco A. Servedio. 517-526 [doi]
- Agnostically learning decision treesParikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans. 527-536 [doi]
- Random projection trees and low dimensional manifoldsSanjoy Dasgupta, Yoav Freund. 537-546 [doi]
- Inverse conjecture for the gowers norm is falseShachar Lovett, Roy Meshulam, Alex Samorodnitsky. 547-556 [doi]
- Unconditional pseudorandom generators for low degree polynomialsShachar Lovett. 557-562 [doi]
- Graph sparsification by effective resistancesDaniel A. Spielman, Nikhil Srivastava. 563-568 [doi]
- Some topics in analysis of boolean functionsRyan O Donnell. 569-578 [doi]
- Uniform direct product theorems: simplified, optimized, and derandomizedRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. 579-588 [doi]
- Hardness amplification proofs require majorityRonen Shaltiel, Emanuele Viola. 589-598 [doi]
- Direct product theorems for classical communication complexity via subdistribution bounds: extended abstractRahul Jain, Hartmut Klauck, Ashwin Nayak. 599-608 [doi]
- A learning theory approach to non-interactive database privacyAvrim Blum, Katrina Ligett, Aaron Roth. 609-618 [doi]
- Evolvability from learning algorithmsVitaly Feldman. 619-628 [doi]
- On agnostic boosting and parity learningAdam Tauman Kalai, Yishay Mansour, Elad Verbin. 629-638 [doi]
- Computing how we became humanDavid Haussler. 639-640 [doi]
- Robust lower bounds for communication and stream computationAmit Chakrabarti, Graham Cormode, Andrew McGregor. 641-650 [doi]
- Sketching in adversarial environmentsIlya Mironov, Moni Naor, Gil Segev. 651-660 [doi]
- Communication in the presence of replicationOmer Barkol, Yuval Ishai, Enav Weinreb. 661-670 [doi]
- A discriminative framework for clustering via similarity functionsMaria-Florina Balcan, Avrim Blum, Santosh Vempala. 671-680 [doi]
- Multi-armed bandits in metric spacesRobert Kleinberg, Aleksandrs Slivkins, Eli Upfal. 681-690 [doi]
- Stateless distributed gradient descent for positive linear programsBaruch Awerbuch, Rohit Khandekar. 691-700 [doi]
- Towards an optimal separation of space and length in resolutionJakob Nordström, Johan Håstad. 701-710 [doi]
- Elusive functions and lower bounds for arithmetic circuitsRan Raz. 711-720 [doi]
- On the constant-depth complexity of k-cliqueBenjamin Rossman. 721-730 [doi]
- Algebrization: a new barrier in complexity theoryScott Aaronson, Avi Wigderson. 731-740 [doi]
- Hardness-randomness tradeoffs for bounded depth arithmetic circuitsZeev Dvir, Amir Shpilka, Amir Yehudayoff. 741-748 [doi]
- Optimal query complexity bounds for finding graphsSung-Soon Choi, Jeong Han Kim. 749-758 [doi]
- Additive approximation for bounded degree survivable network designLap Chi Lau, Mohit Singh. 759-768 [doi]
- Additive guarantees for degree bounded directed network designNikhil Bansal, Rohit Khandekar, Viswanath Nagarajan. 769-778 [doi]
- Logconcave random graphsAlan M. Frieze, Santosh Vempala, Juan Vera. 779-788 [doi]
- Graphs, polymorphisms and the complexity of homomorphism problemsLibor Barto, Marcin Kozik, Todd Niven. 789-796 [doi]