Jan-Hendrik Lorenz

Orcid: 0000-0002-9554-4347

According to our database1, Jan-Hendrik Lorenz authored at least 13 papers between 2018 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms.
ACM J. Exp. Algorithmics, 2022

Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms.
CoRR, 2022

Too much information: CDCL solvers need to forget and perform restarts.
CoRR, 2022

2021
Restart strategies.
PhD thesis, 2021

Restart Strategies in a Continuous Setting.
Theory Comput. Syst., 2021

Statistical privacy preserving message dissemination for peer-to-peer networks.
CoRR, 2021

From Local Network Formation Game to Peer-to-Peer Protocol.
Proceedings of the ISEEIE 2021: International Symposium on Electrical, Electronics and Information Engineering, Seoul Republic of Korea, February 19, 2021

Evidence for Long-Tails in SLS Algorithms.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
On the Effect of Learned Clauses on Stochastic Local Search.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Promise Problems on Probability Distributions.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019
The Potential of Restarts for ProbSAT.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

On the Complexity of Restarting.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Runtime Distributions and Criteria for Restarts.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018


  Loading...