Journal: Journal of the ACM

Volume 66, Issue 6

0 -- 0David Monniaux, Valentin Touzeau. On the Complexity of Cache Analysis for Different Replacement Policies
0 -- 0Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer. The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3
0 -- 0Artur Jez. Deciding Context Unification
0 -- 0Vincent Despré, Francis Lazarus. Computing the Geometric Intersection Number of Curves
0 -- 0Éva Tardos. Invited Articles Foreword
0 -- 0Shahar Mendelson. An Unrestricted Learning Procedure
0 -- 0Yann Disser, Jan Hackfeld, Max Klimm. Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents

Volume 66, Issue 5

0 -- 0Christoph Lenzen, Joel Rybicki. Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
0 -- 0Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi. On the Parameterized Complexity of Approximating Dominating Set
0 -- 0David G. Harris, Aravind Srinivasan. The Moser-Tardos Framework with Partial Resampling
0 -- 0Andrei E. Romashchenko, Marius Zimand. An Operational Characterization of Mutual Information in Algorithmic Information Theory
0 -- 0Satoru Iwata 0001, Taihei Oki, Mizuyo Takamatsu. Index Reduction for Differential-algebraic Equations with Mixed Matrices
0 -- 0Aaron Bernstein, Jacob Holm, Eva Rotenberg. n) Replacements
0 -- 0Ilan Komargodski, Moni Naor, Eylon Yogev. White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing

Volume 66, Issue 4

0 -- 0Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah. On the Complexity of Hazard-free Circuits
0 -- 0Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal. Bandits and Experts in Metric Spaces
0 -- 0Anna Adamaszek, Sariel Har-Peled, Andreas Wiese. Approximation Schemes for Independent Set and Sparse Subsets of Polygons
0 -- 0Fabian R. Wirth, Sonja Stüdli, Jia Yuan Yu, Martin Corless, Robert Shorten. Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation
0 -- 0Gregorio Malajovich, Mike Shub. A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations
0 -- 0Guy Avni, Thomas A. Henzinger, Ventsislav Chonev. Infinite-duration Bidding Games
0 -- 0Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu. Hierarchical Clustering: Objective Functions and Algorithms
0 -- 0András Sebö, Anke van Zuylen. The Salesman's Improved Paths through Forests

Volume 66, Issue 3

0 -- 0Thomas Ferrère, Oded Maler, Dejan Nickovic, Amir Pnueli. From Real-time Logic to Timed Automata
0 -- 0Paul Beame, Vincent Liew. Toward Verifying Nonlinear Integer Arithmetic
0 -- 0Pierre Fraigniaud, Amos Korman, Yoav Rodeh. Parallel Bayesian Search with No Coordination
0 -- 0Daniel M. Kane, Shachar Lovett, Shay Moran. Near-optimal Linear Decision Trees for k-SUM and Related Problems
0 -- 0Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001. Uniform Sampling Through the Lovász Local Lemma
0 -- 0Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell 0001. On the Decidability of Membership in Matrix-exponential Semigroups
0 -- 0Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner 0001. Shellability is NP-complete
0 -- 0Éva Tardos. Invited Articles Foreword
0 -- 0Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy 0001. On the Computability of Conditional Probability

Volume 66, Issue 2

0 -- 0Russell Impagliazzo, Raghu Meka, David Zuckerman. Pseudorandomness from Shrinkage
0 -- 0Thomas Place, Marc Zeitoun. Going Higher in First-Order Quantifier Alternation Hierarchies on Words
0 -- 0Vera Traub, Jens Vygen. t-path TSP
0 -- 0Vincent Rahli, Mark Bickford, Liron Cohen 0001, Robert L. Constable. Bar Induction is Compatible with Constructive Type Theory
0 -- 0Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001. Exact Algorithms via Monotone Local Search
0 -- 0Mahdi Cheraghchi. Capacity Upper Bounds for Deletion-type Channels
0 -- 0Ankur Moitra. Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models

Volume 66, Issue 1

0 -- 0Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens. Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
0 -- 0Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young. Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness
0 -- 0Ken-ichi Kawarabayashi, Mikkel Thorup. Deterministic Edge Connectivity in Near-Linear Time
0 -- 0Steve Bishop, Matthew Fairbairn, Hannes Mehnert, Michael Norrish, Tom Ridge, Peter Sewell, Michael Smith 0008, Keith Wansbrough. Engineering with Logic: Rigorous Test-Oracle Specification and Validation for TCP/IP and the Sockets API
0 -- 0Peter Bürgisser, Felipe Cucker, Pierre Lairez. Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
0 -- 0Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui. The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live
0 -- 0Ran Raz. Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning