Navid Talebanfard

Address: Aabogade 34, 8200 Aarhus, Denmark
Office: Nygaard 288
E-mail: navid@cs.au.dk


I am a third year PhD student at the Center for the Theory of Interactive Computation at Aarhus University advised by Kristoffer Arnsfelt Hansen and Peter Bro Miltersen. I work on computational complexity, Boolean satisfiability and proof complexity. I got a Master's in logic at the Institute for Logic, Language and Computation at the University of Amsterdam and I wrote my thesis on Kolmogorov complexity at Centrum Wiskunde & Informatica under the supervision of Harry Buhrman. My Master's was supported by Huygens Scholarship Program.

From September to December 2013 I was visiting the Institute for Interdisciplinary Information Sciences at Tsinghua University and from January to March 2014 I was visiting Jakob Nordström at KTH Royal Institute of Technology.


Research Papers

Ilario Bonacina, and Navid Talebanfard
Improved Strong ETH Lower Bounds for Tree-like Resolution, submitted, [PDF]

Navid Talebanfard
On the Structure and the Number of Prime Implicants of 2-CNF's, submitted, [arXiv]

Kristoffer A. Hansen, Balagopal Komarath, Jayalal Sarma M. N., Sven Skyum, and Navid Talebanfard
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth, to appear in Mathematical Foundations of Computer Science (MFCS), 2014 [PDF]

Shiteng Chen, Dominik Scheder, Bangsheng Tang, and Navid Talebanfard
Exponential Lower Bounds for the PPSZ k-SAT Algorithm, Symposium on Discrete Algorithms (SODA) 2013 [PDF]


Other Writings

Navid Talebanfard
Tightening the Compression Hierarchies, University of Amsterdam, Master's thesis, 2011, [PDF]


Teaching

Combinatorial Search, Spring 2014
Combinatorial Search, Spring 2013
Combinatorial Search, Spring 2012
Operating Systems, Fall 2011