In: 32nd Computational Complexity Conference, CCC 2017 Leibniz International Proceedings in Informatics, LIPIcs (79) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 30:1-30:24. ISSN 1868-8969
On the polynomial parity argument complexity of the combinatorial nullstellensatz
In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 Leibniz International Proceedings in Informatics, LIPIcs (80) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 54:1-54:14. ISSN 1868-8969
In: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 18:1-18:16. ISSN 1868-8969
Fine-grained complexity of coloring unit disks and balls