D. Scheder

Available identifiers

zbMath Open scheder.dominikDBLP56/6665WikidataQ64167617 ScholiaQ64167617MaRDI QIDQ1728404

List of research outcomes

Publication	Date of Publication	Type
PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster	2024-12-27	Paper
PPSZ is better than you think	2024-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q6147535	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q5875593	2023-02-03	Paper
Recent studies of agent incentives in Internet resource allocation and pricing	2022-08-01	Paper
Super strong ETH is true for PPSZ with small resolution width	2022-07-21	Paper
Tighter hard instances for PPSZ	2020-05-27	Paper
PPSZ for general \(k\)-SAT -- making Hertli's analysis simpler and 3-SAT faster	2020-05-26	Paper
PPSZ for \(k\geq 5\): more is better	2019-12-16	Paper
Exponential lower bounds for the PPSZ \(k\)-SAT algorithm	2019-05-15	Paper
Recent studies of agent incentives in internet resource allocation and pricing	2019-02-22	Paper
Cryptogenography	2017-05-19	Paper
A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm	2014-06-05	Paper
A new bound for 3-satisfiable MaxSat and its algorithmic application	2014-01-16	Paper
Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas	2014-01-14	Paper
Unsatisfiable CNF formulas contain many conflicts	2014-01-14	Paper
On the average sensitivity and density of \(k\)-CNF formulas	2013-10-04	Paper
In Defense of Bureaucracy in the Metric Facility Location Problem	2012-02-06	Paper
Improving PPSZ for 3-SAT using critical variables	2012-01-23	Paper
Unsatisfiable linear CNF formulas are large and complex	2012-01-23	Paper
The Lovász Local Lemma and Satisfiability	2009-11-12	Paper
Satisfiability with Exponential Families	2009-03-10	Paper
Partial Satisfaction of k-Satisfiable Formulas	2008-06-05	Paper
How Many Conflicts Does It Need to Be Unsatisfiable?	2008-05-27	Paper
Guided Search and a Faster Deterministic Algorithm for 3-SAT	2008-04-15	Paper

Research outcomes over time

This page was built for person: D. Scheder