Abstract is missing.
- The work of Leslie ValiantAvi Wigderson. 1-2 [doi]
- Message passing algorithms and improved LP decodingSanjeev Arora, Constantinos Daskalakis, David Steurer. 3-12 [doi]
- List decoding tensor products and interleaved codesParikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra. 13-22 [doi]
- Artin automorphisms, cyclotomic function fields, and folded list-decodable codesVenkatesan Guruswami. 23-32 [doi]
- A deterministic reduction for the gap minimum distance problem: [extended abstract]Qi Cheng, Daqing Wan. 33-38 [doi]
- 3-query locally decodable codes of subexponential lengthKlim Efremenko. 39-44 [doi]
- Exact learning of random DNF over the uniform distributionLinda Sellie. 45-54 [doi]
- Polynomial-time theory of matrix groupsLászló Babai, Robert Beals, Ákos Seress. 55-64 [doi]
- Affine dispersers from subspace polynomialsEli Ben-Sasson, Swastik Kopparty. 65-74 [doi]
- On oblivious PTAS s for nash equilibriumConstantinos Daskalakis, Christos H. Papadimitriou. 75-84 [doi]
- The extended BG-simulation and the characterization of t-resiliencyEli Gafni. 85-92 [doi]
- An efficient algorithm for partial order productionJean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro. 93-100 [doi]
- A nearly optimal oracle for avoiding failed vertices and edgesAaron Bernstein, David Karger. 101-110 [doi]
- Distributed (delta+1)-coloring in linear (in delta) timeLeonid Barenboim, Michael Elkin. 111-120 [doi]
- Near-perfect load balancing by randomized roundingTobias Friedrich, Thomas Sauerwald. 121-130 [doi]
- New direct-product testers and 2-query PCPsRussell Impagliazzo, Valentine Kabanets, Avi Wigderson. 131-140 [doi]
- On proximity oblivious testingOded Goldreich, Dana Ron. 141-150 [doi]
- Testing juntas nearly optimallyEric Blais. 151-158 [doi]
- Green s conjecture and testing linear-invariant propertiesAsaf Shapira. 159-166 [doi]
- Athena lecture: Controlling Access to Programs?Shafi Goldwasser. 167-168 [doi]
- Fully homomorphic encryption using ideal latticesCraig Gentry. 169-178 [doi]
- A unified framework for concurrent security: universal composability from stand-alone non-malleabilityHuijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam. 179-188 [doi]
- Non-malleability amplificationHuijia Lin, Rafael Pass. 189-198 [doi]
- Approximating edit distance in near-linear timeAlexandr Andoni, Krzysztof Onak. 199-204 [doi]
- Numerical linear algebra in the streaming modelKenneth L. Clarkson, David P. Woodruff. 205-214 [doi]
- A fast and efficient algorithm for low-rank approximation of a matrixNam H. Nguyen, Thong T. Do, Trac D. Tran. 215-224 [doi]
- An improved constant-time approximation algorithm for maximum~matchingsYuichi Yoshida, Masaki Yamamoto, Hiro Ito. 225-234 [doi]
- Finding sparse cuts locally using evolving setsReid Andersen, Yuval Peres. 235-244 [doi]
- On the geometry of graphs with a forbidden minorJames R. Lee, Anastasios Sidiropoulos. 245-254 [doi]
- Twice-ramanujan sparsifiersJoshua D. Batson, Daniel A. Spielman, Nikhil Srivastava. 255-262 [doi]
- Max cut and the smallest eigenvalueLuca Trevisan. 263-272 [doi]
- Homology flows, cohomology cutsErin W. Chambers, Jeff Erickson, Amir Nayyeri. 273-282 [doi]
- Integrality gaps for Sherali-Adams relaxationsMoses Charikar, Konstantin Makarychev, Yury Makarychev. 283-292 [doi]
- Sherali-adams relaxations of the matching polytopeClaire Mathieu, Alistair Sinclair. 293-302 [doi]
- CSP gaps and reductions in the lasserre hierarchyMadhur Tulsiani. 303-312 [doi]
- Linear time approximation schemes for the Gale-Berlekamp game and related minimization problemsMarek Karpinski, Warren Schudy. 313-322 [doi]
- Non-monotone submodular maximization under matroid and knapsack constraintsJon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. 323-332 [doi]
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstractChris Peikert. 333-342 [doi]
- A constructive proof of the Lovász local lemmaRobin A. Moser. 343-350 [doi]
- Universally utility-maximizing privacy mechanismsArpita Ghosh, Tim Roughgarden, Mukund Sundararajan. 351-360 [doi]
- Private coresetsDan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim. 361-370 [doi]
- Differential privacy and robust statisticsCynthia Dwork, Jing Lei. 371-380 [doi]
- On the complexity of differentially private data release: efficient algorithms and hardness resultsCynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan. 381-390 [doi]
- Quantum algorithms using the curvelet transformYi-Kai Liu. 391-400 [doi]
- Short seed extractors against quantum storageAmnon Ta-Shma. 401-408 [doi]
- Efficient discrete-time simulations of continuous-time quantum query algorithmsRichard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo. 409-416 [doi]
- The detectability lemma and quantum gap amplificationDorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani. 417-426 [doi]
- Affiliation networksSilvio Lattanzi, D. Sivakumar. 427-434 [doi]
- Fault-tolerant spanners for general graphsS. Chechik, M. Langberg, David Peleg, Liam Roditty. 435-444 [doi]
- Hadwiger s conjecture is decidableKen-ichi Kawarabayashi, Bruce A. Reed. 445-454 [doi]
- Finding, minimizing, and counting weighted subgraphsVirginia Vassilevska, Ryan Williams. 455-464 [doi]
- On the complexity of communication complexityEyal Kushilevitz, Enav Weinreb. 465-474 [doi]
- Bit-probe lower bounds for succinct data structuresEmanuele Viola. 475-482 [doi]
- Randomly supported independence and resistancePer Austrin, Johan Håstad. 483-492 [doi]
- Conditional hardness for satisfiable 3-CSPsRyan O Donnell, Yi Wu. 493-502 [doi]
- A new approach to auctions and resilient mechanism designJing Chen, Silvio Micali. 503-512 [doi]
- Intrinsic robustness of the price of anarchyTim Roughgarden. 513-522 [doi]
- On the convergence of regret minimization dynamics in concave gamesEyal Even-Dar, Yishay Mansour, Uri Nadav. 523-532 [doi]
- Multiplicative updates outperform generic no-regret learning in congestion games: extended abstractRobert Kleinberg, Georgios Piliouras, Éva Tardos. 533-542 [doi]
- MaxMin allocation via degree lower-bounded arborescencesMohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami. 543-552 [doi]
- How long does it take to catch a wild kangaroo?Ravi Montenegro, Prasad Tetali. 553-560 [doi]
- Random walks on polytopes and an affine interior point method for linear programmingRavi Kannan, Hariharan Narayanan. 561-570 [doi]
- Mixing time for the solid-on-solid modelFabio Martinelli, Alistair Sinclair. 571-580 [doi]
- Reconstruction for the Potts modelAllan Sly. 581-590 [doi]
- Tight lower bounds for greedy routing in uniform small world ringsMartin Dietzfelbinger, Philipp Woelfel. 591-600 [doi]
- Non-malleable extractors and symmetric key cryptography from weak secretsYevgeniy Dodis, Daniel Wichs. 601-610 [doi]
- Inaccessible entropyIftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee. 611-620 [doi]
- On cryptography with auxiliary inputYevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett. 621-630 [doi]
- Every planar graph is the intersection graph of segments in the plane: extended abstractJérémie Chalopin, Daniel Gonçalves. 631-638 [doi]
- Small-size epsilon-nets for axis-parallel rectangles and boxesBoris Aronov, Esther Ezra, Micha Sharir. 639-648 [doi]
- Explicit construction of a small epsilon-net for linear threshold functionsYuval Rabani, Amir Shpilka. 649-658 [doi]
- A constant-factor approximation for stochastic Steiner forestAnupam Gupta, Amit Kumar. 659-668 [doi]
- Multiple intents re-rankingYossi Azar, Iftah Gamzu, Xiaoxin Yin. 669-678 [doi]
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentationJivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara. 679-684 [doi]
- Online and stochastic survivable network designAnupam Gupta, Ravishankar Krishnaswamy, R. Ravi. 685-694 [doi]
- An axiomatic approach to algebrizationRussell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. 695-704 [doi]
- Random graphs and the parity quantifierPhokion G. Kolaitis, Swastik Kopparty. 705-714 [doi]
- Holant problems and counting CSPJin-yi Cai, Pinyan Lu, Mingji Xia. 715-724 [doi]
- A new line of attack on the dichotomy conjectureGábor Kun, Mario Szegedy. 725-734 [doi]