| On the effect of learned clauses on stochastic local search JH Lorenz, F Wörz Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 9 | 2020 |
| Evidence for Long-Tails in SLS Algorithms F Wörz, JH Lorenz arXiv preprint arXiv:2107.00378, 2021 | 5 | 2021 |
| Too much information: Why CDCL solvers need to forget learned clauses T Krüger, JH Lorenz, F Wörz PloS one 17 (8), e0272967, 2022 | 4 | 2022 |
| Reversible pebble games and the relation between tree-like and general resolution space J Torán, F Wörz computational complexity 30 (1), 7, 2021 | 4 | 2021 |
| Number of Variables for Graph Differentiation and the Resolution of GI Formulas J Torán, F Wörz 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), 2022 | 3 | 2022 |
| Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas J Torán, F Wörz ACM Transactions on Computational Logic 24 (3), 1-25, 2023 | 2 | 2023 |
| Toward an Understanding of Long-tailed Runtimes of SLS Algorithms JH Lorenz, F Wörz ACM Journal of Experimental Algorithmics 27, 1-38, 2022 | 1 | 2022 |
| Number of Variables for Graph Identification and the Resolution of GI Formulas. J Torán, F Wörz Electron. Colloquium Comput. Complex. 28, 97, 2021 | 1 | 2021 |
| On the complexity of solving propositional formulas F Wörz Universität Ulm, 2024 | | 2024 |
| Cutting Planes Width and the Complexity of Graph Isomorphism Refutations J Torán, F Wörz 26th International Conference on Theory and Applications of Satisfiability …, 2023 | | 2023 |
| Too much information: CDCL solvers need to forget and perform restarts T Krüger, JH Lorenz, F Wörz arXiv e-prints, arXiv: 2202.01030, 2022 | | 2022 |
| Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space J Torán, F Wörz computational complexity 30, 1-37, 2021 | | 2021 |
| Zeit-Platz Tradeoffs im Beweissystem der Resolution F Wörz | | 2018 |
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
