Stefan Schneider

12 papers A* 2A 1Misc 1Journal 7
YearRankTypeTitle / Venue / Authors
2019 J jnl
Subquadratic Algorithms for Succinct Stable Matching.
Algorithmica
Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider
2017 — —
Fine-Grained Connections Between Exponential and Polynomial Time.
Stefan Schneider
2017 A* conf
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming.
ICALP
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
2017 J jnl
On the Fine-grained Complexity of One-Dimensional Dynamic Programming.
CoRR
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
2016 A conf
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility.
ITCS
Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider
2016 Misc conf
Subquadratic Algorithms for Succinct Stable Matching.
CSR
Daniel Moeller, Ramamohan Paturi, Stefan Schneider
2015 J jnl
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider
2015 J jnl
Subquadratic Algorithms for Succinct Stable Matching.
CoRR
Daniel Moeller, Ramamohan Paturi, Stefan Schneider
2014 J jnl
0-1 Integer Linear Programming with a Linear Number of Constraints.
CoRR
Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
2014 J jnl
0-1 Integer Linear Programming with a Linear Number of Constraints.
Electron. Colloquium Comput. Complex.
Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
2013 A* conf
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits.
FOCS
Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider
2012 J jnl
A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits
CoRR
Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider