Ashkan Norouzi-Fard

Orcid: 0000-0002-2336-9826

According to our database1, Ashkan Norouzi-Fard authored at least 31 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Resilient k-Clustering.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Consistent Submodular Maximization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Fairness in Submodular Maximization over a Matroid Constraint.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness.
J. ACM, August, 2023

Fairness in Streaming Submodular Maximization over a Matroid Constraint.
Proceedings of the International Conference on Machine Learning, 2023

Fully Dynamic Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2023

2022
Deletion Robust Non-Monotone Submodular Maximization over Matroids.
CoRR, 2022

Near-Optimal Correlation Clustering with Privacy.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Deletion Robust Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2022

Streaming Submodular Maximization Under Matroid Constraints.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Submodular Maximization Subject to Matroid Intersection on the Fly.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Approximate Cluster Recovery from Noisy Labels.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Streaming Submodular Maximization with Matroid and Matching Constraints.
CoRR, 2021

Consistent k-Clustering for General Metrics.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Streaming Belief Propagation for Community Detection.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Parallel and Efficient Hierarchical k-Median Clustering.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fairness and Bias in Online Selection.
Proceedings of the 38th International Conference on Machine Learning, 2021

Correlation Clustering in Constant Many Parallel Rounds.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
SIAM J. Comput., 2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fully Dynamic Algorithm for Constrained Submodular Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fairness in Streaming Submodular Maximization: Algorithms and Hardness.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fast and Accurate $k$-means++ via Rejection Sampling.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2018
Algorithms For Clustering Problems - Theoretical Guarantees and Empirical Evaluations.
PhD thesis, 2018

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Dynamic Facility Location via Exponential Clocks.
ACM Trans. Algorithms, 2017

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
An Efficient Streaming Algorithm for the Submodular Cover Problem.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Towards Tight Lower Bounds for Scheduling Problems.
Proceedings of the Algorithms - ESA 2015, 2015

2014
The Minimum Vulnerability Problem.
Algorithmica, 2014

2013
A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs.
Proceedings of the 27th International Conference on Advanced Information Networking and Applications Workshops, 2013


  Loading...