World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
56
Citations
13664
World Ranking
4045
National Ranking
1924

Research.com Recognitions

  • 2010 - Fellow of Alfred P. Sloan Foundation

Overview

Amin Saberi is affiliated with Stanford University in the United States and has published extensively in the field of Computer Science, with a focus on several specialized subfields including Computer Networks and Communications, Cognitive Neuroscience, Management Science and Operations Research, Radiology, Nuclear Medicine and Imaging, and Artificial Intelligence.

The main research topics covered by Amin Saberi include:

  • Optimization and Search Problems
  • Functional Brain Connectivity Studies
  • Auction Theory and Applications
  • Advanced Neuroimaging Techniques and Applications
  • Complexity and Algorithms in Graphs
  • Advanced Bandit Algorithms Research
  • Neural dynamics and brain function

Amin Saberi's recent papers demonstrate a range of interdisciplinary interests bridging computational methods and neuroscience as well as clinical research:

  • The Accuracy of Visceral Adiposity Index for the Screening of Metabolic Syndrome: A Systematic Review and Meta-Analysis (2021), published in International Journal of Endocrinology
  • Evaluation of curcumin as add-on therapy in patients with Parkinson's disease: A pilot randomized, triple-blind, placebo-controlled trial (2022), published in Clinical Neurology and Neurosurgery
  • ENIGMA-Sleep: Challenges, opportunities, and the road map (2021), published in Journal of Sleep Research
  • Convergent regional brain abnormalities in behavioral variant frontotemporal dementia: A neuroimaging meta-analysis of 73 studies (2022), published in Alzheimer's & Dementia Diagnosis Assessment & Disease Monitoring
  • Structural and functional neuroimaging of late-life depression: a coordinate-based meta-analysis (2021), published in Brain Imaging and Behavior

Frequent co-authors collaborating with Amin Saberi include:

  • Simon B. Eickhoff
  • Sofie L. Valk
  • Rad Niazadeh
  • David Wajc
  • Boris C. Bernhardt

Publication venues where Amin Saberi frequently contributes are diverse and include both preprint servers and peer-reviewed journals:

  • arXiv (Cornell University)
  • bioRxiv (Cold Spring Harbor Laboratory)
  • Operations Research
  • Proceedings of the 23rd ACM Conference on Economics and Computation
  • SSRN Electronic Journal

Amin Saberi has been recognized with the award of Fellow of the Alfred P. Sloan Foundation in 2010.

Best Publications

  • AdWords and generalized online matching

    Aranyak Mehta;Amin Saberi;Umesh Vazirani;Vijay Vazirani

  • Random walks in peer-to-peer networks

    C. Gkantsidis;M. Mihail;A. Saberi

  • Minimizing Effective Resistance of a Graph

    Arpita Ghosh;Stephen Boyd;Amin Saberi

  • On approximately fair allocations of indivisible goods

    R. J. Lipton;E. Markakis;E. Mossel;A. Saberi

  • Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

    Kamal Jain;Mohammad Mahdian;Evangelos Markakis;Amin Saberi

  • A new greedy approach for facility location problems

    Kamal Jain;Mohammad Mahdian;Amin Saberi

  • The spread of innovations in social networks

    Andrea Montanari;Amin Saberi

  • An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem

    Arash Asadpour;Michel X. Goemans;Aleksander Mądry;Shayan Oveis Gharan

  • AdWords and generalized on-line matching

    A. Mehta;A. Saberi;U. Vazirani;V. Vazirani

  • An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods

    Arash Asadpour;Amin Saberi

  • Binary Opinion Dynamics with Stubborn Agents

    Ercan Yildiz;Asuman Ozdaglar;Daron Acemoglu;Amin Saberi

  • Hybrid search schemes for unstructured peer-to-peer networks

    C. Gkantsidis;M. Mihail;A. Saberi

  • Approximation Algorithms for Computing Maximin Share Allocations

    Georgios Amanatidis;Evangelos Markakis;Afshin Nikzad;Amin Saberi

  • Random walks in peer-to-peer networks: algorithms and evaluation

    Christos Gkantsidis;Milena Mihail;Amin Saberi

  • Online Stochastic Matching: Online Actions Based on Offline Statistics

    Vahideh H. Manshadi;Shayan Oveis Gharan;Amin Saberi

  • Multi-unit auctions with budget-constrained bidders

    Christian Borgs;Jennifer Chayes;Nicole Immorlica;Mohammad Mahdian

  • On the spread of viruses on the internet

    Noam Berger;Christian Borgs;Jennifer T. Chayes;Amin Saberi

  • Market equilibrium via a primal--dual algorithm for a convex program

    Nikhil R. Devanur;Christos H. Papadimitriou;Amin Saberi;Vijay V. Vazirani

  • Message-Passing Algorithms for Sparse Network Alignment

    Mohsen Bayati;David F. Gleich;Amin Saberi;Ying Wang

  • A Randomized Rounding Approach to the Traveling Salesman Problem

    Shayan Oveis Gharan;Amin Saberi;Mohit Singh

  • Market equilibrium via a primal-dual-type algorithm

    N.R. Devanur;C.H. Papadimitriou;A. Saberi;V.V. Vazirani

  • An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem

    Arash Asadpour;Michel X. Goemans;Aleksander Madry;Shayan Oveis Gharan

Frequent Co-Authors

Mohammad Mahdian
Mohammad Mahdian Google (United States)
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
Yinyu Ye
Yinyu Ye Stanford University
David F. Gleich
David F. Gleich Purdue University West Lafayette
Christos Gkantsidis
Christos Gkantsidis Microsoft (United States)
Jennifer Chayes
Jennifer Chayes University of California, Berkeley
Christian Borgs
Christian Borgs University of California, Berkeley
Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Kamal Jain
Kamal Jain Microsoft (United States)
Anna Scaglione
Anna Scaglione Cornell University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring the right college programs is a crucial step for anyone interested in computer science. Many students today are choosing flexible and accessible online degrees, which can open up a variety of career pathways within the tech industry.

For those seeking advanced education without a heavy workload, reviewing the easiest online masters can be a smart strategy. These programs often offer more manageable coursework and accelerated options, helping you balance studies with work or other commitments.

Cost is a significant consideration for many. Thankfully, there are affordable phd programs online that make it possible to earn a doctorate without taking on excessive debt. These options are ideal for professionals looking to further their expertise in the field.

If you're interested in leadership or educational roles, exploring the online edd degrees can help you reach your goals faster through fast-track, flexible programs.

Best Scientists Citing Amin Saberi

Trending Scientists

Recently Published Articles