Stefan Schneider

According to our database, Stefan Schneider authored at least 8 papers between 2012 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Subquadratic Algorithms for Succinct Stable Matching.

Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider

Algorithmica, 2019

2017

Fine-Grained Connections Between Exponential and Polynomial Time.

Stefan Schneider

PhD thesis, 2017

On the Fine-Grained Complexity of One-Dimensional Dynamic Programming.

Marvin Künnemann, Ramamohan Paturi, Stefan Schneider

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Subquadratic Algorithms for Succinct Stable Matching.

Daniel Moeller, Ramamohan Paturi, Stefan Schneider

Proceedings of the Computer Science - Theory and Applications, 2016

2015

Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility.

Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider

Electron. Colloquium Comput. Complex., 2015

2014

0-1 Integer Linear Programming with a Linear Number of Constraints.

Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider

Electron. Colloquium Comput. Complex., 2014

2013

A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits.

Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits

Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider

CoRR, 2012