Florian Wörz

Orcid: 0000-0003-2463-8167

According to our database1, Florian Wörz authored at least 12 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of solving propositional formulas.
PhD thesis, 2024

2023
Kombinatorische Spiele als Schlüssel in der Komplexitätsanalyse aussagenlogischer Formeln.
Proceedings of the Ausgezeichnete Informatikdissertationen 2023., 2023

Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas.
ACM Trans. Comput. Log., 2023

Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.
Electron. Colloquium Comput. Complex., 2023

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

Number of Variables for Graph Differentiation and the Resolution of GI Formulas.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
Number of Variables for Graph Identification and the Resolution of GI Formulas.
Electron. Colloquium Comput. Complex., 2021

Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space.
Comput. Complex., 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


  Loading...