![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of the ACM, Volume 71
Volume 71, Number 1, February 2024
- Sean Ovens
:
The Space Complexity of Consensus from Swap. 1:1-1:26
- Dario Stein
, Sam Staton
:
Probabilistic Programming with Exact Conditions. 2:1-2:53
- Aïna Linn Georges
, Armaël Guéneau
, Thomas Van Strydonck
, Amin Timany
, Alix Trieu
, Dominique Devriese
, Lars Birkedal
:
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. 3:1-3:59
- Bhaskar Ray Chaudhury
, Jugal Garg
, Kurt Mehlhorn
:
EFX Exists for Three Agents. 4:1-4:27
- Paul Dütting
, Zhe Feng
, Harikrishna Narasimhan
, David C. Parkes
, Sai Srivatsa Ravindranath
:
Optimal Auctions through Deep Learning: Advances in Differentiable Economics. 5:1-5:53
Volume 71, Number 2, April 2024
- Moritz Lichter
, Pascal Schweitzer
:
Choiceless Polynomial Time with Witnessed Symmetric Choice. 7:1-7:70
- Mahmoud Abo Khamis
, Hung Q. Ngo
, Reinhard Pichler
, Dan Suciu
, Yisu Remy Wang
:
Convergence of datalog over (Pre-) Semirings. 8:1-8:55
- Yuqing Kong
:
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks. 9:1-9:49
- Vincent Cohen-Addad
, Debarati Das
, Evangelos Kipouridis
, Nikos Parotsidis
, Mikkel Thorup
:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. 10:1-10:41
- Vincent Neiger
, Bruno Salvy
, Éric Schost
, Gilles Villard
:
Faster Modular Composition. 11:1-11:79
- Shang-En Huang
, Seth Pettie
, Leqi Zhu
:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. 12:1-12:37
- Maria-Florina Balcan
, Travis Dick
, Tuomas Sandholm
, Ellen Vitercik
:
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. 13:1-13:73
- Arthur Oliveira Vale
, Zhong Shao
, Yixuan Chen
:
A Compositional Theory of Linearizability. 14:1-14:107
- Chi-Ning Chou
, Alexander Golovnev
, Madhu Sudan
, Santhoshini Velusamy
:
Sketching Approximability of All Finite CSPs. 15:1-15:74
- Javier Esparza
, Rubén Rubio
, Salomon Sickert
:
Efficient Normalization of Linear Temporal Logic. 16:1-16:42
Volume 71, Number 3, June 2024
- Michael Dinitz
, Jeremy T. Fineman
, Seth Gilbert
, Calvin Newport
:
Smoothed Analysis of Information Spreading in Dynamic Networks. 17
- Noga Ron-Zewi
, Ron Rothblum
:
Local Proofs Approaching the Witness Length. 18
- Nika Haghtalab
, Tim Roughgarden
, Abhishek Shetty
:
Smoothed Analysis with Adaptive Adversaries. 19
- Takashi Yamakawa
, Mark Zhandry
:
Verifiable Quantum Advantage without Structure. 20
- Édouard Bonnet
, Ugo Giocanti
, Patrice Ossona de Mendez
, Pierre Simon
, Stéphan Thomassé, Szymon Torunczyk
:
Twin-Width IV: Ordered Graphs and Matrices. 21
- Vishwas Bhargava
, Sumanta Ghosh
, Zeyu Guo
, Mrinal Kumar
, Chris Umans
:
Fast Multivariate Multipoint Evaluation over All Finite Fields. 22
- Itai Dinur
, Nathan Keller
, Ohad Klein
:
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. 23
- Jason M. Altschuler
, Sinho Chewi
:
Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts. 24
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.