default search action
Pooya Hatami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Pooya Hatami, William Hoza:
Paradigms for Unconditional Pseudorandom Generators. Found. Trends Theor. Comput. Sci. 16(1-2): 1-210 (2024) - [j14]Hamed Hatami, Pooya Hatami:
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. SIGACT News 55(1): 67-93 (2024) - [c21]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. APPROX/RANDOM 2024: 41:1-41:24 - [c20]Yuting Fang
, Lianna Hambardzumyan
No Complete Problem for Constant-Cost Randomized Communication. STOC 2024: 1287-1298 - [i36]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR abs/2401.14623 (2024) - [i35]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. CoRR abs/2404.00812 (2024) - [i34]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. CoRR abs/2405.10277 (2024) - [i33]Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami:
Constant-Cost Communication is not Reducible to k-Hamming Distance. CoRR abs/2407.20204 (2024) - [i32]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. Electron. Colloquium Comput. Complex. TR24 (2024) - [i31]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. Electron. Colloquium Comput. Complex. TR24 (2024) - [i30]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c19]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
Online Learning and Disambiguations of Partial Concept Classes. ICALP 2023: 42:1-42:13 - [c18]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. STOC 2023: 895-904 - [i29]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. CoRR abs/2303.17578 (2023) - [i28]Pooya Hatami, William Hoza:
Theory of Unconditional Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j13]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. 322: 117-122 (2022) - [c17]Hamed Hatami, Pooya Hatami
Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM 2022: 22:1-22:24 - [c16]Hamed Hatami, Pooya Hatami
The Implicit Graph Conjecture is False. FOCS 2022: 1134-1137 - [i27]Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. TR22 (2022) - [i26]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c15]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS 2021: 104-115 - [i25]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR abs/2111.10436 (2021) - [i24]Hamed Hatami, Pooya Hatami:
The Implicit Graph Conjecture is False. CoRR abs/2111.13198 (2021) - [i23]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i22]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j12]John Chiarelli, Pooya Hatami, Michael E. Saks:
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function. Comb. 40(2): 237-244 (2020) - [c14]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM 2020: 29:1-29:23 - [c13]Dean Doron
Log-Seed Pseudorandom Generators via Iterated Restrictions. CCC 2020: 6:1-6:36 - [c12]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
XOR lemmas for resilient functions against polynomials. STOC 2020: 234-246
2010 – 2019
- 2019
- [j11]Hamed Hatami, Pooya Hatami
Higher-order Fourier Analysis and Applications. Found. Trends Theor. Comput. Sci. 13(4): 247-448 (2019) - [j10]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
Pseudorandom Generators from Polarizing Random Walks. Theory Comput. 15: 1-26 (2019) - [c11]Dean Doron
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. CCC 2019: 16:1-16:34 - [c10]Yuval Filmus
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP 2019: 58:1-58:13 - [c9]Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal:
Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. ITCS 2019: 22:1-22:15 - [i21]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR abs/1902.07426 (2019) - [i20]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman:
XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - [i19]Dean Doron, Pooya Hatami, William Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. Electron. Colloquium Comput. Complex. TR19 (2019) - [i18]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c8]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
Pseudorandom Generators from Polarizing Random Walks. CCC 2018: 1:1-1:21 - [c7]Pooya Hatami, Avishay Tal:
Pseudorandom Generators for Low Sensitivity Functions. ITCS 2018: 29:1-29:13 - [c6]Pooya Hatami, Madhur Tulsiani:
Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius. SODA 2018: 663-679 - [c5]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved pseudorandomness for unordered branching programs through local monotonicity. STOC 2018: 363-375 - [i17]John Chiarelli, Pooya Hatami, Michael E. Saks:
Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function. CoRR abs/1801.08564 (2018) - [i16]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR abs/1804.09124 (2018) - [i15]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - [i14]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. TR18 (2018) - [i13]Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal:
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. Electron. Colloquium Comput. Complex. TR18 (2018) - [i12]Dean Doron, Pooya Hatami, William Hoza:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c4]Shalev Ben-David, Pooya Hatami, Avishay Tal:
Low-Sensitivity Functions from Unambiguous Certificates. ITCS 2017: 28:1-28:23 - [i11]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i10]Pooya Hatami, Avishay Tal:
Pseudorandom Generators for Low-Sensitivity Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j9]Hamed Hatami, Pooya Hatami
A characterization of functions with vanishing averages over products of disjoint sets. Eur. J. Comb. 56: 81-93 (2016) - [c3]Pooya Hatami:
On the Structure of Quintic Polynomials. APPROX-RANDOM 2016: 33:1-33:18 - 2015
- [c2]Arnab Bhattacharyya, Pooya Hatami, Madhur Tulsiani:
Algorithmic regularity for polynomials and applications. SODA 2015: 1870-1889 - 2014
- [j8]Hamed Hatami, Pooya Hatami, James Hirst:
Limits of Boolean Functions on 𝔽pn. Electron. J. Comb. 21(4): 4 (2014) - [i9]Hamed Hatami, Pooya Hatami, Shachar Lovett:
General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c1]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami
Every locally characterized affine-invariant property is testable. STOC 2013: 429-436 - [i8]Pooya Hatami, Sushant Sachdeva, Madhur Tulsiani:
An Arithmetic Analogue of Fox's Triangle Removal Argument. CoRR abs/1304.4921 (2013) - [i7]Arnab Bhattacharyya, Pooya Hatami, Madhur Tulsiani:
Algorithmic regularity for polynomials and applications. CoRR abs/1311.5090 (2013) - 2012
- [i6]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012) - [i5]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j7]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. Theory Comput. 4: 1-27 (2011) - 2010
- [i4]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex cover of generalized Petersen graphs. CoRR abs/1008.3208 (2010) - [i3]Pooya Hatami:
An approximation algorithm for the total cover problem. CoRR abs/1008.3216 (2010) - [i2]Saeed Akbari, Sadegh Bolouki, Pooya Hatami, Milad Siami:
On The Signed Edge Domination Number of Graphs. CoRR abs/1008.3217 (2010) - [i1]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. CoRR abs/1011.0354 (2010)
2000 – 2009
- 2009
- [j6]Saeed Akbari
On the signed edge domination number of graphs. Discret. Math. 309(3): 587-594 (2009) - [j5]Babak Behsaz, Pooya Hatami:
Measure preserving homomorphisms and independent sets in tensor graph powers. Discret. Math. 309(4): 955-958 (2009) - 2008
- [j4]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex covers of generalized Petersen graphs. Australas. J Comb. 40: 253-264 (2008) - [j3]Pooya Hatami, Peter W. Shor:
A lower bound for the length of a partial transversal in a Latin square. J. Comb. Theory A 115(7): 1103-1113 (2008) - 2007
- [j2]Hamed Hatami, Pooya Hatami:
Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electron. J. Comb. 14(1) (2007) - [j1]Pooya Hatami:
An approximation algorithm for the total covering problem. Discuss. Math. Graph Theory 27(3): 553-558 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: