default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominik Scheder
Person information
- affiliation: Shanghai Jiaotong University, China
- affiliation (former): ETH Zurich, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Dominik Scheder, John P. Steinberger:
PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. Comput. Complex. 33(2): 13 (2024)- [j7]Dominik Scheder:
PPSZ is better than you think. TheoretiCS 3 (2024) - 2022
- [j6]Yukun Cheng
, Xiaotie Deng, Dominik Scheder:
Recent studies of agent incentives in internet resource allocation and pricing. Ann. Oper. Res. 314(1): 49-76 (2022) - [i17]Dominik Scheder:
PPSZ is better than you think. CoRR abs/2207.11071 (2022) - 2021
- [c20]Dominik Scheder:
PPSZ is better than you think. FOCS 2021: 205-216 - [c19]Shibo Li, Dominik Scheder:
Impatient PPSZ - A Faster Algorithm for CSP. ISAAC 2021: 33:1-33:20 - [i16]Shibo Li, Dominik Scheder:
Impatient PPSZ - a Faster algorithm for CSP. CoRR abs/2109.02795 (2021) - [i15]Dominik Scheder:
PPSZ is better than you think. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c18]Dominik Scheder, Navid Talebanfard:
Super Strong ETH Is True for PPSZ with Small Resolution Width. CCC 2020: 3:1-3:12 - [i14]Dominik Scheder, Navid Talebanfard:
Super Strong ETH is true for strong PPSZ. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j5]Dominik Scheder:
PPSZ for k ≥ 5: More Is Better. ACM Trans. Comput. Theory 11(4): 25:1-25:22 (2019) - [c17]Dominik Scheder, Shuyang Tang, Jiaheng Zhang:
Searching for Cryptogenography Upper Bounds via Sum of Square Programming. ISAAC 2019: 31:1-31:12 - 2018
- [j4]Yukun Cheng, Xiaotie Deng, Dominik Scheder:
Recent studies of agent incentives in internet resource allocation and pricing. 4OR 16(3): 231-260 (2018) - [i13]Dominik Scheder:
PPSZ for k ≥ 5: More Is Better. Electron. Colloquium Comput. Complex. TR18 (2018) - [i12]Dominik Scheder:
PPSZ on CSP Instances with Multiple Solutions. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c16]Dominik Scheder, John P. Steinberger:
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. CCC 2017: 9:1-9:15 - [c15]Pavel Pudlák, Dominik Scheder, Navid Talebanfard:
Tighter Hard Instances for PPSZ. ICALP 2017: 85:1-85:13 - 2016
- [c14]Timon Hertli, Isabelle Hurbain, Sebastian Millius, Robin A. Moser, Dominik Scheder, May Szedlák:
The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. CP 2016: 421-437 - [r2]Dominik Scheder:
Derandomization of \(\boldsymbol{k}\) -SAT Algorithm. Encyclopedia of Algorithms 2016: 524-528 - [r1]Dominik Scheder:
Exponential Lower Bounds for k-SAT Algorithms. Encyclopedia of Algorithms 2016: 705-708 - [i11]Pavel Pudlák, Dominik Scheder, Navid Talebanfard:
Tighter Hard Instances for PPSZ. CoRR abs/1611.01291 (2016) - 2014
- [c13]Periklis A. Papakonstantinou, Dominik Scheder, Hao Song:
Overlays and Limited Memory Communication. CCC 2014: 298-308 - [c12]Joshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler:
Cryptogenography. ITCS 2014: 13-22 - 2013
- [j3]Dominik Scheder:
Inside the Simons Institute. Bull. EATCS 111 (2013) - [j2]Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo:
A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. 231: 117-124 (2013) - [c11]Dominik Scheder, Li-Yang Tan:
On the Average Sensitivity and Density of k-CNF Formulas. APPROX-RANDOM 2013: 683-698 - [c10]Dominik Scheder:
Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. ISAAC 2013: 251-261 - [c9]Dominik Scheder:
Unsatisfiable CNF Formulas contain Many Conflicts. ISAAC 2013: 273-283 - [c8]Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard:
Exponential Lower Bounds for the PPSZ k-SAT Algorithm. SODA 2013: 1253-1263 - [i10]Periklis A. Papakonstantinou, Dominik Scheder, Hao Song:
Overlays and Limited Memory Communication Mode(l)s. Electron. Colloquium Comput. Complex. TR13 (2013) - 2011
- [b1]Dominik Scheder:
Algorithms and Extremal Properties of SAT and CSP. ETH Zurich, Zürich, Switzerland, 2011 - [c7]Timon Hertli, Robin A. Moser, Dominik Scheder:
Improving PPSZ for 3-SAT using Critical Variables. STACS 2011: 237-248 - [c6]Robin A. Moser, Dominik Scheder:
A full derandomization of schöning's k-SAT algorithm. STOC 2011: 245-252 - 2010
- [c5]Dominik Scheder:
Unsatisfiable Linear CNF Formulas Are Large and Complex. STACS 2010: 621-632 - [i9]Dominik Scheder:
Using a Skewed Hamming Distance to Speed Up Deterministic Local Search. CoRR abs/1005.4874 (2010) - [i8]Konstantin Kutzkov, Dominik Scheder:
Using CSP To Improve Deterministic 3-SAT. CoRR abs/1007.1166 (2010) - [i7]Robin A. Moser, Dominik Scheder:
A Full Derandomization of Schoening's k-SAT Algorithm. CoRR abs/1008.4067 (2010) - [i6]Timon Hertli, Robin A. Moser, Dominik Scheder:
Improving PPSZ for 3-SAT using Crtitical Variables. CoRR abs/1009.4830 (2010) - [i5]Dominik Scheder:
PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems. CoRR abs/1010.5717 (2010)
2000 – 2009
- 2009
- [c4]Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl:
The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 - [i4]Dominik Scheder:
Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely. CoRR abs/0905.1587 (2009) - 2008
- [c3]Dominik Scheder:
Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN 2008: 60-71 - [c2]Dominik Scheder, Philipp Zumstein:
How Many Conflicts Does It Need to Be Unsatisfiable? SAT 2008: 246-256 - [i3]Dominik Scheder, Philipp Zumstein:
An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas. CoRR abs/0806.1148 (2008) - [i2]Dominik Scheder:
Satisfiability of Almost Disjoint CNF Formulas. CoRR abs/0807.1282 (2008) - 2007
- [j1]Claudia Käppeli, Dominik Scheder:
Partial Satisfaction of k-Satisfiable Formulas. Electron. Notes Discret. Math. 29: 497-501 (2007) - [c1]Dominik Scheder, Philipp Zumstein:
Satisfiability with Exponential Families. SAT 2007: 148-158 - [i1]Dominik Scheder:
Unsatisfiable Linear k-CNFs Exist, for every k. CoRR abs/0708.2336 (2007)
Coauthor Index
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-12-10 20:48 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:
