Pooya Hatami

Department of Computer Science
University of Chicago

E-mail: pooya at cs . uchicago . edu

I am currently a PhD student in Department of Computer Science at University of Chicago

Research Interests: Complexity Theory, and Combinatorics

Thesis

1. Masters Thesis: Testing Properties of Boolean Functions: Lower Bounds on Testing Fourier Degree, University of Chicago (2011).
   
   

Publications

1. P. Hatami, Raghav Kulkarni, Denis Pankratov, Variations on the Sensitivity Conjecture, Theory of Computing Library, Graduate Surveys Number 4 (2011) pp. 1-27
   
   
2. Saeed Akbari, Sadegh Bolouki, P. Hatami, Milad Siami, Some bounds for signed edge domination number of graphs , Discrete Mathematics. Vol. 309, Issue 3 (2009) pp. 587-594.
   
   
3. Babak Behsaz, P. Hatami, Measure preserving homomorphisms and independent sets in tensor graph powers , Discrete Mathematics. Vol. 309, Issue 4 (2009) pp. 955-958.
   
   
4. Mehdi Behzad, P. Hatami, E. S. Mahmoodian, Minimum vertex cover of generalized Petersen graphs, Bulletin of the ICA. Vol. 56 (2009) pp. 98-102.
   
   
5. P. Hatami, Peter W. Shor, A lower Bound for the length of a Partial Transversal in a Latin Square, J. Comb. Theory Ser. A, Vol. 115, Issue 7 (2008) pp. 1103-1113.
   
   
6. Hamed Hatami, P. Hatami, Perfect dominating sets in the Cartesian products of prime cycles, Electronic Journal of Combinatorics, Vol. 14,(2007) N8
   
   
7. P. Hatami, An Approximation Algorithm for the Total Covering Problem , Discussiones Mathematicae Graph Theory, Vol. 27, No.3 (2007) pp. 553-560.
   
   
8. Babak Behsaz, P. Hatami, E. S. Mahmoodian, On minimum vertex covers in generalized Petersen graphs , Australasian Journal of Combinatorics, Vol. 40 (2007) pp. 253-264.
   
   

TA

• Winter 2012: CMSC 27200: Theory of Algorithms
• Autumn 2011: CMSC 37110-1: Discrete Mathematics
• Spring 2011: CMSC 28100-1: Introduction to Complexity Theory
• Winter 2011: CMSC 27200: Theory of Algorithms
• Summer 2010: CSPP 50101: Concepts of Programming