Journal of the ACM, Volume 62

Volume 62, Number 1, February 2015

Approximation Algorithms

• 
  Mohit Singh, Lap Chi Lau:
  Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. 1:1-1:19

Computer-Aided Verification

• 
  Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
  Approximate Verification of the Symbolic Dynamics of Markov Chains. 2:1-2:34

Distributed Computing

• 
  James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
  Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. 3:1-3:22

Randomized Algorithms and Probabilistic Analysis

• 
  Tobias Brunsch, Heiko Röglin:
  Improved Smoothed Analysis of Multiobjective Optimization. 4:1-4:58

Security and Cryptography

• 
  Huijia Lin, Rafael Pass:
  Constant-Round Nonmalleable Commitments from Any One-Way Function. 5:1-5:30

Invited Articles Section

• 
  Victor Vianu:
  Invited Articles Foreword. 6:1

Distributed Computing

• 
  Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
  On the Complexity of Universal Leader Election. 7:1-7:27

Economics and Computation

• 
  Subhash Khot, Nisheeth K. Vishnoi:
  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ₁. 8:1-8:39

Formal Methods

• 
  Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh:
  Measuring and Synthesizing Systems in Probabilistic Environments. 9:1-9:34

Volume 62, Number 2, May 2015

Algorithmic Economics

• 
  Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins:
  Truthful Mechanisms with Implicit Payment Computation. 10:1-10:37

Automata Theory

• 
  Kousha Etessami, Mihalis Yannakakis:
  Recursive Markov Decision Processes and Recursive Stochastic Games. 11:1-11:69

Database Theory

• 
  Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
  Document Spanners: A Formal Approach to Information Extraction. 12:1-12:51

Learning Theory

• 
  Gregory Valiant:
  Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem. 13:1-13:45

Real-Time Systems

• 
  Sanjoy 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. 14:1-14:33

Verification for Security

• 
  David A. Basin, Felix Klaedtke, Samuel Müller, Eugen Zalinescu:
  Monitoring Metric First-Order Temporal Properties. 15:1-15:45

Invited Articles Section

• 
  Victor Vianu:
  Invited Article Foreword. 16:1

Complexity

• 
  Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
  Exponential Lower Bounds for Polytopes in Combinatorial Optimization. 17:1-17:23

Volume 62, Number 3, June 2015

Algorithmic Economics

• 
  Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
  Polyhedral Clinching Auctions and the AdWords Polytope. 18:1-18:27

Computational Complexity, Logic, Algorithms, Constraint Satisfaction

• 
  Manuel Bodirsky, Michael Pinsker:
  Schaefer's Theorem for Graphs. 19:1-19:52

Complexity Theory

• 
  Rahul Jain:
  New Strong Direct Product Results in Communication Complexity. 20:1-20:27

Learning Theory

• 
  Shahar Mendelson:
  Learning without Concentration. 21:1-21:25

Logic in Computer Science

• 
  Vince Bárány, Balder ten Cate, Luc Segoufin:
  Guarded Negation. 22:1-22:26

Proof Complexity

• 
  Ilario Bonacina, Nicola Galesi:
  A Framework for Space Complexity in Algebraic Proof Systems. 23:1-23:20

Invited Articles Section

• 
  Victor Vianu:
  Invited Article Foreword. 24:1

Computational Geometry

• 
  Natan Rubin:
  On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. 25:1-25:85

Volume 62, Number 4, August 2015

Complexity Theory

• 
  Peter Franek, Marek Krcál:
  Robust Satisfiability of Systems of Equations. 26:1-26:19

Computational Complexity

• 
  Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
  Delegating Computation: Interactive Proofs for Muggles. 27:1-27:64

Graph Algorithms

• 
  Marek Cygan, Harold N. Gabow, Piotr Sankowski:
  Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. 28:1-28:30

Invited Articles Section

• 
  Invited Articles Foreword. 29:1

Computer-Aided Verification

• 
  Alistair 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. 30:1-30:33

Distributed Computing

• 
  Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
  Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time. 31:1-31:21

Volume 62, Number 5, November 2015

Algorithmic Economics

• 
  Tim Roughgarden:
  Intrinsic Robustness of the Price of Anarchy. 32:1-32:42

Analysis of Algorithms

• 
  Flavio Chierichetti, Ravi Kumar:
  LSH-Preserving Functions and Their Applications. 33:1-33:25

Approximation Algorithms

• 
  Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
  Improving Christofides' Algorithm for the s-t Path TSP. 34:1-34:28

Computational Geometry

• 
  Michael Elkin, Shay Solomon:
  Optimal Euclidean Spanners: Really Short, Thin, and Lanky. 35:1-35:45
• 
  Seth Pettie:
  Sharp Bounds on Davenport-Schinzel Sequences of Every Order. 36:1-36:40

Distributed Computing

• 
  Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
  The Topology of Wireless Communication. 37:1-37:32
• 
  Zvi Lotker, Boaz Patt-Shamir, Seth Pettie:
  Improved Distributed Approximate Matching. 38:1-38:17

Formal Languages

• 
  Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
  Regular Languages Are Church-Rosser Congruential. 39:1-39:20

Randomized Algorithms and Probabilistic Analysis

• 
  Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
  A Polylogarithmic-Competitive Algorithm for the k-Server Problem. 40:1-40:49

Invited Articles Section

• 
  Avi Wigderson, Phokion G. Kolaitis:
  Invited Articles Foreword. 41:1

Approximation Algorithms

• 
  Sanjeev Arora, Boaz Barak, David Steurer:
  Subexponential Algorithms for Unique Games and Related Problems. 42:1-42:25

Relational Databases, Database Query Languages, and Economics

• 
  Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu:
  Query-Based Data Pricing. 43:1-43:44

Volume 62, Number 6, December 2015

Computational Geometry

• 
  Sariel Har-Peled, Benjamin Raichel:
  Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. 44:1-44:35

Cryptography

• 
  Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
  Attribute-Based Encryption for Circuits. 45:1-45:33
• 
  Eric Miles, Emanuele Viola:
  Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. 46:1-46:29

Distributed Computing

• 
  Bernhard Haeupler:
  Simple, Fast and Deterministic Gossip and Rumor Spreading. 47:1-47:18

Logic in Computer Science

• 
  Matthew Anderson, Anuj Dawar, Bjarki Holm:
  Solving Linear Programs without Breaking Abstractions. 48:1-48:26

Quantum Cryptography

• 
  Dominique Unruh:
  Revocable Quantum Timed-Release Encryption. 49:1-49:76

Randomized Algorithms and Probabilistic Analysis

• 
  Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
  Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. 50:1-50:60

Scientific Computing and High Performance Computing

• 
  Haim Avron, Alex Druinsky, Anshul Gupta:
  Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization. 51:1-51:27