| Publication | Date of Publication | Type |
|---|
PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster
Computational Complexity | 2024-12-27 | Paper |
PPSZ is better than you think
TheoretiCS | 2024-07-03 | Paper |
scientific article; zbMATH DE number 7788606 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7650264 (Why is no real title available?) | 2023-02-03 | Paper |
Recent studies of agent incentives in Internet resource allocation and pricing
Annals of Operations Research | 2022-08-01 | Paper |
| Super strong ETH is true for PPSZ with small resolution width | 2022-07-21 | Paper |
Tighter hard instances for PPSZ
(available as arXiv preprint) | 2020-05-27 | Paper |
| PPSZ for general \(k\)-SAT -- making Hertli's analysis simpler and 3-SAT faster | 2020-05-26 | Paper |
PPSZ for \(k\geq 5\): more is better
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Exponential lower bounds for the PPSZ \(k\)-SAT algorithm
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Recent studies of agent incentives in internet resource allocation and pricing
4OR | 2019-02-22 | Paper |
Cryptogenography
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation | 2014-01-16 | Paper |
Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas
Algorithms and Computation | 2014-01-14 | Paper |
Unsatisfiable CNF formulas contain many conflicts
Algorithms and Computation | 2014-01-14 | Paper |
On the average sensitivity and density of \(k\)-CNF formulas
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
| In Defense of Bureaucracy in the Metric Facility Location Problem | 2012-02-06 | Paper |
| Improving PPSZ for 3-SAT using critical variables | 2012-01-23 | Paper |
Improving PPSZ for 3-SAT using critical variables
(available as arXiv preprint) | 2012-01-23 | Paper |
| Unsatisfiable linear CNF formulas are large and complex | 2012-01-23 | Paper |
The Lovász Local Lemma and Satisfiability
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Satisfiability with Exponential Families
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Partial Satisfaction of k-Satisfiable Formulas
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
How Many Conflicts Does It Need to Be Unsatisfiable?
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Guided Search and a Faster Deterministic Algorithm for 3-SAT
Lecture Notes in Computer Science | 2008-04-15 | Paper |
