Stefan Schneider
Stefan Schneider
Verified email at eng.ucsd.edu
Title
Cited by
Cited by
Year
Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility
ML Carmosino, J Gao, R Impagliazzo, I Mihajlin, R Paturi, S Schneider
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
992016
A satisfiability algorithm for sparse depth two threshold circuits
R Impagliazzo, R Paturi, S Schneider
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 479-488, 2013
512013
0-1 integer linear programming with a linear number of constraints
R Impagliazzo, S Lovett, R Paturi, S Schneider
arXiv preprint arXiv:1401.5512, 2014
402014
On the fine-grained complexity of one-dimensional dynamic programming
M Künnemann, R Paturi, S Schneider
arXiv preprint arXiv:1703.00941, 2017
382017
Fast exact k-means, k-medians and Bregman divergence clustering in 1D
A Grønlund, KG Larsen, A Mathiasen, JS Nielsen, S Schneider, M Song
arXiv preprint arXiv:1701.07204, 2017
332017
Subquadratic algorithms for succinct stable matching
D Moeller, R Paturi, S Schneider
International Computer Science Symposium in Russia, 294-308, 2016
162016
Subquadratic algorithms for succinct stable matching
D Moeller, R Paturi, S Schneider
International Computer Science Symposium in Russia, 294-308, 2016
162016
The softwarised network data zoo
M Peuster, S Schneider, H Karl
2019 15th International Conference on Network and Service Management (CNSM), 1-5, 2019
82019
A satisfiability algorithm for sparse depth-2 threshold circuits
R Impagliazzo, R Paturi, S Schneider
IEEE Symp. on Foundations of Computer Science (FOCS), 2013
62013
Satisfiability algorithms for restricted circuit classes
S Schneider
arXiv preprint arXiv:1306.4029, 2013
42013
Subquadratic algorithms for succinct stable matching
M Künnemann, D Moeller, R Paturi, S Schneider
Algorithmica 81 (7), 2991-3024, 2019
22019
Fine-grained connections between exponential and polynomial time
S Schneider
University of California, San Diego, 2017
12017
Random walk algorithms for SAT and constraint satisfaction problems
S Schneider
Eidgenössische Technische Hochschule Zürich, Department of Computer Science …, 2010
12010
The system can't perform the operation now. Try again later.
Articles 1–13