default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTitus Dose
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[b1]Titus Dose:
Balance Problems for Integer Circuits and Separations of Relativized Conjectures on Incompleteness in Promise Classes (Balance-Probleme für Integer Circuits und Separierungen Relativierter Vermutungen über Unvollständigkeit in Promise-Klassen). Würzburg University, Germany, 2021- 2020
- [j4]Titus Dose:
An oracle separating conjectures about incompleteness in the finite domain. Theor. Comput. Sci. 809: 466-481 (2020) - [j3]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
:
Emptiness problems for integer circuits. Theor. Comput. Sci. 824-825: 11-35 (2020) - [j2]Titus Dose:
Further oracles separating conjectures about incompleteness in the finite domain. Theor. Comput. Sci. 847: 76-94 (2020) - [c5]Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. STACS 2020: 9:1-9:18
2010 – 2019
- 2019
- [j1]Titus Dose:
Balance problems for integer circuits. Theor. Comput. Sci. 799: 124-139 (2019) - [c4]Titus Dose:
P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle. MFCS 2019: 47:1-47:14 - [i7]Titus Dose:
P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle. CoRR abs/1904.06175 (2019) - [i6]Titus Dose:
P≠NP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle. CoRR abs/1909.02839 (2019) - [i5]Titus Dose:
P-Optimal Proof Systems for Each Set in coNP and no Complete Problems in NP⋂coNP Relative to an Oracle. CoRR abs/1910.08571 (2019) - [i4]Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c3]Titus Dose:
Balance Problems for Integer Circuits. MFCS 2018: 5:1-5:16 - [i3]Titus Dose:
Balance Problems for Integer Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau:
Emptiness Problems for Integer Circuits. MFCS 2017: 33:1-33:14 - [i2]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau:
Emptiness Problems for Integer Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c1]Titus Dose:
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. MFCS 2016: 32:1-32:13 - [i1]Titus Dose:
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. Electron. Colloquium Comput. Complex. TR16 (2016)
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 2025-01-21 00:00 CET 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:
