Journal: Journal of the ACM

Volume 61, Issue 6

33 -- 0Ankit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi. Approaching the Chasm at Depth Four
34 -- 0Alexander A. Sherstov. Communication Lower Bounds Using Directional Derivatives
35 -- 0Zvika Brakerski, Yael Tauman Kalai, Moni Naor. Fast Interactive Coding against Adversarial Noise
36 -- 0Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig. +: A Self-Stabilizing Skip Graph
37 -- 0James R. Lee, Shayan Oveis Gharan, Luca Trevisan. Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities
38 -- 0John C. Duchi, Michael I. Jordan, Martin J. Wainwright. Privacy Aware Learning
39 -- 0Xiaojing Wang, Qizhao Yuan, Hongliang Cai, Jiajia Fang. A New Approach to Image Sharing with High-Security Threshold Structure
40 -- 0Victor Vianu. Invited Article Foreword
41 -- 0Tomás Brázdil, Stefan Kiefer, Antonín Kucera. Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Volume 61, Issue 5

28 -- 0Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin. High-rate codes with sublinear-time decoding
29 -- 0Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin. Privacy amplification with asymptotically optimal entropy loss
30 -- 0Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen. Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation
31 -- 0Victor Vianu. Invited article foreword
32 -- 0Benny Kimelfeld, Christopher Ré. Transducing Markov sequences

Volume 61, Issue 4

20 -- 0Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
21 -- 0Bernard Chazelle. The Convergence of Bird Flocking
22 -- 0Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi. An Additive Combinatorics Approach Relating Rank to Communication Complexity
23 -- 0Holger Dell, Dieter van Melkebeek. Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
24 -- 0Paolo Baldan, Silvia Crafa. A Logic for True Concurrency
25 -- 0Victor Vianu. Invited Articles Foreword
26 -- 0Amir M. Ben-Amram, Samir Genaim. Ranking Functions for Linear-Constraint Loops
27 -- 0Steffen Lösch, Andrew M. Pitts. Denotational Semantics with Nominal Scott Domains

Volume 61, Issue 3

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

Volume 61, Issue 2

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

Volume 61, Issue 1

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