External Links

Journal: Journal of the ACM

Volume 64, Issue 6

0 -- 0Gregory Valiant, Paul Valiant. Estimating the Unseen: Improved Estimators for Entropy and Other Properties
0 -- 0Thomas Rothvoss. The Matching Polytope has Exponential Extension Complexity
0 -- 0Ya'akov (Kobi) Gal, Moshe Mash, Ariel D. Procaccia, Yair Zick. Which Is the Fairest (Rent Division) of Them All?
0 -- 0Éva Tardos. Invited Articles Foreword
0 -- 0Olivier Bournez, Daniel S. Graça, Amaury Pouly. Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
0 -- 0Paul Beame, Paraschos Koutris, Dan Suciu. Communication Steps for Parallel Query Processing

Volume 64, Issue 5

0 -- 0Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick. Parallel-Correctness and Transferability for Conjunctive Queries
0 -- 0Éva Tardos. Invited Articles Foreword
0 -- 0Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan. An Average-Case Depth Hierarchy Theorem for Boolean Circuits
0 -- 0Nathalie Bertrand 0001, Blaise Genest, Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals
0 -- 0Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs. Separations in Query Complexity Based on Pointer Functions
0 -- 0Rajeev Alur, Loris D'Antoni. Streaming Tree Transducers
0 -- 0Krishnendu Chatterjee, Yaron Velner. The Complexity of Mean-Payoff Pushdown Games
0 -- 0Shipra Agrawal, Navin Goyal. Near-Optimal Regret Bounds for Thompson Sampling

Volume 64, Issue 4

0 -- 0Aaron Potechin. Bounds on Monotone Switching Networks for Directed Connectivity
0 -- 0Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen. Optimal Induced Universal Graphs and Adjacency Labeling for Trees
0 -- 0Hubie Chen. The Tractability Frontier of Graph-Like First-Order Query Sets
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Amir Abboud, Greg Bodwin. The 4/3 Additive Spanner Exponent Is Tight
0 -- 0Yu Zheng, Louxin Zhang. Reconciliation With Nonbinary Gene Trees Revisited
0 -- 0Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction

Volume 64, Issue 3

0 -- 0Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita. Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space
0 -- 0Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala. Tight Lower Bounds on Graph Embedding Problems
0 -- 0Martin Grohe, Stephan Kreutzer, Sebastian Siebertz. Deciding First-Order Properties of Nowhere Dense Graphs
0 -- 0Reuven Bar-Yehuda, Keren Censor Hillel, Gregory Schwartzman. A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
0 -- 0Xi Chen, Dimitris Paparas, Mihalis Yannakakis. The Complexity of Non-Monotone Markets
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Jin-yi Cai, Xi Chen. Complexity of Counting CSP with Complex Weights
0 -- 0Oded Goldreich, Dana Ron. On Learning and Testing Dynamic Environments

Volume 64, Issue 2

0 -- 0Byron Cook, Heidy Khlaaf, Nir Piterman. Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
0 -- 0Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Srinivas Vempala, Ying Xiao. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
0 -- 0Benny Applebaum, Jonathan Avron, Chris Brzuska. Arithmetic Cryptography
0 -- 0Martin E. Dyer, Mark Jerrum, Haiko Müller. On the Switch Markov Chain for Perfect Matchings
0 -- 0Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf. High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
0 -- 0Margus Veanes, Nikolaj Bjørner, Lev Nachmanson, Sergey Bereg. Monadic Decomposition
0 -- 0Éva Tardos. Invited Articles Foreword
0 -- 0Leonard J. Schulman, Alistair Sinclair. Analysis of a Classical Matrix Preconditioning Algorithm

Volume 64, Issue 1

0 -- 0Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby. Amplifiers for the Moran Process
0 -- 0Ken-ichi Kawarabayashi, Mikkel Thorup. 1/5 Colors
0 -- 0Peyman Afshani, Jérémy Barbay, Timothy M. Chan. Instance-Optimal Geometric Algorithms
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov. Upward Max-Min Fairness
0 -- 0Aleksandr Karbyshev, Nikolaj Bjørner, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham. Property-Directed Inference of Universal Invariants or Proving Their Absence
0 -- 0Rowan Davies. A Temporal Logic Approach to Binding-Time Analysis
runs on