Runtime Distributions and Criteria for Restarts. - Jan-Hendrik Lorenz (SOFSEM, 2018)

On the Complexity of Restarting. - Jan-Hendrik Lorenz (CSR, 2019)

The Potential of Restarts for ProbSAT. - Jan-Hendrik Lorenz; Julian Nickerl (EUROCAST (1), 2019)

Promise Problems on Probability Distributions. - Jan-Hendrik Lorenz; Uwe Schöning (Complexity and Approximation, 2020)

On the Effect of Learned Clauses on Stochastic Local Search. - Jan-Hendrik Lorenz; Florian Wörz (SAT, 2020)

Evidence for Long-Tails in SLS Algorithms. - Florian Wörz; Jan-Hendrik Lorenz (ESA, 2021)

From Local Network Formation Game to Peer-to-Peer Protocol. - Julian Nickerl; David Mödinger; Jan-Hendrik Lorenz (ISEEIE, 2021)

Statistical privacy preserving message dissemination for peer-to-peer networks. - David Mödinger; Jan-Hendrik Lorenz; Franz J. Hauck (CoRR, 2021)

Restart Strategies in a Continuous Setting. - Jan-Hendrik Lorenz (Theory Comput. Syst., 2021)

Restart strategies. - Jan-Hendrik Lorenz (2021)

Too much information: CDCL solvers need to forget and perform restarts. - Tom Krüger; Jan-Hendrik Lorenz; Florian Wörz (CoRR, 2022)

Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms. - Jan-Hendrik Lorenz; Florian Wörz (CoRR, 2022)

Toward an Understanding of Long-tailed Runtimes of SLS Algorithms. - Jan-Hendrik Lorenz; Florian Wörz (ACM J. Exp. Algorithmics, 2022)