Follow
Sepideh Mahabadi
Sepideh Mahabadi
Microsoft Research
Verified email at ttic.edu - Homepage
Title
Cited by
Cited by
Year
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
1482014
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
932013
Individual fairness for k-clustering
S Mahabadi, A Vakilian
International Conference on Machine Learning, 6586-6596, 2020
802020
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
472013
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
44*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
442014
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
342018
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
252020
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
252020
Near neighbor: Who is the fairest of them all?
S Har-Peled, S Mahabadi
Advances in Neural Information Processing Systems 32, 2019
252019
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
212019
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
202021
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
202017
Approximate nearest line search in high dimensions
S Mahabadi
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
132015
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
122018
Approximate Sparse Linear Regression
S Har-Peled, P Indyk, S Mahabadi
arXiv preprint arXiv:1609.08739, 2016
122016
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
112022
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
112020
Approximation Algorithms for Fair Range Clustering
SS Hotegni, S Mahabadi, A Vakilian
International Conference on Machine Learning, 13270-13284, 2023
102023
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
102017
The system can't perform the operation now. Try again later.
Articles 1–20