• [+]
• [–]

Journal of the ACM, Volume 65

Volume 65, Number 1, January 2018

Programming Languages, Security

• 
  Martín Abadi, Bruno Blanchet, Cédric Fournet:
  The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication. 1:1-1:41
• no results

Distributed Computing

• 
  Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
  Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. 2:1-2:44
• no results

Online Algorithms

• 
  Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
  Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. 3:1-3:33
• no results

Complexity Theory

• 
  Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
  Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. 4:1-4:41
• no results

Invited Article Foreword

• 
  Éva Tardos:
  Invited Article Foreword.
• no results

Computational Geometry

• 
  Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
  Embeddability in the 3-Sphere Is Decidable. 5:1-5:49
• no results

Volume 65, Number 2, March 2018

Social Choice

• 
  Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist:
  Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. 6:1-6:28
• no results

Randomized Algorithms & Probabilistic Analysis

• 
  Michael Molloy:
  The Freezing Threshold for k-Colourings of a Random Graph. 7:1-7:62
• no results

Social Choice, Fair Division

• 
  David Kurokawa, Ariel D. Procaccia, Junxing Wang:
  Fair Enough: Guaranteeing Approximate Maximin Shares. 8:1-8:27
• no results

Database Systems & Theory

• 
  Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
  Discrete Temporal Constraint Satisfaction Problems. 9:1-9:41
• 
  Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
  Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. 10:1-10:44
• no results

Invited Article Foreword

• 
  Éva Tardos:
  Invited Article Foreword. 11e:1
• no results

Distributed Computing

• 
  Andrea Cerone, Alexey Gotsman:
  Analysing Snapshot Isolation. 11:1-11:41
• no results

Volume 65, Number 3, March 2018

Graph Algorithms

• 
  Marek Cygan, Stefan Kratsch, Jesper Nederlof:
  Fast Hamiltonicity Checking Via Bases of Perfect Matchings. 12:1-12:46
• no results

Online Algorithms

• 
  Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
  Bandits with Knapsacks. 13:1-13:55
• no results

Cryptography

• 
  Itay Berman, Iftach Haitner, Aris Tentes:
  Coin Flipping of Any Constant Bias Implies One-Way Functions. 14:1-14:95
• no results

Approximation Algorithms

• 
  T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang:
  Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. 15:1-15:48
• no results

Invited Article Foreword

• 
  Éva Tardos:
  Invited Article Foreword.
• no results

Database Systems and Theory

• 
  Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
  Worst-case Optimal Join Algorithms. 16:1-16:40
• no results

Volume 65, Number 4, August 2018

Distributed Computing

• 
  Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi:
  Rumor Spreading and Conductance. 17:1-17:21
• no results

Cryptography

• 
  Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
  Path ORAM: An Extremely Simple Oblivious RAM Protocol. 18:1-18:26
• no results

Distributed Computing

• 
  David G. Harris, Johannes Schneider, Hsin-Hao Su:
  Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. 19:1-19:21
• no results

Cryptography, Coding Theory

• 
  Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
  Non-Malleable Codes. 20:1-20:32
• no results

Automata Theory

• 
  Helmut Seidl, Sebastian Maneth, Gregor Kemper:
  Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. 21:1-21:30
• no results

Complexity Theory

• 
  Allan Grønlund, Seth Pettie:
  Threesomes, Degenerates, and Love Triangles. 22:1-22:25
• no results

Programming Languages

• 
  Thomas Ehrhard, Michele Pagani, Christine Tasson:
  Full Abstraction for Probabilistic PCF. 23:1-23:44
• no results

Algorithms

• 
  Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt:
  Optimal Multi-Way Number Partitioning. 24:1-24:61
• no results

Invited Paper Foreword

• 
  Éva Tardos:
  Invited Article Foreword. 25:1-25:61
• no results

Databases

• 
  Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
  Minimization of Tree Patterns. 26:1-26:46
• no results

Volume 65, Number 5, September 2018

Complexity

• 
  Virginia Vassilevska Williams, R. Ryan Williams:
  Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 27:1-27:38
• no results

Query Languages

• 
  Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
  Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. 28:1-28:51
• no results

Artificial Intelligence

• 
  James P. Delgrande, Pavlos Peppas, Stefan Woltran:
  General Belief Revision. 29:1-29:34
• no results

Programming Languages, Verification

• 
  Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
  Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. 30:1-30:68
• no results

Distributed Computing

• 
  Haifeng Yu, Yuda Zhao, Irvan Jahja:
  The Cost of Unknown Diameter in Dynamic Networks. 31:1-31:34
• no results

Algebraic Complexity

• 
  Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
  On Algebraic Branching Programs of Small Width. 32:1-32:29
• no results

Descriptive Complexity

• 
  Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
  Reachability Is in DynFO. 33:1-33:24
• no results

Parametrized Complexity Theory

• 
  Bingkai Lin:
  The Parameterized Complexity of the k-Biclique Problem. 34:1-34:23
• no results

Volume 65, Number 6, November 2018

Economic and Computation

• 
  Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg:
  Matroid Secretary Problems. 35:1-35:26
• no results

Dynamic Graph Algorithms

• 
  Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
  Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. 36:1-36:40
• no results

Proof Complexitiy

• 
  Joshua A. Grochow, Toniann Pitassi:
  Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. 37:1-37:59
• no results

Distributed Computing

• 
  James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
  Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. 38:1-38:2
• no results

Cryptography

• 
  Nir Bitansky, Vinod Vaikuntanathan:
  Indistinguishability Obfuscation from Functional Encryption. 39:1-39:37
• no results

Property Testing

• 
  Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
  Settling the Query Complexity of Non-adaptive Junta Testing. 40:1-40:18
• no results

Parallel Computing

• 
  Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang:
  Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation). 41:1-41:24
• no results

Optimization

• 
  Konstantin Makarychev, Maxim Sviridenko:
  Solving Optimization Problems with Diseconomies of Scale via Decoupling. 42:1-42:27
• no results

Parallel Algorithms

• 
  Stephan Friedrichs, Christoph Lenzen:
  Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. 43:1-43:55
• no results

Invited Article Foreword

• 
  Éva Tardos:
  Invited Article Foreword. 44:1
• no results

Distributed Algorithms

• 
  Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
  Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. 45:1-45:42
• no results