default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Wörz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Florian Wörz:
On the complexity of solving propositional formulas. University of Ulm, Germany, 2024
Journal Articles
- 2023
- [j3]Jacobo Torán
, Florian Wörz:
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas. ACM Trans. Comput. Log. 24(3): 23:1-23:25 (2023) - 2022
- [j2]Jan-Hendrik Lorenz, Florian Wörz:
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms. ACM J. Exp. Algorithmics 27: 1.14:1-1.14:38 (2022) - 2021
- [j1]Jacobo Torán, Florian Wörz:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Comput. Complex. 30(1): 7 (2021)
Conference and Workshop Papers
- 2023
- [c5]Jacobo Torán, Florian Wörz:
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. SAT 2023: 26:1-26:20 - 2022
- [c4]Jacobo Torán, Florian Wörz:
Number of Variables for Graph Differentiation and the Resolution of GI Formulas. CSL 2022: 36:1-36:18 - 2021
- [c3]Florian Wörz, Jan-Hendrik Lorenz:
Evidence for Long-Tails in SLS Algorithms. ESA 2021: 82:1-82:16 - 2020
- [c2]Jan-Hendrik Lorenz, Florian Wörz:
On the Effect of Learned Clauses on Stochastic Local Search. SAT 2020: 89-106 - [c1]Jacobo Torán, Florian Wörz:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. STACS 2020: 60:1-60:18
Parts in Books or Collections
- 2023
- [p1]Florian Wörz:
Kombinatorische Spiele als Schlüssel in der Komplexitätsanalyse aussagenlogischer Formeln. Ausgezeichnete Informatikdissertationen 2023: 331-340
Informal and Other Publications
- 2023
- [i7]Jacobo Torán, Florian Wörz:
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i6]Tom Krüger, Jan-Hendrik Lorenz, Florian Wörz:
Too much information: CDCL solvers need to forget and perform restarts. CoRR abs/2202.01030 (2022) - [i5]Jan-Hendrik Lorenz, Florian Wörz:
Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms. CoRR abs/2210.13159 (2022) - 2021
- [i4]Florian Wörz, Jan-Hendrik Lorenz:
Evidence for Long-Tails in SLS Algorithms. CoRR abs/2107.00378 (2021) - [i3]Jacobo Torán, Florian Wörz:
Number of Variables for Graph Identification and the Resolution of GI Formulas. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i2]Jan-Hendrik Lorenz, Florian Wörz:
On the Effect of Learned Clauses on Stochastic Local Search. CoRR abs/2005.04022 (2020) - 2019
- [i1]Jacobo Torán, Florian Wörz:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Electron. Colloquium Comput. Complex. TR19 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
