default search action
Ashkan Norouzi-Fard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. AISTATS 2024: 1027-1035 - [c27]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024 - [c26]Sara Ahmadian
, MohammadHossein Bateni
Resilient k-Clustering. KDD 2024: 29-38 - [i23]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - 2023
- [j4]Moran Feldman
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM 70(4): 24:1-24:52 (2023) - [c25]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - [c24]Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. ICML 2023: 9150-9171 - [i22]Marwa El Halabi, Federico Fusco
Fairness in Streaming Submodular Maximization over a Matroid Constraint. CoRR abs/2305.15118 (2023) - [i21]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - [i20]Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. CoRR abs/2312.14299 (2023) - 2022
- [c23]Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Approximate Cluster Recovery from Noisy Labels. COLT 2022: 1463-1509 - [c22]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA 2022: 52:1-52:14 - [c21]Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. ICALP 2022: 59:1-59:20 - [c20]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - [c19]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. NeurIPS 2022 - [i19]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. CoRR abs/2201.13128 (2022) - [i18]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. CoRR abs/2203.01440 (2022) - [i17]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR abs/2204.05154 (2022) - [i16]Paul Dütting, Federico Fusco
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR abs/2208.07582 (2022) - 2021
- [c18]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. ICML 2021: 2069-2078 - [c17]José Correa, Andrés Cristi, Paul Duetting, Ashkan Norouzi-Fard:
Fairness and Bias in Online Selection. ICML 2021: 2112-2121 - [c16]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler
Parallel and Efficient Hierarchical k-Median Clustering. NeurIPS 2021: 20333-20345 - [c15]Yuchen Wu, Jakab Tardos, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard:
Streaming Belief Propagation for Community Detection. NeurIPS 2021: 26976-26988 - [c14]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. SODA 2021: 2660-2678 - [i15]Yuchen Wu, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard, Jakab Tardos:
Streaming Belief Propagation for Community Detection. CoRR abs/2106.04805 (2021) - [i14]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. CoRR abs/2106.08448 (2021) - [i13]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR abs/2107.07183 (2021) - 2020
- [j3]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. SIAM J. Comput. 49(4) (2020) - [c13]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler
Fast and Accurate $k$-means++ via Rejection Sampling. NeurIPS 2020 - [c12]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. NeurIPS 2020 - [c11]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS 2020 - [c10]Michael Kapralov
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. SODA 2020: 1753-1772 - [c9]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC 2020: 1363-1374 - [i12]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR abs/2003.13459 (2020) - [i11]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR abs/2006.04704 (2020) - [i10]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. CoRR abs/2010.07431 (2020) - [i9]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. CoRR abs/2011.06888 (2020) - [i8]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Fast and Accurate k-means++ via Rejection Sampling. CoRR abs/2012.11891 (2020)
2010 – 2019
- 2019
- [i7]Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos:
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. CoRR abs/1907.05725 (2019) - 2018
- [b1]Ashkan Norouzi-Fard:
Algorithms For Clustering Problems - Theoretical Guarantees and Empirical Evaluations. EPFL, Switzerland, 2018 - [c8]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson:
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML 2018: 3826-3835 - [i6]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR abs/1808.01842 (2018) - 2017
- [j2]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. ACM Trans. Algorithms 13(2): 21:1-21:20 (2017) - [c7]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS 2017: 61-72 - [c6]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. NIPS 2017: 4557-4566 - [i5]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher:
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. CoRR abs/1711.02598 (2017) - 2016
- [c5]Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, Volkan Cevher:
An Efficient Streaming Algorithm for the Submodular Cover Problem. NIPS 2016: 4493-4501 - [i4]Ashkan Norouzi-Fard, Abbas Bazzi, Marwa El Halabi, Ilija Bogunovic, Ya-Ping Hsieh, Volkan Cevher:
An Efficient Streaming Algorithm for the Submodular Cover Problem. CoRR abs/1611.08574 (2016) - [i3]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR abs/1612.07925 (2016) - 2015
- [c4]Abbas Bazzi, Ashkan Norouzi-Fard:
Towards Tight Lower Bounds for Scheduling Problems. ESA 2015: 118-129 - [c3]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. SODA 2015: 708-721 - [i2]Abbas Bazzi, Ashkan Norouzi-Fard:
Towards Tight Lower Bounds for Scheduling Problems. CoRR abs/1507.01906 (2015) - 2014
- [j1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
The Minimum Vulnerability Problem. Algorithmica 70(4): 718-731 (2014) - [i1]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. CoRR abs/1411.4476 (2014) - 2013
- [c2]Mohammed Gharib
A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs. AINA Workshops 2013: 349-356 - 2012
- [c1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
The Minimum Vulnerability Problem. ISAAC 2012: 382-391
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: