| A lower bound for the length of a partial transversal in a Latin square P Hatami, PW Shor Journal of Combinatorial Theory, Series A 115 (7), 1103-1113, 2008 | 109 | 2008 |
| Variations on the sensitivity conjecture P Hatami, R Kulkarni, D Pankratov arXiv preprint arXiv:1011.0354, 2010 | 98 | 2010 |
| Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019 | 70 | 2019 |
| Every locally characterized affine-invariant property is testable A Bhattacharyya, E Fischer, H Hatami, P Hatami, S Lovett Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 60 | 2013 |
| Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates E Chattopadhyay, P Hatami, S Lovett, A Tal 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 22 …, 2019 | 46 | 2019 |
| Improved pseudorandomness for unordered branching programs through local monotonicity E Chattopadhyay, P Hatami, O Reingold, A Tal Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 42 | 2018 |
| Low-sensitivity functions from unambiguous certificates S Ben-David, P Hatami, A Tal arXiv preprint arXiv:1605.07084, 2016 | 38 | 2016 |
| An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function J Chiarelli, P Hatami, M Saks Combinatorica 40 (2), 237-244, 2020 | 34 | 2020 |
| On minimum vertex cover of generalized Petersen graphs B Behsaz, P Hatami, ES Mahmoodian arXiv preprint arXiv:1008.3208, 2010 | 34 | 2010 |
| Dimension-free bounds and structural results in communication complexity L Hambardzumyan, H Hatami, P Hatami | 33 | 2022 |
| The implicit graph conjecture is false H Hatami, P Hatami 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 29 | 2022 |
| Higher-order fourier analysis and applications H Hatami, P Hatami, S Lovett Foundations and Trends® in Theoretical Computer Science 13 (4), 247-448, 2019 | 26 | 2019 |
| An approximation algorithm for the total covering problem P Hatami Discussiones Mathematicae Graph Theory 27 (3), 553-558, 2007 | 26 | 2007 |
| Theory of Unconditional Pseudorandom Generators P Hatami, W Hoza Foundations and TrendsŴ in Theoretical Computer Science 16 (1-2), 1-210, 2024 | 25 | 2024 |
| General systems of linear forms: equidistribution and true complexity H Hatami, P Hatami, S Lovett Advances in Mathematics 292, 446-477, 2016 | 20 | 2016 |
| On the signed edge domination number of graphs S Akbari, S Bolouki, P Hatami, M Siami Discrete mathematics 309 (3), 587-594, 2009 | 20 | 2009 |
| Lower bound methods for sign-rank and their limitations H Hatami, P Hatami, W Pires, R Tao, R Zhao Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 19 | 2022 |
| Algorithmic regularity for polynomials and applications A Bhattacharyya, P Hatami, M Tulsiani Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 19 | 2014 |
| Log-seed pseudorandom generators via iterated restrictions D Doron, P Hatami, WM Hoza 35th Computational Complexity Conference (CCC 2020), 6: 1-6: 36, 2020 | 16 | 2020 |
| Minimum vertex covers in the generalized Petersen graphs P (n, 2) M Behzad, P Hatami, ES Mahmoodian Bulletin of the Institute of Combinatorics and its Applications 56, 98-102, 2009 | 16 | 2009 |
Hamed HatamiAssistant Professor, Department of Computer Science, McGill UniversityVerified email at cs.mcgill.ca
