Scholar
Navid Talebanfard
Google Scholar ID: NoOc2PkAAAAJ
University of Sheffield
Citations & Impact
Citations
83
H-index
6
i10-index
3
Publications
19
Co-authors
10
list available
Publications
Resume (English only)
Academic Achievements
- 1. Manuscript: Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions (with Svyatoslav Gryaznov)
- 2. Publication: Local Enumeration: the Not-All-Equal Case, STACS 2025
- 3. Publication: Local Enumeration and Majority Lower Bounds, CCC 2024
- 4. Publication: On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube, Discrete and Computational Geometry
- 5. Publication: Linear Branching Programs and Directional Affine Extractors, CCC 2022
- 6. Publication: A Variant of the VC-Dimension with Applications to Depth-3 Circuits, ITCS 2022
- 7. Publication: A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm, Logical Methods in Computer Science, 2021
- 8. Publication: Super Strong ETH is True for PPSZ with Small Resolution Width, CCC 2020
- 9. Publication: Cops-Robber Games and the Resolution of Tseitin Formulas, ACM Transactions on Computation Theory, 2020
- 10. Publication: Prediction from Partial Information and Hindsight, An Alternative Proof, Information Processing Letters, 2018
- 11. Publication: Strong ETH and Resolution via Games and the Multiplicity of Strategies, Algorithmica, 2017
- 12. Publication: Tighter Hard Instances for PPSZ, ICALP 2017
- 13. Publication: On the Structure and the Number of Prime Implicants of 2-CNFs, Discrete Applied Mathematics, 2016
- 14. Publication: Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis, Information Processing Letters, 2016
- 15. Publication: Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth, MFCS 2014
- 16. Publication: Exponential Lower Bounds for PPSZ k-SAT Algorithm, SODA 2013
Research Experience
- 1. Lecturer for Advanced Algorithms at the University of Sheffield (Autumn 2024)
- 2. Lecturer for Automata, Computation and Complexity at the University of Sheffield (Autumn 2023)
- 3. Lecturer for Boolean Function Complexity at Charles University (Autumn 2022)
- 4. Lecturer for Randomness and computation at Charles University (Spring 2022)
- 5. Co-taught Selected topics in computational complexity: mathematical tools at Charles University (2021, with Pavel Hrubeš and Pavel Pudlák)
- 6. Co-organizer of Complexity Theory with a Human Face workshops (June 2022, October 2021, and earlier)
Background
- Research interests: combinatorics of complexity theory, satisfiability, exponential time, etc. Currently a Lecturer in Algorithms at the Department of Computer Science, University of Sheffield.
