A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits - Russell Impagliazzo; Ramamohan Paturi; Stefan Schneider 003 (CoRR, 2012)

A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. - Russell Impagliazzo; Ramamohan Paturi; Stefan Schneider 003 (FOCS, 2013)

0-1 Integer Linear Programming with a Linear Number of Constraints. - Russell Impagliazzo; Shachar Lovett; Ramamohan Paturi; Stefan Schneider 003 (Electron. Colloquium Comput. Complex., 2014)

Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. - Marco Carmosino; Jiawei Gao 001; Russell Impagliazzo; Ivan Mihajlin; Ramamohan Paturi; Stefan Schneider 003 (Electron. Colloquium Comput. Complex., 2015)

Subquadratic Algorithms for Succinct Stable Matching. - Daniel Moeller; Ramamohan Paturi; Stefan Schneider 003 (CSR, 2016)

On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. - Marvin Künnemann; Ramamohan Paturi; Stefan Schneider 003 (ICALP, 2017)

Fine-Grained Connections Between Exponential and Polynomial Time. - Stefan Schneider 003 (2017)

Subquadratic Algorithms for Succinct Stable Matching. - Marvin Künnemann; Daniel Moeller; Ramamohan Paturi; Stefan Schneider 003 (Algorithmica, 2019)