Stefan Schneider is a fifth-year PhD student advised by Ramamohan Paturi at UC San Diego. His research focus is on exact (exponential-time) algorithms for satisfiability problems and lower bounds inside P, but he is also interested in related questions such as circuit lower bounds, exact algorithms for other NP-complete problems and complexity theory in general. Before attending UCSD he earned his bachelors and masters at ETH Zürich, where he was advised by Emo Welzl.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Graduate Student.