Morteza Zadimoghaddam

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nitish Korula

> Home > Persons > Morteza Zadimoghaddam

Publications

2018
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KorulaMZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KorulaMZ18
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. SIAM J. Comput. 47(3): 1056-1086 (2018)
2017
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1712-05450
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1712-05450
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR abs/1712.05450 (2017)
2015
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/KorulaMZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KorulaMZ15
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. STOC 2015: 889-898
2013
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/wine/KorulaMZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wine/KorulaMZ13
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Online Matching: Maximizing Weight and Cardinality. WINE 2013: 305-318

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.