Morteza Zadimoghaddam

Computational Theory and Mathematics · 2010–2025

A researcher in the Science corpus: 4 papers; trusts 24 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 23 citations into it; #3,806 of 12,182 by trust here, #6,463 by citations
• Artificial Intelligence — 16 citations into it; #12,859 of 35,345 by trust here, #24,417 by citations
• Algorithms & Complexity — 10 citations into it; #254 of 516 by trust here, #310 by citations
• Optimization & Training — 9 citations into it
• Mathematical Optimization — 8 citations into it; #348 of 422 by trust here, #334 by citations
• Computer Graphics and Computer-Aided Design — 6 citations into it
• Computer Networks and Communications — 6 citations into it; #6,542 of 9,886 by trust here, #6,788 by citations
• Computer Vision and Pattern Recognition — 5 citations into it

Whom Morteza Zadimoghaddam trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Eric Balkanski
2. Alex Krizhevsky
3. Maxim Sviridenko
4. Ian Simon
5. Yaron Singer
6. Alina Ene
7. Baharan Mirzasoleiman
8. Jure Leskovec
9. Matthew Fahrbach
10. Uriel Feige

Who trusts Morteza Zadimoghaddam overall

1. Jesse Vig
2. Sharon Qian
3. Sebastian Gehrmann
4. Matthew Fahrbach
5. Yaron Singer

Papers from Morteza Zadimoghaddam's perspective

Ordered by how strongly the researchers Morteza Zadimoghaddam trusts endorse each paper. Same corpus, a different order for every researcher.

1. Learning Multiple Layers of Features from Tiny Images
2. Maximizing Non-Monotone Submodular Functions
3. Submodular Maximization with Cardinality Constraints
4. The adaptive complexity of maximizing a submodular function
5. The MovieLens Datasets: History and Context
6. Submodular functions and convexity
7. Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
8. Optimal marketing strategies over social networks
9. Streaming submodular maximization: massive data summarization on the fly
10. Scene Summarization for Online Image Collections (IEEE International Conference on Computer Vision)

Their papers

• Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity (2018) — 60 citations
• Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity (2018) — 70 citations
• Submodular secretary problem and extensions (2010) — 173 citations
• Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities (2025) — 3,609 citations