Pooya Hatami

Citata da

	Tutte	Dal 2019
Citazioni	819	558
Indice H	16	13
i10-index	26	20

140

105

20092010201120122013201420152016201720182019202020212022202320243 8 15 14 31 29 41 40 34 38 80 83 95 94 69 135

Accesso pubblico

Visualizza tutto

18 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Hamed HatamiAssistant Professor, Department of Computer Science, McGill UniversityEmail verificata su cs.mcgill.ca
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoEmail verificata su eng.ucsd.edu
Avishay TalUC BerkeleyEmail verificata su berkeley.edu
Eshan ChattopadhyayAssociate Professor at Cornell UniversityEmail verificata su cs.cornell.edu
William M. HozaUniversity of ChicagoEmail verificata su uchicago.edu
Kaave HosseiniUniversity of RochesterEmail verificata su ur.rochester.edu
Lianna HambardzumyanPostdocEmail verificata su mail.huji.ac.il
Arnab BhattacharyyaAssociate Professor, National University of SingaporeEmail verificata su nus.edu.sg
Madhur TulsianiTTI-ChicagoEmail verificata su ttic.edu
Dean DoronBen Gurion University of the NegevEmail verificata su bgu.ac.il
Ebadollah S. MahmoodianProfessor of Mathematics, Sharif University of TechnologyEmail verificata su sharif.edu
Raghav KulkarniCentre for Quantum Technologies, SingaporeEmail verificata su cs.uchicago.edu
Denis PankratovConcordia UniversityEmail verificata su concordia.ca
Omer ReingoldStanford UniversityEmail verificata su stanford.edu
Michael SaksRutgers University-New BrunswickEmail verificata su math.rutgers.edu
Babak BehsazExai BioEmail verificata su exai.bio
David ZuckermanProfessor of Computer Science, University of Texas at AustinEmail verificata su cs.utexas.edu
Roei TellUniversity of TorontoEmail verificata su cs.toronto.edu
Shalev Ben-DavidAssociate Professor, University of WaterlooEmail verificata su uwaterloo.ca
Milad SiamiAssistant Professor of ECE, Northeastern UniversityEmail verificata su northeastern.edu

Segui

Pooya Hatami

The Ohio State University

Email verificata su osu.edu - Home page

Theoretical Computer Science


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	101	2008
Variations on the sensitivity conjecture P Hatami, R Kulkarni, D Pankratov arXiv preprint arXiv:1011.0354, 2010	94	2010
Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019	61	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	56	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), 2018	40	2018
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	39	2018
Low-sensitivity functions from unambiguous certificates S Ben-David, P Hatami, A Tal arXiv preprint arXiv:1605.07084, 2016	35	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	29	2020
On minimum vertex cover of generalized Petersen graphs B Behsaz, P Hatami, ES Mahmoodian arXiv preprint arXiv:1008.3208, 2010	27	2010
An approximation algorithm for the total covering problem P Hatami Discussiones Mathematicae Graph Theory 27 (3), 553-558, 2007	26	2007
The implicit graph conjecture is false H Hatami, P Hatami 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	24	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	23	2019
Dimension-free bounds and structural results in communication complexity L Hambardzumyan, H Hatami, P Hatami	20	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
On the signed edge domination number of graphs S Akbari, S Bolouki, P Hatami, M Siami Discrete mathematics 309 (3), 587-594, 2009	19	2009
General systems of linear forms: equidistribution and true complexity H Hatami, P Hatami, S Lovett Advances in Mathematics 292, 446-477, 2016	18	2016
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
Perfect dominating sets in the Cartesian products of prime cycles H Hatami, P Hatami arXiv preprint math/0701018, 2006	14	2006
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity L Hambardzumyan, H Hatami, P Hatami Discrete Applied Mathematics 322, 117-122, 2022	13	2022
Log-seed pseudorandom generators via iterated restrictions D Doron, P Hatami, WM Hoza 35th Computational Complexity Conference (CCC 2020), 2020	13	2020

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori