Dominik Scheder

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 19

Top Topics

Resource Allocation

Constraint Satisfaction

Tree Decompositions

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Publications

Dominik Scheder
PPSZ is better than you think. TheoretiCS 3 (2024)
Dominik Scheder
PPSZ is better than you think. CoRR (2022)
Dominik Scheder
PPSZ is better than you think. FOCS (2022)
Yukun Cheng, Xiaotie Deng, Dominik Scheder
Recent studies of agent incentives in internet resource allocation and pricing. Ann. Oper. Res. 314 (1) (2022)
Shibo Li, Dominik Scheder
Impatient PPSZ - A Faster Algorithm for CSP. ISAAC (2021)
Dominik Scheder
PPSZ is better than you think. FOCS (2021)
Dominik Scheder
PPSZ is better than you think. Electron. Colloquium Comput. Complex. 28 (2021)
Shibo Li, Dominik Scheder
Impatient PPSZ - a Faster algorithm for CSP. CoRR (2021)
Dominik Scheder, Navid Talebanfard
Super Strong ETH is true for strong PPSZ. Electron. Colloquium Comput. Complex. 27 (2020)
Dominik Scheder, Navid Talebanfard
Super Strong ETH Is True for PPSZ with Small Resolution Width. Computational Complexity Conference (2020)
Dominik Scheder
≥ 5: More Is Better. ACM Trans. Comput. Theory 11 (4) (2019)
Dominik Scheder, Shuyang Tang, Jiaheng Zhang
Searching for Cryptogenography Upper Bounds via Sum of Square Programming. ISAAC (2019)
Dominik Scheder
PPSZ on CSP Instances with Multiple Solutions. Electron. Colloquium Comput. Complex. 25 (2018)
Yukun Cheng, Xiaotie Deng, Dominik Scheder
Recent studies of agent incentives in internet resource allocation and pricing. 4OR 16 (3) (2018)
Dominik Scheder
PPSZ for k ≥ 5: More Is Better. Electron. Colloquium Comput. Complex. 25 (2018)
Dominik Scheder, John P. Steinberger
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. Computational Complexity Conference (2017)
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
Tighter Hard Instances for PPSZ. ICALP (2017)
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)
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
Tighter Hard Instances for PPSZ. CoRR (2016)
Joshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler
Cryptogenography. ITCS (2014)
Periklis A. Papakonstantinou, Dominik Scheder, Hao Song
Overlays and Limited Memory Communication. Computational Complexity Conference (2014)
Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard
-SAT Algorithm. SODA (2013)
Periklis A. Papakonstantinou, Dominik Scheder, Hao Song
Overlays and Limited Memory Communication Mode(l)s. Electron. Colloquium Comput. Complex. 20 (2013)
Dominik Scheder
Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. ISAAC (2013)
Dominik Scheder
Inside the Simons Institute. Bull. EATCS 111 (2013)
Dominik Scheder, Li-Yang Tan
On the Average Sensitivity and Density of k-CNF Formulas. APPROX-RANDOM (2013)
Dominik Scheder
Unsatisfiable CNF Formulas contain Many Conflicts. ISAAC (2013)
Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo
A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. 231 (2013)
Timon Hertli, Robin A. Moser, Dominik Scheder
Improving PPSZ for 3-SAT using Critical Variables. STACS (2011)
Robin A. Moser, Dominik Scheder
A full derandomization of schöning's k-SAT algorithm. STOC (2011)
Robin A. Moser, Dominik Scheder
A Full Derandomization of Schoening's k-SAT Algorithm CoRR (2010)
Dominik Scheder
Unsatisfiable Linear CNF Formulas Are Large and Complex. STACS (2010)
Konstantin Kutzkov, Dominik Scheder
Using CSP To Improve Deterministic 3-SAT CoRR (2010)
Dominik Scheder
Using a Skewed Hamming Distance to Speed Up Deterministic Local Search CoRR (2010)
Dominik Scheder
PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems CoRR (2010)
Timon Hertli, Robin A. Moser, Dominik Scheder
Improving PPSZ for 3-SAT using Crtitical Variables CoRR (2010)
Dominik Scheder
Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely CoRR (2009)
Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
The Lovász Local Lemma and Satisfiability. Efficient Algorithms (2009)
Dominik Scheder, Philipp Zumstein
How Many Conflicts Does It Need to Be Unsatisfiable? SAT (2008)
Dominik Scheder
Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN (2008)
Dominik Scheder
Satisfiability of Almost Disjoint CNF Formulas CoRR (2008)
Dominik Scheder, Philipp Zumstein
An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas CoRR (2008)
Claudia Käppeli, Dominik Scheder
Partial Satisfaction of k-Satisfiable Formulas. Electron. Notes Discret. Math. 29 (2007)
Dominik Scheder, Philipp Zumstein
Satisfiability with Exponential Families. SAT (2007)
Dominik Scheder
Unsatisfiable Linear k-CNFs Exist, for every k CoRR (2007)