Shyam Narayanan

Cited by

	All	Since 2018
Citations	200	200
h-index	9	9
i10-index	7	7

2018201920202021202220231 8 21 36 75 56

Public access

View all

10 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Vahab MirrokniGoogle Fellow, VP, Google ResearchVerified email at google.com
Piotr IndykProfessor of Electrical Engineering and Computer Science, MITVerified email at mit.edu
Hossein EsfandiariSenior Research Scientist at GoogleVerified email at seas.harvard.edu
Talya EdenPostdoctoral fellow, MIT and Boston UniversityVerified email at mit.edu
Tal WagnerAmazonVerified email at mit.edu
Justin Y. ChenMITVerified email at mit.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityVerified email at csail.mit.edu
Vincent Cohen-AddadGoogle Research (former CNRS & Sorbonne Université)Verified email at lip6.fr
Jelani NelsonProfessor, EECS, University of California, BerkeleyVerified email at berkeley.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
William KuszmaulMITVerified email at mit.edu
Nicholas SchieferAnthropicVerified email at mit.edu
Samuel B. HopkinsMassachusetts Institute of TechnologyVerified email at mit.edu
Gautam KamathAssistant Professor @ University of Waterloo, Faculty Member @ Vector InstituteVerified email at uwaterloo.ca
Mahbod MajidPhD Student, Carnegie Mellon UniverityVerified email at andrew.cmu.edu
Honghao LinCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Jakub TětekUniversity of CopenhagenVerified email at di.ku.dk
Anders AamandUniversity of Copenhagen, Department of Computer Science, BARCVerified email at di.ku.dk
Gary L. MillerCarnegie Mellon UniversityVerified email at cs.cmu.edu
Mark SellkeMember, IASVerified email at ias.edu

Shyam Narayanan

PhD Student, MIT

Verified email at mit.edu - Homepage

Theoretical Computer Science Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Optimal terminal dimensionality reduction in Euclidean space S Narayanan, J Nelson Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	42	2019
Learning-based support estimation in sublinear time T Eden, P Indyk, S Narayanan, R Rubinfeld, S Silwal, T Wagner arXiv preprint arXiv:2106.08396, 2021	19	2021
Circular trace reconstruction S Narayanan, M Ren arXiv preprint arXiv:2009.01346, 2020	18	2020
Improved algorithms for population recovery from the deletion channel S Narayanan Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	16*	2021
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets V Cohen-Addad, H Esfandiari, V Mirrokni, S Narayanan Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022	15	2022
Almost tight approximation algorithms for explainable clustering H Esfandiari, V Mirrokni, S Narayanan Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022	13	2022
Tight and Robust Private Mean Estimation with Few Users S Narayanan, V Mirrokni, H Esfandiari International Conference on Machine Learning, 16383-16412, 2022	11*	2022
Robustness Implies Privacy in Statistical Estimation SB Hopkins, G Kamath, M Majid, S Narayanan arXiv preprint arXiv:2212.05015, 2022	9	2022
Functions on antipower prefix lengths of the Thue–Morse word S Narayanan Discrete Mathematics 343 (2), 111675, 2020	9	2020
Bounds on expected propagation time of probabilistic zero forcing S Narayanan, A Sun European Journal of Combinatorics 98, 103405, 2021	8	2021
Triangle and four cycle counting with predictions in graph streams JY Chen, T Eden, P Indyk, H Lin, S Narayanan, R Rubinfeld, S Silwal, ... arXiv preprint arXiv:2203.09572, 2022	7	2022
On tolerant distribution testing in the conditional sampling model S Narayanan Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	5	2021
Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds JY Chen, B Ghazi, R Kumar, P Manurangsi, S Narayanan, J Nelson, Y Xu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023	4*	2023
Exponentially improving the complexity of simulating the Weisfeiler-Lehman test with graph neural networks A Aamand, J Chen, P Indyk, S Narayanan, R Rubinfeld, N Schiefer, ... Advances in Neural Information Processing Systems 35, 27333-27346, 2022	4	2022
Private high-dimensional hypothesis testing S Narayanan Conference on Learning Theory, 3979-4027, 2022	4	2022
Stochastic and worst-case generalized sorting revisited W Kuszmaul, S Narayanan 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	3	2022
Randomized dimensionality reduction for facility location and single-linkage clustering S Narayanan, S Silwal, P Indyk, O Zamir International Conference on Machine Learning, 7948-7957, 2021	3	2021
Deterministic -Approximation Algorithms to 1-Center Clustering with Outliers S Narayanan arXiv preprint arXiv:1806.07356, 2018	3	2018
Krylov Methods are (nearly) Optimal for Low-Rank Approximation A Bakshi, S Narayanan arXiv preprint arXiv:2304.03191, 2023	1	2023
Query lower bounds for log-concave sampling S Chewi, JD Pont, J Li, C Lu, S Narayanan arXiv preprint arXiv:2304.02599, 2023	1	2023

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors