Sepideh Mahabadi

Citado por

	Total	Desde 2019
Citas	786	599
Índice h	14	14
Índice i10	20	18

140

105

2013201420152016201720182019202020212022202320247 18 32 27 56 42 59 68 73 137 123 139

Acceso público

Ver todo

17 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Piotr IndykProfessor of Electrical Engineering and Computer Science, MITDirección de correo verificada de mit.edu
Ali VakilianToyota Technological Institute at Chicago (TTIC)Dirección de correo verificada de ttic.edu
Sariel Har-PeledProfessor of Computer Science, UIUCDirección de correo verificada de uiuc.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchDirección de correo verificada de google.com
Mohammad MahdianResearch Scientist, GoogleDirección de correo verificada de alum.mit.edu
Sofiane AbbarFacebookDirección de correo verificada de fb.com
Sihem Amer-YahiaResearch Director, CNRS, LIG, FranceDirección de correo verificada de univ-grenoble-alpes.fr
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Francesco SilvestriAssociate professor, University of PadovaDirección de correo verificada de dei.unipd.it
Martin AumüllerIT University of CopenhagenDirección de correo verificada de itu.dk
Rasmus PaghProfessor of computer science, University of CopenhagenDirección de correo verificada de di.ku.dk
Ilya RazenshteynCipherMode LabsDirección de correo verificada de mit.edu
Samson ZhouTexas A&M UniversityDirección de correo verificada de alum.mit.edu
Shayan Oveis GharanAssociate Professor, University of WashingtonDirección de correo verificada de cs.washington.edu
Alireza Rezaeiuniversity of washingtonDirección de correo verificada de uw.edu
Konstantin MakarychevNorthwestern UniversityDirección de correo verificada de northwestern.edu
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at ChicagoDirección de correo verificada de ttic.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityDirección de correo verificada de csail.mit.edu
Kasturi VaradarajanProfessor of Computer Science, University of IowaDirección de correo verificada de uiowa.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyDirección de correo verificada de mit.edu

Seguir

Sepideh Mahabadi

Microsoft Research

Dirección de correo verificada de ttic.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
Composable core-sets for diversity and coverage maximization P Indyk, S Mahabadi, M Mahdian, VS Mirrokni Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014	154	2014
Real-time recommendation of diverse related articles S Abbar, S Amer-Yahia, P Indyk, S Mahabadi Proceedings of the 22nd international conference on World Wide Web, 1-12, 2013	94	2013
Individual fairness for k-clustering S Mahabadi, A Vakilian International Conference on Machine Learning, 6586-6596, 2020	85	2020
Diverse near neighbor problem S Abbar, S Amer-Yahia, P Indyk, S Mahabadi, KR Varadarajan Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013	48	2013
Towards tight bounds for the streaming set cover problem S Har-Peled, P Indyk, S Mahabadi, A Vakilian Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016	47*	2016
On streaming and communication complexity of the set cover problem ED Demaine, P Indyk, S Mahabadi, A Vakilian Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX …, 2014	46	2014
Nonlinear dimension reduction via outer Bi-Lipschitz extensions S Mahabadi, K Makarychev, Y Makarychev, I Razenshteyn Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	38	2018
Non-adaptive adaptive sampling on turnstile streams S Mahabadi, I Razenshteyn, DP Woodruff, S Zhou Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020	26	2020
Near neighbor: Who is the fairest of them all? S Har-Peled, S Mahabadi Advances in Neural Information Processing Systems 32, 2019	26	2019
Composable core-sets for determinant maximization problems via spectral spanners P Indyk, S Mahabadi, SO Gharan, A Rezaei Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	25	2020
Fractional set cover in the streaming model P Indyk, S Mahabadi, R Rubinfeld, J Ullman, A Vakilian, A Yodpinyanee 20th International Workshop on Approximation Algorithms for Combinatorial …, 2017	23	2017
Fair near neighbor search via sampling M Aumuller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri ACM SIGMOD Record 50 (1), 42-49, 2021	22	2021
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm P Indyk, S Mahabadi, SO Gharan, A Rezaei International Conference on Machine Learning, 4254-4263, 2019	21	2019
Approximation Algorithms for Fair Range Clustering SS Hotegni, S Mahabadi, A Vakilian International Conference on Machine Learning, 13270-13284, 2023	15	2023
Set Cover in Sub-linear Time P Indyk, S Mahabadi, R Rubinfeld, A Vakilian, A Yodpinyanee Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	14	2018
Approximate nearest line search in high dimensions S Mahabadi Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015	14	2015
Sampling a Near Neighbor in High Dimensions—Who is the Fairest of Them All? M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri ACM Transactions on Database Systems (TODS) 47 (1), 1-40, 2022	13	2022
Approximate Sparse Linear Regression S Har-Peled, P Indyk, S Mahabadi arXiv preprint arXiv:1609.08739, 2016	13	2016
Towards Better Approximation of Graph Crossing Number J Chuzhoy, S Mahabadi, Z Tan 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2020	12	2020
Proximity in the age of distraction: Robust approximate nearest neighbor search S Har-Peled, S Mahabadi Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	10	2017

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