Journal: Journal of the ACM

Volume 62, Issue 6

44 -- 0Sariel Har-Peled, Benjamin Raichel. Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
45 -- 0Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee. Attribute-Based Encryption for Circuits
46 -- 0Eric Miles, Emanuele Viola. Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
47 -- 0Bernhard Haeupler. Simple, Fast and Deterministic Gossip and Rumor Spreading
48 -- 0Matthew Anderson, Anuj Dawar, Bjarki Holm. Solving Linear Programs without Breaking Abstractions
49 -- 0Dominique Unruh. Revocable Quantum Timed-Release Encryption
50 -- 0Andreas Galanis, Daniel Stefankovic, Eric Vigoda. Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
51 -- 0Haim Avron, Alex Druinsky, Anshul Gupta. Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization

Volume 62, Issue 5

32 -- 0Tim Roughgarden. Intrinsic Robustness of the Price of Anarchy
33 -- 0Flavio Chierichetti, Ravi Kumar. LSH-Preserving Functions and Their Applications
34 -- 0Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys. Improving Christofides' Algorithm for the s-t Path TSP
35 -- 0Michael Elkin, Shay Solomon. Optimal Euclidean Spanners: Really Short, Thin, and Lanky
36 -- 0Seth Pettie. Sharp Bounds on Davenport-Schinzel Sequences of Every Order
37 -- 0Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. The Topology of Wireless Communication
38 -- 0Zvi Lotker, Boaz Patt-Shamir, Seth Pettie. Improved Distributed Approximate Matching
39 -- 0Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter. Regular Languages Are Church-Rosser Congruential
40 -- 0Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor. k-Server Problem
41 -- 0Avi Wigderson, Phokion G. Kolaitis. Invited Articles Foreword
42 -- 0Sanjeev Arora, Boaz Barak, David Steurer. Subexponential Algorithms for Unique Games and Related Problems
43 -- 0Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu. Query-Based Data Pricing

Volume 62, Issue 4

26 -- 0Peter Franek, Marek Krcál. Robust Satisfiability of Systems of Equations
27 -- 0Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum. Delegating Computation: Interactive Proofs for Muggles
28 -- 0Marek Cygan, Harold N. Gabow, Piotr Sankowski. Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings
29 -- 0. Invited Articles Foreword
30 -- 0Alistair Stewart, Kousha Etessami, Mihalis Yannakakis. Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata
31 -- 0Achour Mostéfaoui, Hamouma Moumen, Michel Raynal. Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time

Volume 62, Issue 3

18 -- 0Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme. Polyhedral Clinching Auctions and the AdWords Polytope
19 -- 0Manuel Bodirsky, Michael Pinsker. Schaefer's Theorem for Graphs
20 -- 0Rahul Jain. New Strong Direct Product Results in Communication Complexity
21 -- 0Shahar Mendelson. Learning without Concentration
22 -- 0Vince Bárány, Balder ten Cate, Luc Segoufin. Guarded Negation
23 -- 0Ilario Bonacina, Nicola Galesi. A Framework for Space Complexity in Algebraic Proof Systems
24 -- 0Victor Vianu. Invited Article Foreword
25 -- 0Natan Rubin. On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions

Volume 62, Issue 2

10 -- 0Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins. Truthful Mechanisms with Implicit Payment Computation
11 -- 0Kousha Etessami, Mihalis Yannakakis. Recursive Markov Decision Processes and Recursive Stochastic Games
12 -- 0Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren. Document Spanners: A Formal Approach to Information Extraction
13 -- 0Gregory Valiant. Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
14 -- 0Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie. Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
15 -- 0David A. Basin, Felix Klaedtke, Samuel Müller, Eugen Zalinescu. Monitoring Metric First-Order Temporal Properties
16 -- 0Victor Vianu. Invited Article Foreword
17 -- 0Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf. Exponential Lower Bounds for Polytopes in Combinatorial Optimization

Volume 62, Issue 1

1 -- 0Mohit Singh, Lap Chi Lau. Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
2 -- 0Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains
3 -- 0James Aspnes, Hagit Attiya, Keren Censor Hillel, Faith Ellen. Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
4 -- 0Tobias Brunsch, Heiko Röglin. Improved Smoothed Analysis of Multiobjective Optimization
5 -- 0Huijia Lin, Rafael Pass. Constant-Round Nonmalleable Commitments from Any One-Way Function
6 -- 0Victor Vianu. Invited Articles Foreword
7 -- 0Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson 0002, Amitabh Trehan. On the Complexity of Universal Leader Election
8 -- 0Subhash Khot, Nisheeth K. Vishnoi. 1
9 -- 0Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh 0002. Measuring and Synthesizing Systems in Probabilistic Environments