Perfect Dominating Sets in the Cartesian Products of Prime Cycles. - Hamed Hatami; Pooya Hatami (Electron. J. Comb., 2007)

An approximation algorithm for the total covering problem. - Pooya Hatami (Discuss. Math. Graph Theory, 2007)

On minimum vertex covers of generalized Petersen graphs. - Babak Behsaz; Pooya Hatami; Ebadollah S. Mahmoodian (Australas. J Comb., 2008)

A lower bound for the length of a partial transversal in a Latin square. - Pooya Hatami; Peter W. Shor (J. Comb. Theory A, 2008)

On the signed edge domination number of graphs. - Saeed Akbari; Sadegh Bolouki; Pooya Hatami; Milad Siami (Discret. Math., 2009)

Measure preserving homomorphisms and independent sets in tensor graph powers. - Babak Behsaz; Pooya Hatami (Discret. Math., 2009)

On minimum vertex cover of generalized Petersen graphs - Babak Behsaz; Pooya Hatami; Ebadollah S. Mahmoodian (CoRR, 2010)

An approximation algorithm for the total cover problem - Pooya Hatami (CoRR, 2010)

Variations on the Sensitivity Conjecture. - Pooya Hatami; Raghav Kulkarni; Denis Pankratov (Theory Comput., 2011)

Every locally characterized affine-invariant property is testable. - Arnab Bhattacharyya 001; Eldar Fischer; Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

An Arithmetic Analogue of Fox's Triangle Removal Argument - Pooya Hatami; Sushant Sachdeva; Madhur Tulsiani (CoRR, 2013)

Limits of Boolean Functions on 𝔽pn. - Hamed Hatami; Pooya Hatami; James Hirst (Electron. J. Comb., 2014)

General systems of linear forms: equidistribution and true complexity. - Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

Algorithmic regularity for polynomials and applications. - Arnab Bhattacharyya 001; Pooya Hatami; Madhur Tulsiani (SODA, 2015)

On the Structure of Quintic Polynomials. - Pooya Hatami (APPROX-RANDOM, 2016)

A characterization of functions with vanishing averages over products of disjoint sets. - Hamed Hatami; Pooya Hatami; Yaqiao Li (Eur. J. Comb., 2016)

Low-Sensitivity Functions from Unambiguous Certificates. - Shalev Ben-David; Pooya Hatami; Avishay Tal (ITCS, 2017)

Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. - Eshan Chattopadhyay; Pooya Hatami; Omer Reingold; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

Pseudorandom Generators for Low-Sensitivity Functions. - Pooya Hatami; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius. - Pooya Hatami; Madhur Tulsiani (SODA, 2018)

Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function. - John Chiarelli; Pooya Hatami; Michael E. Saks (CoRR, 2018)

On Multilinear Forms: Bias, Correlation, and Tensor Rank. - Abhishek Bhrushundi; Prahladh Harsha; Pooya Hatami; Swastik Kopparty; Mrinal Kumar 001 (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Generators from Polarizing Random Walks. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. - Eshan Chattopadhyay; Pooya Hatami; Shachar Lovett; Avishay Tal (Electron. Colloquium Comput. Complex., 2018)

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. - Dean Doron; Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2018)

XOR Lemmas for Resilient Functions Against Polynomials. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Log-Seed Pseudorandom Generators via Iterated Restrictions. - Dean Doron; Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2019)

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. - Yuval Filmus; Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Higher-order Fourier Analysis and Applications. - Hamed Hatami; Pooya Hatami; Shachar Lovett (Found. Trends Theor. Comput. Sci., 2019)

An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function. - John Chiarelli; Pooya Hatami; Michael E. Saks (Comb., 2020)

Fooling Constant-Depth Threshold Circuits (Extended Abstract). - Pooya Hatami; William M. Hoza; Avishay Tal; Roei Tell (FOCS, 2021)

Dimension-free Bounds and Structural Results in Communication Complexity. - Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami (Electron. Colloquium Comput. Complex., 2021)

Fooling Constant-Depth Threshold Circuits. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2021)

The Implicit Graph Conjecture is False. - Hamed Hatami; Pooya Hatami (FOCS, 2022)

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. - Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami (Discret. Appl. Math., 2022)

Lower Bound Methods for Sign-rank and their Limitations. - Hamed Hatami; Pooya Hatami; William Pires; Ran Tao 013; Rosie Zhao (Electron. Colloquium Comput. Complex., 2022)

Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

Online Learning and Disambiguations of Partial Concept Classes. - TsunMing Cheung; Hamed Hatami; Pooya Hatami; Kaave Hosseini (ICALP, 2023)

Theory of Unconditional Pseudorandom Generators. - Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2023)

No Complete Problem for Constant-Cost Randomized Communication. - Yuting Fang; Lianna Hambardzumyan; Nathaniel Harms; Pooya Hatami (Electron. Colloquium Comput. Complex., 2024)

Hilbert Functions and Low-Degree Randomness Extractors. - Alexander Golovnev; Zeyu Guo 001; Pooya Hatami; Satyajeet Nagargoje; Chao Yan (Electron. Colloquium Comput. Complex., 2024)

Structure in Communication Complexity and Constant-Cost Complexity Classes. - Hamed Hatami; Pooya Hatami (Electron. Colloquium Comput. Complex., 2024)

Paradigms for Unconditional Pseudorandom Generators. - Pooya Hatami; William Hoza (Found. Trends Theor. Comput. Sci., 2024)

Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. - Hamed Hatami; Pooya Hatami (SIGACT News, 2024)

Stability and List-Replicability for Agnostic Learners. - Ari Blondal; Shan Gao; Hamed Hatami; Pooya Hatami (COLT, 2025)

Constant-Cost Communication Is Not Reducible to k-Hamming Distance. - Yuting Fang; Mika Göös; Nathaniel Harms; Pooya Hatami (STOC, 2025)

Stability and List-Replicability for Agnostic Learners. - Ari Blonda; Shan Gao; Hamed Hatami; Pooya Hatami (CoRR, 2025)

Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces. - Ari Blondal; Hamed Hatami; Pooya Hatami; Chavdar Lalov; Sivan Tretiak (CoRR, 2025)