default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Zadimoghaddam
- > Home > Persons > Morteza Zadimoghaddam
Publications
- 2024
[c60]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024- [i26]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - 2023
- [c59]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - [i25]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - 2022
- [c58]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - [i24]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. CoRR abs/2201.13128 (2022) - [i23]Paul Dütting, Federico Fusco
, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR abs/2208.07582 (2022) - 2020
- [c55]Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. ITA 2020: 1-19 - [c54]Aditya Bhaskara, Amin Karbasi, Silvio Lattanzi, Morteza Zadimoghaddam:
Online MAP Inference of Determinantal Point Processes. NeurIPS 2020 - [c53]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. NeurIPS 2020 - [c52]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS 2020 - [i21]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR abs/2006.04704 (2020) - [i20]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. CoRR abs/2006.05850 (2020) - 2019
- [c51]Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. FOCS 2019: 1596-1614 - [c49]Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi:
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. ICML 2019: 3311-3320 - [c48]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS 2019: 254-268 - [i19]Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi:
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. CoRR abs/1905.00948 (2019) - 2017
- [c37]Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Submodular Optimization Over Sliding Windows. WWW 2017: 421-430 - 2016
- [i8]Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Submodular Optimization over Sliding Windows. CoRR abs/1610.09984 (2016)
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-09-04 01:23 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:
