Sotabase

Career

· Senior Researcher, Microsoft Research2021–
· Research Assistant Professor, Toyota Technological Institute at Chicago (TTIC)2018–2021
· Postdoctoral Research Scientist, Columbia University2017–2018
· PhD in Computer Science, MIT2011–2017
· B.S. in Computer Engineering, Sharif University of Technology2007–2011

Publications (55)

Composable core-sets for diversity and coverage maximization
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · 2014
153
cited
(Individual) Fairness for k-Clustering
International Conference on Machine Learning · 2020
94
cited
Real-time recommendation of diverse related articles
The Web Conference · 2013
79
cited
Diverse near neighbor problem
International Symposium on Computational Geometry · 2013
42
cited
Towards Tight Bounds for the Streaming Set Cover Problem
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · 2015
39
cited
On Streaming and Communication Complexity of the Set Cover Problem
International Symposium on Distributed Computing · 2014
38
cited
Nonlinear dimension reduction via outer Bi-Lipschitz extensions
Symposium on the Theory of Computing · 2018
35
cited
Non-adaptive adaptive sampling on turnstile streams
Symposium on the Theory of Computing · 2020
26
cited
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
International Conference on Machine Learning · 2019
24
cited
Approximation Algorithms for Fair Range Clustering
International Conference on Machine Learning · 2023
23
cited
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
ACM-SIAM Symposium on Discrete Algorithms · 2018
22
cited
Near Neighbor: Who is the Fairest of Them All?
Neural Information Processing Systems · 2019
22
cited
Fractional Set Cover in the Streaming Model
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2017
20
cited
Fair near neighbor search via sampling
SIGMOD record · 2021
17
cited
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?
ACM Transactions on Database Systems · 2021
17
cited
Approximate Nearest Line Search in High Dimensions
ACM-SIAM Symposium on Discrete Algorithms · 2015
16
cited
Approximate Sparse Linear Regression
International Colloquium on Automata, Languages and Programming · 2016
13
cited
Set Cover in Sub-linear Time
ACM-SIAM Symposium on Discrete Algorithms · 2018
13
cited
Core-sets for Fair and Diverse Data Summarization
Neural Information Processing Systems · 2023
9
cited
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
ACM-SIAM Symposium on Discrete Algorithms · 2015
8
cited
Sotabase
Sepideh Mahabadi | Researcher Profile | Sotabase | Sotabase