David Gamarnik

David Gamarnik
Alma materMassachusetts Institute of Technology (PhD)
New York University (BA)
AwardsErlang Prize (2004)
INFORMS Applied Probability Society Best Publication Award (2011)
INFORMS Franz Edelman Prize Laureate (2014)
Fellow of INFORMS (2021)
Fellow of the AMS (2022)
Fellow of the IMS (2023)
Scientific career
FieldsOperations Research, Applied probability, Stochastic Processes, Algorithms, Optimization, Random graphs, Quantum systems, Quantum computing
Institutions
Thesis Stability and Performance of Multiclass Queueing Networks  (1998)
Doctoral advisor

David Gamarnik is an American applied mathematician, and a Nanyang Technological University Professor in the Operations Research and Statistics Group at the Massachusetts Institute of Technology's Sloan School of Management.[1] His research spans discrete probability, statistics and machine learning, algorithms and optimization, quantum computing, stochastic processes and queueing theory.[2]

Early life and education

Gamarnik was born in Tbilisi, Georgia and completed part of his undergraduate studies at Tbilisi State University in 1990. He received a B.A. in mathematics from New York University, Courant Institute of Mathematical Sciences in 1993.[2] He received his Ph.D. in Operations Research from MIT in 1998, with a dissertation titled Stability and Performance of Multiclass Queueing Networks.[3]

Career

Gamarnik worked as a research staff member at IBM Thomas J. Watson Research Center (1997–2005).[2] He joined the MIT Sloan School of Management in 2005, serving as an Assistant Professor (2005–2007), Associate Professor (2007–2012), and full Professor (since 2012).[2]

He has written over 150 scientific publications and a textbook, and made profound contributions to numerous domains, including discrete probability, random structures, algorithms and combinatorial optimization, statistics and machine learning, quantum computing, stochastic processes, as well as queueing theory.[4][5][6]

Along with Madhu Sudan, he introduced Overlap Gap Property, a new method for understanding average-case complexity, based on theory of spin glasses.[7][8][9][10][11]

He has served in editorial roles (area editor/associate editor) for premier operations research and applied probability journals, including Mathematics of Operations Research, the Annals of Applied Probability, Queueing Systems, Stochastic Systems, and Operations Research.[12]

Awards and honors

Gamarnik has received multiple honors and awards from professional societies, including:

Books

  • Queueing Theory: Classical and Modern Methods, 2022.[19]

References

  1. ^ "David D. Gamarnik". Retrieved 11 February 2026.
  2. ^ a b c d "Curriculum Vitae – David Gamarnik" (PDF). Retrieved 11 February 2026.
  3. ^ "Stability and performance of multiclass queueing networks". Retrieved 11 February 2026.
  4. ^ "David Gamarnik named IMS Fellow". MIT Statistics and Data Science Center. Massachusetts Institute of Technology. 2023-05-15. Retrieved 2026-03-13.
  5. ^ "Plenary Speakers". INFORMS Applied Probability Society Conference. Retrieved 2026-03-13.
  6. ^ "2011 Best Publication Award citation" (PDF). The Applied Probability Society of INFORMS. Retrieved 2026-03-13.
  7. ^ "Tackling hard computational problems". MIT News. Massachusetts Institute of Technology. 2022-01-10. Retrieved 2026-03-13.
  8. ^ Michael J. Sweet (2022-10-13). "MIT's new tool for solving hard computational problems". Innovation Logic. Retrieved 2026-03-13.
  9. ^ Siobhan Roberts (2025-10-01). "A Breakthrough in Global Dynamics on Graphs". MathInstitutes.org. Retrieved 2026-03-13.
  10. ^ "[Abel Prize (Facebook Page)]". Facebook. Retrieved 2026-03-13.
  11. ^ Müller, Noela (2023-05-03). "Is it easier to find half a needle than a full needle in a random network?". The Network Pages. Retrieved 2026-03-13.
  12. ^ "Editorial Board". Mathematics of Operations Research. INFORMS. Retrieved 2026-03-13.
  13. ^ "INFORMS Subdivision Awards (Erlang Prize, 2004)". Retrieved 11 February 2026.
  14. ^ "David Gamarnik – Award Recipient". Retrieved 11 February 2026.
  15. ^ "Franz Edelman Laureates: Class of 2014". Retrieved 11 February 2026.
  16. ^ "INFORMS Fellows: Class of 2021". Retrieved 11 February 2026.
  17. ^ "2022 Class of Fellows of the AMS". Retrieved 11 February 2026.
  18. ^ "2023 IMS Fellows Announced". Retrieved 11 February 2026.
  19. ^ Bertsimas, Dimitris; Gamarnik, David (2022). Queueing Theory: Classical and Modern Methods. Charlestown: Dynamic Ideas. ISBN 978-1733788533.
This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.