| Cops-robber games and the resolution of tseitin formulas N Galesi, N Talebanfard, J Torán ACM Transactions on Computation Theory (TOCT) 12 (2), 1-22, 2020 | 21 | 2020 |
| Tighter hard instances for PPSZ P Pudlák, D Scheder, N Talebanfard arXiv preprint arXiv:1611.01291, 2016 | 13 | 2016 |
| Exponential Lower Bounds for the PPSZ k-SAT Algorithm S Chen, DA Scheder, N Talebanfard, B Tang ACM-SIAM symposium on Disrete Algorithms, 1253-1263, 2013 | 13 | 2013 |
| Super strong ETH is true for PPSZ with small resolution width D Scheder, N Talebanfard 35th Computational Complexity Conference (CCC 2020) 169, 3, 2020 | 11 | 2020 |
| Prediction from partial information and hindsight, an alternative proof AV Smal, N Talebanfard Information Processing Letters 136, 102-104, 2018 | 10 | 2018 |
| Linear branching programs and directional affine extractors S Gryaznov, P Pudlák, N Talebanfard arXiv preprint arXiv:2201.10997, 2022 | 9 | 2022 |
| A variant of the VC-dimension with applications to depth-3 circuits P Frankl, S Gryaznov, N Talebanfard arXiv preprint arXiv:2111.09671, 2021 | 8 | 2021 |
| Strong ETH and Resolution via Games and the Multiplicity of Strategies I Bonacina, N Talebanfard Algorithmica 79 (1), 29-41, 2017 | 6 | 2017 |
| On the structure and the number of prime implicants of 2-CNFs N Talebanfard Discrete Applied Mathematics 200, 1-4, 2016 | 5 | 2016 |
| Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis I Bonacina, N Talebanfard Information Processing Letters 116 (2), 120-124, 2016 | 5 | 2016 |
| Circuit complexity of properties of graphs with constant planar cutwidth KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard International Symposium on Mathematical Foundations of Computer Science, 336-347, 2014 | 4 | 2014 |
| Local enumeration and majority lower bounds M Gurumukhani, R Paturi, P Pudlák, M Saks, N Talebanfard arXiv preprint arXiv:2403.09134, 2024 | 3 | 2024 |
| A separator theorem for hypergraphs and a CSP-SAT algorithm M Koucký, V Rödl, N Talebanfard Logical Methods in Computer Science 17, 2021 | 3 | 2021 |
| On the extension complexity of polytopes separating subsets of the Boolean cube P Hrubeš, N Talebanfard Discrete & Computational Geometry 70 (1), 268-278, 2023 | 2 | 2023 |
| Local Enumeration: The Not-All-Equal Case M Gurumukhani, R Paturi, M Saks, N Talebanfard arXiv preprint arXiv:2501.02886, 2025 | | 2025 |
| Bounded-Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions S Gryaznov, N Talebanfard arXiv preprint arXiv:2403.02275, 2024 | | 2024 |
| 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) DM Thilikos, V Vassilevska Williams, PA Golovach, C Requilé, F Barbero, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | | 2015 |
| Circuit Complexity Bounds using Monoid Structure for Graph Problems KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard | | 2014 |
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
