Ashkan Norouzi-Fard

According to our database, Ashkan Norouzi-Fard authored at least 29 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness.

Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen

J. ACM, August, 2023

Fairness in Submodular Maximization over a Matroid Constraint.

Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong

CoRR, 2023

Fairness in Streaming Submodular Maximization over a Matroid Constraint.

Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski

Proceedings of the International Conference on Machine Learning, 2023

Fully Dynamic Submodular Maximization over Matroids.

Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam

Proceedings of the International Conference on Machine Learning, 2023

2022

Deletion Robust Non-Monotone Submodular Maximization over Matroids.

Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam

CoRR, 2022

Near-Optimal Correlation Clustering with Privacy.

Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski

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.

Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam

Proceedings of the International Conference on Machine Learning, 2022

Streaming Submodular Maximization Under Matroid Constraints.

Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Submodular Maximization Subject to Matroid Intersection on the Fly.

Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Approximate Cluster Recovery from Noisy Labels.

Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Streaming Submodular Maximization with Matroid and Matching Constraints.

Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen

CoRR, 2021

Consistent k-Clustering for General Metrics.

Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Streaming Belief Propagation for Community Detection.

Yuchen Wu, Jakab Tardos, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard

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.

Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson

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.

José Correa, Andrés Cristi, Paul Duetting, Ashkan Norouzi-Fard

Proceedings of the 38th International Conference on Machine Learning, 2021

Correlation Clustering in Constant Many Parallel Rounds.

Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.

Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward

SIAM J. Comput., 2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples.

Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fully Dynamic Algorithm for Constrained Submodular Optimization.

Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam

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.

Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski

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.

Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson

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.

Ashkan Norouzi-Fard

PhD thesis, 2018

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.

Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Dynamic Facility Location via Exponential Clocks.

Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson

ACM Trans. Algorithms, 2017

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach.

Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher

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.

Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, Volkan Cevher

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.

Abbas Bazzi, Ashkan Norouzi-Fard

Proceedings of the Algorithms - ESA 2015, 2015

2014

The Minimum Vulnerability Problem.

Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh

Algorithmica, 2014

2013

A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs.

Mohammed Gharib, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Ali Movaghar

Proceedings of the 27th International Conference on Advanced Information Networking and Applications Workshops, 2013