Pooya Hatami

Citado por

	Total	Desde 2019
Citas	720	459
Índice h	16	12
Índice i10	22	16

100

2007200820092010201120122013201420152016201720182019202020212022202320242 2 2 8 16 14 29 30 41 40 34 36 74 81 95 100 73 36

Acceso público

Ver todo

16 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Shachar LovettAssociate Professor of Computer Science, University of California San DiegoDirección de correo verificada de eng.ucsd.edu
Avishay TalUC BerkeleyDirección de correo verificada de berkeley.edu
Eshan ChattopadhyayCornell UniversityDirección de correo verificada de cornell.edu
Kaave HosseiniUniversity of RochesterDirección de correo verificada de ur.rochester.edu
William M. HozaUniversity of ChicagoDirección de correo verificada de uchicago.edu
Arnab BhattacharyyaAssociate Professor, National University of SingaporeDirección de correo verificada de nus.edu.sg
Lianna HambardzumyanPostdocDirección de correo verificada de mail.huji.ac.il
Madhur TulsianiTTI-ChicagoDirección de correo verificada de ttic.edu
Ebadollah S. MahmoodianProfessor of Mathematics, Sharif University of TechnologyDirección de correo verificada de sharif.edu
Raghav KulkarniCentre for Quantum Technologies, SingaporeDirección de correo verificada de cs.uchicago.edu
Denis PankratovConcordia UniversityDirección de correo verificada de concordia.ca
Michael SaksRutgers University-New BrunswickDirección de correo verificada de math.rutgers.edu
Babak BehsazExai BioDirección de correo verificada de exai.bio
Dean DoronBen Gurion University of the NegevDirección de correo verificada de bgu.ac.il
David ZuckermanProfessor of Computer Science, University of Texas at AustinDirección de correo verificada de cs.utexas.edu
Omer ReingoldStanford UniversityDirección de correo verificada de stanford.edu
Roei TellUniversity of TorontoDirección de correo verificada de cs.toronto.edu
Shalev Ben-DavidAssociate Professor, University of WaterlooDirección de correo verificada de uwaterloo.ca
Milad SiamiAssistant Professor of ECE, Northeastern UniversityDirección de correo verificada de northeastern.edu
Sadegh BoloukiPolytechnique MontréalDirección de correo verificada de polymtl.ca

Seguir

Pooya Hatami

The Ohio State University

Dirección de correo verificada de osu.edu - Página principal

Theoretical Computer Science


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	97	2008
Variations on the sensitivity conjecture P Hatami, R Kulkarni, D Pankratov arXiv preprint arXiv:1011.0354, 2010	91	2010
Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019	56	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	54	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	39	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	35	2018
Low-sensitivity functions from unambiguous certificates S Ben-David, P Hatami, A Tal arXiv preprint arXiv:1605.07084, 2016	30	2016
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	25	2007
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	24	2020
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	18	2009
The implicit graph conjecture is false H Hatami, P Hatami 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	17	2022
General systems of linear forms: equidistribution and true complexity H Hatami, P Hatami, S Lovett Advances in Mathematics 292, 446-477, 2016	17	2016
Dimension-free bounds and structural results in communication complexity L Hambardzumyan, H Hatami, P Hatami	16	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	16	2019
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	11	2022
Fooling constant-depth threshold circuits P Hatami, WM Hoza, A Tal, R Tell 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	11	2022

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores