default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 72
Volume 72, Number 1, February 2025
- Arka Ghosh
, Piotr Hofman, Slawomir Lasota:
Orbit-finite Linear Programming. 1:1-1:39
- Guy Blanc:
Subsampling Suffices for Adaptive Data Analysis. 2:1-2:45
- Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. 3:1-3:50
- Donghyun Lim, Martin Ziegler:
Quantitative Coding and Complexity Theory of Continuous Data: Part I: Motivation, Definition, Consequences. 4:1-4:39
- Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation I: Directed graphs. 5:1-5:38
- Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. 6:1-6:32
- Hongyang Liu, Yitong Yin:
Parallelize Single-Site Dynamics up to Dobrushin Criterion. 7:1-7:33
- Matthieu Sozeau, Yannick Forster, Meven Lennon-Bertrand, Jakob Botsch Nielsen, Nicolas Tabareau, Théo Winterhalter:
Correct and Complete Type Checking and Certified Erasure for Coq, in Coq. 8:1-8:74
- Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes is ∃ℝ-complete. 9:1-9:26
- Oded Regev:
An Efficient Quantum Factoring Algorithm. 10:1-10:13
Volume 72, Number 2, April 2025
- Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. 11:1-11:51
- Jason M. Altschuler, Pablo A. Parrilo:
Acceleration by Stepsize Hedging: Multi-Step Descent and the Silver Stepsize Schedule. 12:1-12:38
- Elette Boyle, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. 13:1-13:43
- Oren Mangoubi, Nisheeth K. Vishnoi:
Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations. 14:1-14:88
- Noga Ron-Zewi, Ron Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. 15:1-15:54
- Vera Traub, Rico Zenklusen:
Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. 16:1-16:40 - Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. 17:1-17:27
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-17 00:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
