Items where authors include "Scheder, D."

Proceedings Paper

Scheder, D. and Talebanfard, N. (2020) Super strong ETH is true for PPSZ with small resolution width. In: Saraf, S., (ed.) 35th Computational Complexity Conference (CCC 2020). 35th Computational Complexity Conference (CCC 2020), 28-31 Jul 2020, Saarbrücken, Germany (Virtual). Leibniz International Proceedings in Informatics (LIPIcs), 169 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 3:1-3:12. ISBN 9783959771566

Pudlák, P., Scheder, D. and Talebanfard, N. (2017) Tighter hard instances for PPSZ. In: Chatzigiannakis, I., Indyk, P., Kuhn, F. and Muscholl, A., (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 10-14 Jul 2017, Warsaw, Poland. Leibniz International Proceedings in Informatics (LIPIcs), 80 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 85:1-85:13. ISBN 9783959770415