Dominik Scheder

51 papers A* 4A 10B 5Journal 27Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	PLS-Completeness of String Permutations. ESA Dominik Scheder, Johannes Tantow
2025	J	`jnl`	PLS-complete problems with lexicographic cost functions: Max- CoRR Dominik Scheder, Johannes Tantow
2025	J	`jnl`	PLS-completeness of string permutations. CoRR Dominik Scheder, Johannes Tantow
2024	J	`jnl`	PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. Comput. Complex. Dominik Scheder, John P. Steinberger
2024	J	`jnl`	PPSZ is better than you think. TheoretiCS Dominik Scheder
2022	J	`jnl`	PPSZ is better than you think. CoRR Dominik Scheder
2022	J	`jnl`	Recent studies of agent incentives in internet resource allocation and pricing. Ann. Oper. Res. Yukun Cheng, Xiaotie Deng, Dominik Scheder
2021	B	`conf`	Impatient PPSZ - A Faster Algorithm for CSP. ISAAC Shibo Li, Dominik Scheder
2021	J	`jnl`	Impatient PPSZ - a Faster algorithm for CSP. CoRR Shibo Li, Dominik Scheder
2021	A*	`conf`	PPSZ is better than you think. FOCS Dominik Scheder
2021	J	`jnl`	PPSZ is better than you think. Electron. Colloquium Comput. Complex. Dominik Scheder
2020	A	`conf`	Super Strong ETH Is True for PPSZ with Small Resolution Width. CCC Dominik Scheder, Navid Talebanfard
2020	J	`jnl`	Super Strong ETH is true for strong PPSZ. Electron. Colloquium Comput. Complex. Dominik Scheder, Navid Talebanfard
2019	J	`jnl`	PPSZ for ACM Trans. Comput. Theory Dominik Scheder
2019	B	`conf`	Searching for Cryptogenography Upper Bounds via Sum of Square Programming. ISAAC Dominik Scheder, Shuyang Tang, Jiaheng Zhang
2018	J	`jnl`	PPSZ for k ≥ 5: More Is Better. Electron. Colloquium Comput. Complex. Dominik Scheder
2018	J	`jnl`	PPSZ on CSP Instances with Multiple Solutions. Electron. Colloquium Comput. Complex. Dominik Scheder
2018	J	`jnl`	Recent studies of agent incentives in internet resource allocation and pricing. 4OR Yukun Cheng, Xiaotie Deng, Dominik Scheder
2017	A	`conf`	PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. CCC Dominik Scheder, John P. Steinberger
2017	A*	`conf`	Tighter Hard Instances for PPSZ. ICALP Pavel Pudlák, Dominik Scheder, Navid Talebanfard
2016	—	`ch.`	Derandomization of \(\boldsymbol{k}\) -SAT Algorithm. Encyclopedia of Algorithms Dominik Scheder
2016	—	`ch.`	Exponential Lower Bounds for Encyclopedia of Algorithms Dominik Scheder
2016	A	`conf`	The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. CP Timon Hertli, Isabelle Hurbain, Sebastian Millius, Robin A. Moser, Dominik Scheder, May Szedlák
2016	J	`jnl`	Tighter Hard Instances for PPSZ. CoRR Pavel Pudlák, Dominik Scheder, Navid Talebanfard
2014	A	`conf`	Cryptogenography. ITCS Joshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler
2014	A	`conf`	Overlays and Limited Memory Communication. CCC Periklis A. Papakonstantinou, Dominik Scheder, Hao Song
2013	J	`jnl`	A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo
2013	A*	`conf`	Exponential Lower Bounds for the PPSZ SODA Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard
2013	J	`jnl`	Inside the Simons Institute. Bull. EATCS Dominik Scheder
2013	—	`conf`	On the Average Sensitivity and Density of k-CNF Formulas. APPROX-RANDOM Dominik Scheder, Li-Yang Tan
2013	J	`jnl`	Overlays and Limited Memory Communication Mode(l)s. Electron. Colloquium Comput. Complex. Periklis A. Papakonstantinou, Dominik Scheder, Hao Song
2013	B	`conf`	Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. ISAAC Dominik Scheder
2013	B	`conf`	Unsatisfiable CNF Formulas contain Many Conflicts. ISAAC Dominik Scheder
2011	A*	`conf`	A full derandomization of schöning's k-SAT algorithm. STOC Robin A. Moser, Dominik Scheder
2011	—	`—`	Algorithms and Extremal Properties of SAT and CSP. Dominik Scheder
2011	A	`conf`	Improving PPSZ for 3-SAT using Critical Variables. STACS Timon Hertli, Robin A. Moser, Dominik Scheder
2010	J	`jnl`	A Full Derandomization of Schoening's k-SAT Algorithm CoRR Robin A. Moser, Dominik Scheder
2010	J	`jnl`	Improving PPSZ for 3-SAT using Crtitical Variables CoRR Timon Hertli, Robin A. Moser, Dominik Scheder
2010	J	`jnl`	PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems CoRR Dominik Scheder
2010	A	`conf`	Unsatisfiable Linear CNF Formulas Are Large and Complex. STACS Dominik Scheder
2010	J	`jnl`	Using CSP To Improve Deterministic 3-SAT CoRR Konstantin Kutzkov, Dominik Scheder
2010	J	`jnl`	Using a Skewed Hamming Distance to Speed Up Deterministic Local Search CoRR Dominik Scheder
2009	—	`conf`	The Lovász Local Lemma and Satisfiability. Efficient Algorithms Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
2009	J	`jnl`	Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely CoRR Dominik Scheder
2008	J	`jnl`	An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas CoRR Dominik Scheder, Philipp Zumstein
2008	B	`conf`	Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN Dominik Scheder
2008	A	`conf`	How Many Conflicts Does It Need to Be Unsatisfiable? SAT Dominik Scheder, Philipp Zumstein
2008	J	`jnl`	Satisfiability of Almost Disjoint CNF Formulas CoRR Dominik Scheder
2007	J	`jnl`	Partial Satisfaction of k-Satisfiable Formulas. Electron. Notes Discret. Math. Claudia Käppeli, Dominik Scheder
2007	A	`conf`	Satisfiability with Exponential Families. SAT Dominik Scheder, Philipp Zumstein
2007	J	`jnl`	Unsatisfiable Linear k-CNFs Exist, for every k CoRR Dominik Scheder