Amin SaberiAssociate Professor
Management Science and Engineering
Institute for Computational and Mathematical Engineering
and by courtesy Electrical Engineering
A short bio.
N. Anari, S. Gharan, L. Gurvits, and A. Saberi, Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices, to appear in FOCS 2017.
N. Anari, S. Gharan, A. Saberi, and N. Srivastava, Approximating the Largest Root and Applications to Interlacing Families, preprint 2017.
Ali Shameli, Tim Althoff, Amin Saberi, and Jure Leskovec, How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application, WWW, 2017.
N. Anari, S. Gharan, A. Saberi, and M. Singh, Nash Social Welfare, Matrix Permanent, and Stable Polynomials, ITCS 2017 (accepted with distinction).
L. Fleischer, R. Garg, S. Kapoor, R., and A. Saberi, A Simple and Efficient Algorithm for Computing Market Equilibria, ACM Trans. Algorithms 12(3): 34:1-34:15 (2016).
A. Kim, V. Liaghat, J. Qin, and A. Saberi, Online Energy Storage Management: an Algorithmic Approach, APPROX-RANDOM 2016.
G. Amanatidis, E. Markakis, A. Nikzad, and A. Saberi, Approximation Algorithms for Computing Maximin Share Allocations, ICALP 2015.
N. Berger, C. Borgs, J. T. Chayes, and A. Saberi, Asymptotic Behavior and Distributional Limits of Preferential Attachment Graphs, Annals of Probability, Volume 42, Number 1 (2014).
H. Nazerzadeh, A. Saberi, and R. Vohra, Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising, Operations Research 61(1): 98-111 (2013).
V. Manshadi, S. Oveis Gharan, and A. Saberi, Online Stochastic Matching: Online Actions Based on Offline Statistics, Mathematics of Operations Research 37(4): 559-573 (2012).
S. Oveis Gharan, A. Saberi, M. Singh, A Randomized Rounding Approach to the Traveling Salesman Problem, FOCS 2011 (best paper award).
A. Montanari, A. Saberi, The Spread of Innovations in Social Networks, in Proceedings of the National Academy of Sciences. See also the supplementary information, the conference version which appeared in FOCS 2009, and a short excerpt in ACM SIGecom exchanges.
V. Manshadi, S. Oveis Gharan, A. Saberi, Online Stochastic Matching: Online Actions Based on Offline Statistics, SODA 2011.
A. Asadpour, M. Goemans, A. Madry, S. Oveis Gharan, A. Saberi, An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman
Problem, SODA 2010 (best paper award).
A. Mehta, A. Saberi, U. Vazirani, V. Vazirani, Adwords and Generalized On-line Matching , Journal of the ACM (2007). Conference version appeared in IEEE Symposium on Foundations of Computer Science (2005). A SIAM News article by Sara Robinson on this work.
| Huang Engineering Center, Office 309 |
475 Via Ortega
Stanford, CA 94305-4121
Office: (650) 724-2052
Cell: (650) 704-7857
|Assistant: Roz Morf |
Phone: (650) 723-4173
Fax: (650) 723-1614