Abstract is missing.
- The Promise of Differential Privacy: A Tutorial on Algorithmic TechniquesCynthia Dwork. 1-2 [doi]
- Green Computing AlgorithmicsKirk Pruhs. 3-4 [doi]
- Computing Blindfolded: New Developments in Fully Homomorphic EncryptionVinod Vaikuntanathan. 5-16 [doi]
- Min-max Graph Partitioning and Small Set ExpansionNikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz. 17-26 [doi]
- The Graph Minor Algorithm with Parity ConditionsKen-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan. 27-36 [doi]
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with ApplicationsChristian Wulff-Nilsen. 37-46 [doi]
- A Constant Factor Approximation Algorithm for Unsplittable Flow on PathsPaul Bonsma, Jens Schulz, Andreas Wiese. 47-56 [doi]
- How Bad is Forming Your Own Opinion?David Bindel, Jon M. Kleinberg, Sigal Oren. 57-66 [doi]
- The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson SolutionsPaul W. Goldberg, Christos H. Papadimitriou, Rahul Savani. 67-76 [doi]
- Welfare and Profit Maximization with Production CostsAvrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma. 77-86 [doi]
- Mechanism Design with Set-Theoretic BeliefsJing Chen, Silvio Micali. 87-96 [doi]
- Efficient Fully Homomorphic Encryption from (Standard) LWEZvika Brakerski, Vinod Vaikuntanathan. 97-106 [doi]
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic CircuitsCraig Gentry, Shai Halevi. 107-109 [doi]
- Coin Flipping with Constant Bias Implies One-Way FunctionsIftach Haitner, Eran Omri. 110-119 [doi]
- How to Garble Arithmetic CircuitsBenny Applebaum, Yuval Ishai, Eyal Kushilevitz. 120-129 [doi]
- Sharp Mixing Time Bounds for Sampling Random SurfacesPietro Caputo, Fabio Martinelli, Fabio Lucio Toninelli. 130-139 [doi]
- Improved Mixing Condition on the Grid for Counting and Sampling Independent SetsRicardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang. 140-149 [doi]
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential TimeMarek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk. 150-159 [doi]
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter TractableKen-ichi Kawarabayashi, Mikkel Thorup. 160-169 [doi]
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear TimeGlencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen. 170-179 [doi]
- Minimum Weight Cycles and Triangles: Equivalences and AlgorithmsLiam Roditty, Virginia Vassilevska Williams. 180-189 [doi]
- Graph Connectivities, Network Coding, and Expander GraphsHo Yee Cheung, Lap Chi Lau, Kai Man Leung. 190-199 [doi]
- Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2Loïc Seguin-Charbonneau, F. Bruce Shepherd. 200-209 [doi]
- Online Node-Weighted Steiner Tree and Related ProblemsJoseph Naor, Debmalya Panigrahi, Mohit Singh. 210-219 [doi]
- Extractors for Circuit SourcesEmanuele Viola. 220-229 [doi]
- Randomness Buys Depth for Approximate CountingEmanuele Viola. 230-239 [doi]
- Pseudorandomness for Read-Once FormulasAndrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan. 240-246 [doi]
- Dispersers for Affine Sources with Sub-polynomial EntropyRonen Shaltiel. 247-256 [doi]
- A Small PRG for Polynomial Threshold Functions of GaussiansDaniel M. Kane. 257-266 [doi]
- A Polylogarithmic-Competitive Algorithm for the k-Server ProblemNikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor. 267-276 [doi]
- 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in GeneralTimon Hertli. 277-284 [doi]
- On the Power of Adaptivity in Sparse RecoveryPiotr Indyk, Eric Price, David P. Woodruff. 285-294 [doi]
- (1 + eps)-Approximate Sparse RecoveryEric Price, David P. Woodruff. 295-304 [doi]
- Near Optimal Column-Based Matrix ReconstructionChristos Boutsidis, Petros Drineas, Malik Magdon-Ismail. 305-314 [doi]
- Near Linear Lower Bound for Dimension Reduction in L1Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen. 315-323 [doi]
- The 1D Area Law and the Complexity of Quantum States: A Combinatorial ApproachDorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani. 324-333 [doi]
- On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such SystemsDorit Aharonov, Lior Eldar. 334-343 [doi]
- Quantum Query Complexity of State ConversionTroy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy. 344-353 [doi]
- Optimal Bounds for Quantum Bit CommitmentAndré Chailloux, Iordanis Kerenidis. 354-362 [doi]
- Streaming Algorithms via Precision SamplingAlexandr Andoni, Robert Krauthgamer, Krzysztof Onak. 363-372 [doi]
- Steiner Shallow-Light Trees are Exponentially Lighter than Spanning OnesMichael Elkin, Shay Solomon. 373-382 [doi]
- Fully Dynamic Maximal Matching in O (log n) Update TimeSurender Baswana, Manoj Gupta, Sandeep Sen. 383-392 [doi]
- Which Networks are Least Susceptible to Cascading Failures?Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos. 393-402 [doi]
- The Power of Linear EstimatorsGregory Valiant, Paul Valiant. 403-412 [doi]
- An Algebraic Proof of a Robust Social Choice Impossibility TheoremDvir Falik, Ehud Friedgut. 413-422 [doi]
- Planar Graphs: Random Walks and Bipartiteness TestingArtur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler. 423-432 [doi]
- Testing and Reconstruction of Lipschitz Functions with Applications to Data PrivacyMadhav Jha, Sofya Raskhodnikova. 433-442 [doi]
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique GamesAlexandra Kolla, Konstantin Makarychev, Yury Makarychev. 443-452 [doi]
- The Grothendieck Constant is Strictly Smaller than Krivine's BoundMark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor. 453-462 [doi]
- A Parallel Approximation Algorithm for Positive Semidefinite ProgrammingRahul Jain, Penghui Yao. 463-471 [doi]
- Rounding Semidefinite Programming Hierarchies via Global CorrelationBoaz Barak, Prasad Raghavendra, David Steurer. 472-481 [doi]
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD ObjectivesVenkatesan Guruswami, Ali Kemal Sinop. 482-491 [doi]
- Markov LayoutFlavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. 492-501 [doi]
- Limitations of Randomized Mechanisms for Combinatorial AuctionsShaddin Dughmi, Jan Vondrák. 502-511 [doi]
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many BuyersSaeed Alaei. 512-521 [doi]
- Extreme-Value Theorems for Optimal Multidimensional PricingYang Cai, Constantinos Daskalakis. 522-531 [doi]
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion GamesIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. 532-541 [doi]
- On Range Searching in the Group Model and Combinatorial DiscrepancyKasper Green Larsen. 542-549 [doi]
- A Randomized Rounding Approach to the Traveling Salesman ProblemShayan Oveis Gharan, Amin Saberi, Mohit Singh. 550-559 [doi]
- Approximating Graphic TSP by MatchingsTobias Mömke, Ola Svensson. 560-569 [doi]
- A Unified Continuous Greedy Algorithm for Submodular MaximizationMoran Feldman, Joseph Naor, Roy Schwartz. 570-579 [doi]
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid CoveringsDaniel Dadush, Chris Peikert, Santosh Vempala. 580-589 [doi]
- A Nearly-m log n Time Solver for SDD Linear SystemsIoannis Koutis, Gary L. Miller, Richard Peng. 590-598 [doi]
- Balls and Bins: Smaller Hash Families and Faster EvaluationL. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder. 599-608 [doi]
- Lexicographic Products and the Power of Non-linear Network CodingAnna Blasiak, Robert Kleinberg, Eyal Lubetzky. 609-618 [doi]
- Quadratic Goldreich-Levin TheoremsMadhur Tulsiani, Julia Wolf. 619-628 [doi]
- Optimal Testing of Multivariate Polynomials over Small Prime FieldsElad Haramaty, Amir Shpilka, Madhu Sudan. 629-637 [doi]
- Tight Lower Bounds for 2-query LCCs over Finite FieldsArnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf. 638-647 [doi]
- A Two Prover One Round Game with Strong SoundnessSubhash Khot, Muli Safra. 648-657 [doi]
- The Randomness Complexity of Parallel RepetitionKai-Min Chung, Rafael Pass. 658-667 [doi]
- Privacy Amplification and Non-malleable Extractors via Character SumsYevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman. 668-677 [doi]
- Stateless Cryptographic ProtocolsVipul Goyal, Hemanta K. Maji. 678-687 [doi]
- Storing Secrets on Continually Leaky DevicesYevgeniy Dodis, Allison B. Lewko, Brent Waters, Daniel Wichs. 688-697 [doi]
- Medium Access Using QueuesDevavrat Shah, Jinwoo Shin, Prasad Tetali. 698-707 [doi]
- Local Distributed DecisionPierre Fraigniaud, Amos Korman, David Peleg. 708-717 [doi]
- The Complexity of RenamingDan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui. 718-727 [doi]
- Mutual Exclusion with O(log^2 Log n) Amortized WorkMichael A. Bender, Seth Gilbert. 728-737 [doi]
- Algorithms for the Generalized Sorting ProblemZhiyi Huang 0002, Sampath Kannan, Sanjeev Khanna. 738-747 [doi]
- Information Equals Amortized CommunicationMark Braverman, Anup Rao. 748-757 [doi]
- Delays and the Capacity of Continuous-Time ChannelsSanjeev Khanna, Madhu Sudan. 758-767 [doi]
- Efficient and Explicit Coding for Interactive CommunicationRan Gelles, Ankur Moitra, Amit Sahai. 768-777 [doi]
- Efficient Reconstruction of Random Multilinear FormulasAnkit Gupta 0001, Neeraj Kayal, Satyanarayana V. Lokam. 778-787 [doi]
- New Extension of the Weil Bound for Character Sums with Applications to CodingTali Kaufman, Shachar Lovett. 788-796 [doi]
- Maximizing Expected Utility for Stochastic Combinatorial Optimization ProblemsJian Li, Amol Deshpande. 797-806 [doi]
- Approximation Algorithms for Submodular Multiway PartitionChandra Chekuri, Alina Ene. 807-816 [doi]
- An FPTAS for #Knapsack and Related Counting ProblemsParikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda. 817-826 [doi]
- Approximation Algorithms for Correlated Knapsacks and Non-martingale BanditsAnupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi. 827-836 [doi]
- Evolution with RecombinationVarun Kanade. 837-846 [doi]