A full derandomization of Schöning's k-SAT algorithm RA Moser, D Scheder Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 95 | 2011 |
The Lovász local lemma and satisfiability H Gebauer, RA Moser, D Scheder, E Welzl Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of …, 2009 | 37 | 2009 |
Improving PPSZ for 3-SAT using critical variables T Hertli, RA Moser, D Scheder arXiv preprint arXiv:1009.4830, 2010 | 35 | 2010 |
Guided search and a faster deterministic algorithm for 3-SAT D Scheder Latin American Symposium on Theoretical Informatics, 60-71, 2008 | 26 | 2008 |
PPSZ for general k-SAT-making Hertli's analysis simpler and 3-SAT faster D Scheder, JP Steinberger 32nd Computational Complexity Conference (CCC 2017), 2017 | 20 | 2017 |
Using CSP to improve deterministic 3-SAT K Kutzkov, D Scheder arXiv preprint arXiv:1007.1166, 2010 | 20 | 2010 |
Overlays and limited memory communication P Papakonstantinou, D Scheder, H Song 2014 IEEE 29th Conference on Computational Complexity (CCC), 298-308, 2014 | 19 | 2014 |
PPSZ is better than you think D Scheder TheoretiCS 3, 2024 | 17 | 2024 |
A new bound for 3-satisfiable MaxSat and its algorithmic application G Gutin, M Jones, D Scheder, A Yeo Information and Computation 231, 117-124, 2013 | 14 | 2013 |
Tighter hard instances for PPSZ P Pudlák, D Scheder, N Talebanfard arXiv preprint arXiv:1611.01291, 2016 | 13 | 2016 |
Exponential Lower Bounds for the PPSZ k-SAT Algorithm S Chen, D Scheder, N Talebanfard, B Tang Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 13 | 2013 |
Super strong ETH is true for PPSZ with small resolution width D Scheder, N Talebanfard 35th Computational Complexity Conference (CCC 2020) 169, 3, 2020 | 11 | 2020 |
How many conflicts does it need to be unsatisfiable? D Scheder, P Zumstein Theory and Applications of Satisfiability Testing–SAT 2008: 11th …, 2008 | 11 | 2008 |
Cryptogenography J Brody, SK Jakobsen, D Scheder, P Winkler Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 10 | 2014 |
Unsatisfiable linear CNF formulas are large and complex D Scheder arXiv preprint arXiv:0905.1587, 2009 | 10 | 2009 |
The PPSZ algorithm for constraint satisfaction problems on more than two colors T Hertli, I Hurbain, S Millius, RA Moser, D Scheder, M Szedlák International Conference on Principles and Practice of Constraint …, 2016 | 9 | 2016 |
Recent studies of agent incentives in internet resource allocation and pricing Y Cheng, X Deng, D Scheder 4OR 16, 231-260, 2018 | 8 | 2018 |
On the Average Sensitivity and Density of k-CNF Formulas D Scheder, LY Tan International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 8 | 2013 |
Unsatisfiable linear k-CNFs exist, for every k D Scheder arXiv preprint arXiv:0708.2336, 2007 | 6 | 2007 |
Partial satisfaction of k-satisfiable formulas C Käppeli, D Scheder Electronic Notes in Discrete Mathematics 29, 497-501, 2007 | 6 | 2007 |