External Links

Journal: Journal of the ACM

Volume 70, Issue 6

0 -- 0Shalev Ben-David, Eric Blais. A New Minimax Theorem for Randomized Algorithms
0 -- 0Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar 0001, Chandra Kanta Mohapatra. Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications
0 -- 0Dimitrios Los, Thomas Sauerwald. Balanced Allocations with the Choice of Noise
0 -- 0Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001. Toward a Better Understanding of Randomized Greedy Matching
0 -- 0Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini. Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
0 -- 0Miguel Romero 0001, Marcin Wrochna, Stanislav Zivný. Pliability and Approximating Max-CSPs

Volume 70, Issue 5

0 -- 0Alexandru Baltag, Nick Bezhanishvili, David Fernández Duque. The Topological Mu-Calculus: Completeness and Decidability
0 -- 0Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf. Proximity Gaps for Reed-Solomon Codes
0 -- 0Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris 0001. Exponentially Faster Massively Parallel Maximal Matching
0 -- 0Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell 0001. On Strongest Algebraic Program Invariants
0 -- 0Jean Goubault-Larrecq, Xiaodong Jia 0002, Clément Théron. A Domain-theoretic Approach to Statistical Programming Languages
0 -- 0Christoph Berkholz, Jakob Nordström. Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
0 -- 0Greg Bodwin, Merav Parter. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
0 -- 0Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý 0001. Relative Error Streaming Quantiles
0 -- 0Yaonan Jin, Pinyan Lu. 2 Efficient

Volume 70, Issue 4

0 -- 0Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza. Co-lexicographically Ordering Automata and Regular Languages - Part I
0 -- 0Ventsislav Chonev, Joël Ouaknine, James Worrell 0001. On the Zeros of Exponential Polynomials
0 -- 0Lijie Chen 0001, Ron D. Rothblum, Roei Tell, Eylon Yogev. On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds
0 -- 0Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen. The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Volume 70, Issue 3

0 -- 0Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik. Rate-independent Computation in Continuous Chemical Reaction Networks
0 -- 0Daniel Rutschmann, Manuel Wettstein. Chains, Koch Chains, and Point Sets with Many Triangulations
0 -- 0Laurent Doyen 0001. Stochastic Games with Synchronization Objectives
0 -- 0Meena Jagadeesan, Alexander Wei 0001, Yixin Wang, Michael I. Jordan, Jacob Steinhardt. Learning Equilibria in Matching Markets with Bandit Feedback
0 -- 0Allen Liu, Ankur Moitra. Robustly Learning General Mixtures of Gaussians
0 -- 0Jason Gaitonde, Éva Tardos. The Price of Anarchy of Strategic Queuing Systems

Volume 70, Issue 2

0 -- 0Arik Rinberg, Idit Keidar. Intermediate Value Linearizability: A Quantitative Correctness Criterion
0 -- 0Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato. A Correctness and Incorrectness Program Logic
0 -- 0Peyman Afshani, Pingan Cheng. Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
0 -- 0Bruno Bauwens, Marius Zimand. Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time
0 -- 0Haitao Wang 0001. A New Algorithm for Euclidean Shortest Paths in the Plane
0 -- 0Moritz Lichter. Separating Rank Logic from Polynomial Time
0 -- 0Ivan Geffner, Joseph Y. Halpern. Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents
0 -- 0Sébastien Bubeck, Mark Sellke. A Universal Law of Robustness via Isoperimetry
0 -- 0Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen. Almost Optimal Exact Distance Oracles for Planar Graphs

Volume 70, Issue 1

0 -- 0James B. Orlin, László A. Végh. Directed Shortest Paths via Approximate Cost Balancing
0 -- 0Xavier Goaoc, Emo Welzl. Convex Hulls of Random Order Types
0 -- 0Joachim Kock. Whole-grain Petri Nets and Processes
0 -- 0John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
0 -- 0Haotian Jiang. Minimizing Convex Functions with Rational Minimizers
0 -- 0Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi. OptORAMa: Optimal Oblivious RAM
0 -- 0Manuel Bodirsky, Jakub Rydval. On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
0 -- 0Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai. On the Need for Large Quantum Depth
runs on