![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 3,147 matches
- 2024
- Xiao Hu
, Yufei Tao
:
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation. J. ACM 71(1): 6:1-6:44 (2024) - Jason M. Altschuler, Sinho Chewi:
Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts. J. ACM 71(3): 24 (2024) - Maria-Florina Balcan
, Travis Dick
, Tuomas Sandholm
, Ellen Vitercik
:
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. J. ACM 71(2): 13:1-13:73 (2024) - Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM 71(3): 22 (2024) - Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71(3): 21 (2024) - Bhaskar Ray Chaudhury
, Jugal Garg
, Kurt Mehlhorn
:
EFX Exists for Three Agents. J. ACM 71(1): 4:1-4:27 (2024) - Chi-Ning Chou
, Alexander Golovnev
, Madhu Sudan
, Santhoshini Velusamy
:
Sketching Approximability of All Finite CSPs. J. ACM 71(2): 15:1-15:74 (2024) - Vincent Cohen-Addad
, Debarati Das
, Evangelos Kipouridis
, Nikos Parotsidis
, Mikkel Thorup
:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71(2): 10:1-10:41 (2024) - Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Information Spreading in Dynamic Networks. J. ACM 71(3): 17 (2024) - Itai Dinur, Nathan Keller, Ohad Klein:
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. J. ACM 71(3): 23 (2024) - Paul Dütting
, Zhe Feng
, Harikrishna Narasimhan
, David C. Parkes
, Sai Srivatsa Ravindranath
:
Optimal Auctions through Deep Learning: Advances in Differentiable Economics. J. ACM 71(1): 5:1-5:53 (2024) - Javier Esparza
, Rubén Rubio
, Salomon Sickert
:
Efficient Normalization of Linear Temporal Logic. J. ACM 71(2): 16:1-16:42 (2024) - 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. J. ACM 71(1): 3:1-3:59 (2024) - Nika Haghtalab, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis with Adaptive Adversaries. J. ACM 71(3): 19 (2024) - Shang-En Huang
, Seth Pettie
, Leqi Zhu
:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. J. ACM 71(2): 12:1-12:37 (2024) - Mahmoud Abo Khamis
, Hung Q. Ngo
, Reinhard Pichler
, Dan Suciu
, Yisu Remy Wang
:
Convergence of datalog over (Pre-) Semirings. J. ACM 71(2): 8:1-8:55 (2024) - Yuqing Kong
:
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks. J. ACM 71(2): 9:1-9:49 (2024) - Moritz Lichter
, Pascal Schweitzer
:
Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM 71(2): 7:1-7:70 (2024) - Vincent Neiger
, Bruno Salvy
, Éric Schost
, Gilles Villard
:
Faster Modular Composition. J. ACM 71(2): 11:1-11:79 (2024) - Sean Ovens
:
The Space Complexity of Consensus from Swap. J. ACM 71(1): 1:1-1:26 (2024) - Noga Ron-Zewi, Ron Rothblum:
Local Proofs Approaching the Witness Length. J. ACM 71(3): 18 (2024) - Dario Stein
, Sam Staton
:
Probabilistic Programming with Exact Conditions. J. ACM 71(1): 2:1-2:53 (2024) - Arthur Oliveira Vale
, Zhong Shao
, Yixuan Chen
:
A Compositional Theory of Linearizability. J. ACM 71(2): 14:1-14:107 (2024) - Takashi Yamakawa, Mark Zhandry:
Verifiable Quantum Advantage without Structure. J. ACM 71(3): 20 (2024) - 2023
- Peyman Afshani
, Pingan Cheng
:
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. J. ACM 70(2): 16:1-16:26 (2023) - Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023) - Alexandru Baltag
, Nick Bezhanishvili
, David Fernández-Duque
:
The Topological Mu-Calculus: Completeness and Decidability. J. ACM 70(5): 33:1-33:38 (2023) - Bruno Bauwens
, Marius Zimand
:
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. J. ACM 70(2): 9:1-9:33 (2023) - Soheil Behnezhad
, MohammadTaghi Hajiaghayi
, David G. Harris
:
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70(5): 34:1-34:18 (2023) - Shalev Ben-David
, Eric Blais
:
A New Minimax Theorem for Randomized Algorithms. J. ACM 70(6): 38:1-38:58 (2023)
skipping 3,117 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-08 09:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint