default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretiCS, Volume 3
Volume 3, 2024
- Ilan Newman, Nithin Varma:
Strongly Sublinear Algorithms for Testing Pattern Freeness. - Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan:
Realizable Learning is All You Need. - Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. - Vincent Cheval, Steve Kremer, Itsaka Rakotonirina:
DeepSec: Deciding Equivalence Properties for Security Protocols - Improved theory and practice. - Dominik Scheder:
PPSZ is better than you think. - Yeshwanth Cherapanamjeri, Jelani Nelson:
Terminal Embeddings in Sublinear Time. - Costin Badescu, Ryan O'Donnell:
Improved quantum data analysis. - Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. - Jakob Piribauer
, Christel Baier:
Positivity-hardness results on Markov decision processes. - Tillmann Miltzow, Reinier F. Schmiermann:
On Classifying Continuous Constraint Satisfaction Problems. - Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. - Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. - Mikolaj Bojanczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. - Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. - Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. - León Bohn, Christof Löding:
Constructing Deterministic Parity Automata from Positive and Negative Examples. - Irit Dinur, Yuval Filmus, Prahladh Harsha:
Sparse juntas on the biased hypercube. - Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. - David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. - Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication.
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 2024-11-14 20:51 CET 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:
