Journal of the ACM, Volume 61

Volume 61, Number 1, January 2014

• 
  Ran Duan, Seth Pettie:
  Linear-Time Approximation for Maximum Weight Matching. 1:1-1:23
• 
  Ryan Williams:
  Nonuniform ACC Circuit Lower Bounds. 2:1-2:32
• 
  Libor Barto, Marcin Kozik:
  Constraint Satisfaction Problems Solvable by Local Consistency Methods. 3:1-3:19
• 
  Daniel M. Kane, Jelani Nelson:
  Sparser Johnson-Lindenstrauss Transforms. 4:1-4:23
• 
  Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin:
  Approximating Markov Processes by Averaging. 5:1-5:45
• 
  Victor Vianu:
  Foreword to Invited Articles Section. 6:1
• 
  Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
  The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. 7:1-7:25
• 
  Pablo Barceló, Leonid Libkin, Juan L. Reutter:
  Querying Regular Graph Patterns. 8:1-8:54

Volume 61, Number 2, April 2014

• 
  Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
  Space-Efficient Frameworks for Top-k String Retrieval. 9:1-9:36
• 
  Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
  Avoiding Three Consecutive Blocks of the Same Size and Same Sum. 10:1-10:17
• 
  Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
  Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. 11:1-11:36
• 
  Shun'ichi Amano, Claire David, Leonid Libkin, Filip Murlak:
  XML Schema Mappings: Data Exchange and Metadata Management. 12:1-12:48
• 
  Ido Ben-Zvi, Yoram Moses:
  Beyond Lamport's Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems. 13:1-13:26
• 
  James Brotherston, Max I. Kanovich:
  Undecidability of Propositional Separation Logic and Its Neighbours. 14:1-14:43

Volume 61, Number 3, May 2014

• 
  Krishnendu Chatterjee, Monika Henzinger:
  Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. 15:1-15:40
• 
  Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim:
  Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces. 16:1-16:63
• 
  Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
  Computing All Maps into a Sphere. 17:1-17:44
• 
  Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui:
  Tight Bounds for Asynchronous Renaming. 18:1-18:51
• 
  Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons:
  The Cost of Fault Tolerance in Multi-Party Communication Complexity. 19:1-19:64

Volume 61, Number 4, July 2014

Algorithms, Graph Algorithms

• 
  Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
  Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. 20:1-20:41

Analysis of Algorithms

• 
  Bernard Chazelle:
  The Convergence of Bird Flocking. 21:1-21:35

Communication Complexity, Lower Bounds, Matrix Ranks

• 
  Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi:
  An Additive Combinatorics Approach Relating Rank to Communication Complexity. 22:1-22:18

Computational Complexity

• 
  Holger Dell, Dieter van Melkebeek:
  Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. 23:1-23:27

Logics and Meanings of Programs

• 
  Paolo Baldan, Silvia Crafa:
  A Logic for True Concurrency. 24:1-24:36

Invited Articles Section

• 
  Victor Vianu:
  Invited Articles Foreword. 25:1

Programming Languages

• 
  Amir M. Ben-Amram, Samir Genaim:
  Ranking Functions for Linear-Constraint Loops. 26:1-26:55
• 
  Steffen Lösch, Andrew M. Pitts:
  Denotational Semantics with Nominal Scott Domains. 27:1-27:46

Volume 61, Number 5, August 2014

Coding Theory

• 
  Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
  High-rate codes with sublinear-time decoding. 28:1-28:20

Cryptographic Protocols

• 
  Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin:
  Privacy amplification with asymptotically optimal entropy loss. 29:1-29:28

Distributed Algorithms

• 
  Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen:
  Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. 30:1-30:74

Invited Articles Section

• 
  Victor Vianu:
  Invited article foreword. 31:1

Database Systems and Theory

• 
  Benny Kimelfeld, Christopher Ré:
  Transducing Markov sequences. 32:1-32:48

Volume 61, Number 6, November 2014

Arithmetic Complexity

• 
  Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
  Approaching the Chasm at Depth Four. 33:1-33:16

Communication Complexity

• 
  Alexander A. Sherstov:
  Communication Lower Bounds Using Directional Derivatives. 34:1-34:71

Communication Theory

• 
  Zvika Brakerski, Yael Tauman Kalai, Moni Naor:
  Fast Interactive Coding against Adversarial Noise. 35:1-35:30

Distributed Computing

• 
  Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig:
  SKIP⁺: A Self-Stabilizing Skip Graph. 36:1-36:26

Graph Theory and Algorithms

• 
  James R. Lee, Shayan Oveis Gharan, Luca Trevisan:
  Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities. 37:1-37:30

Machine Learning

• 
  John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
  Privacy Aware Learning. 38:1-38:57

Visual Cryptography and Security

• 
  Xiaojing Wang, Qizhao Yuan, Hongliang Cai, Jiajia Fang:
  A New Approach to Image Sharing with High-Security Threshold Structure. 39:1-39:19

Invited Articles Section

• 
  Victor Vianu:
  Invited Article Foreword. 40:1

Computer-Aided Verification

• 
  Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
  Efficient Analysis of Probabilistic Programs with an Unbounded Counter. 41:1-41:35