David D. Gamarnik

David D. Gamarnik is a Nanyang Technological University Professor of Operations Research at the Operations Research and Statistics Group, MIT Sloan School of Management. He received a BA in mathematics from New York University in 1993 and a PhD in operations research from MIT in 1998. He was a research staff member at IBM T.J. Watson Research Center before joining MIT in 2005. His research interests include discrete probability, optimization and algorithms, quantum computing, statistics, machine learning, and stochastic processes. He is a Fellow of the Institute for Mathematical Statistics, the Institute for Operations Research and Management Science, and the American Mathematical Society. He is a recipient of the Erlang Prize and the Best Publication Award from the Applied Probability Society of INFORMS, and was a finalist in the Franz Edelman Prize competition of INFORMS. He currently serves as an area editor for the Mathematics of Operations Research journal.

David Gamarnik is a Professor of Operations Research at MIT, specializing in Applied Probability, Random Graphs and Random structures, Algorithms, Statistics and Machine Learning, and Queueing Theory. His research explores the behavior of complex systems through probabilistic and combinatorial methods, focusing on the performance of algorithms over random structures and the analysis of optimization problems in sparse graphs. Gamarnik investigates the limitations of local algorithms, the overlap gap property, and the phase transitions in random optimization problems. His work also addresses queueing networks, kidney exchange mechanisms, and the design of efficient approximation algorithms for combinatorial problems.