David Gamarnik
Cited by
Cited by
Validity of heavy traffic steady-state approximations in generalized Jackson networks
D Gamarnik, A Zeevi
Limits of local algorithms over sparse random graphs
D Gamarnik, M Sudan
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
M Bayati, D Gamarnik, P Tetali
Proceedings of the forty-second ACM symposium on Theory of computing, 105-114, 2010
The diameter of a long‐range percolation graph
D Coppersmith, D Gamarnik, M Sviridenko
Random Structures & Algorithms 21 (1), 1-13, 2002
Simple deterministic approximation algorithms for counting matchings
M Bayati, D Gamarnik, D Katz, C Nair, P Tetali
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
Finding long chains in kidney exchange using the traveling salesman problem
R Anderson, I Ashlagi, D Gamarnik, AE Roth
Proceedings of the National Academy of Sciences 112 (3), 663-668, 2015
Asymptotically optimal algorithms for job shop scheduling and packet routing
D Bertsimas, D Gamarnik
Journal of Algorithms 33 (2), 296-318, 1999
The quantum approximate optimization algorithm needs to see the whole graph: A typical case
E Farhi, D Gamarnik, S Gutmann
arXiv preprint arXiv:2004.09002, 2020
Random MAX SAT, random MAX CUT, and their phase transitions
D Coppersmith, D Gamarnik, MT Hajiaghayi, GB Sorkin
Random Structures & Algorithms 24 (4), 502-545, 2004
The overlap gap property: A topological barrier to optimizing over random structures
D Gamarnik
Proceedings of the National Academy of Sciences 118 (41), e2108492118, 2021
Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
D Bertsimas, D Gamarnik, JN Tsitsiklis
Annals of Applied Probability, 1384-1428, 2001
Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models
A Bandyopadhyay, D Gamarnik
Random Structures & Algorithms 33 (4), 452-479, 2008
Belief propagation for min-cost network flow: Convergence and correctness
D Gamarnik, D Shah, Y Wei
Operations research 60 (2), 410-428, 2012
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
D Gamarnik, T Nowicki, G Swirszcz
Random Structures & Algorithms 28 (1), 76-106, 2006
Join the shortest queue with many servers. The heavy-traffic asymptotics
P Eschenfeldt, D Gamarnik
Mathematics of Operations Research 43 (3), 867-886, 2018
Efficient dynamic barter exchange
R Anderson, I Ashlagi, D Gamarnik, Y Kanoria
Operations Research 65 (6), 1446-1459, 2017
The need for (long) chains in kidney exchange
I Ashlagi, D Gamarnik, MA Rees, AE Roth
National Bureau of Economic Research, 2012
A dynamic model of barter exchange
R Anderson, I Ashlagi, D Gamarnik, Y Kanoria
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
A model for understanding the impacts of demand and capacity on waiting time to enter a congested recovery room
T Schoenmeyr, PF Dunn, D Gamarnik, R Levi, DL Berger, BJ Daily, ...
The Journal of the American Society of Anesthesiologists 110 (6), 1293-1304, 2009
Stability conditions for multiclass fluid queueing networks
D Bertsimas, D Gamarnik, JN Tsitsiklis
IEEE Transactions on Automatic Control 41 (11), 1618-1631, 1996
The system can't perform the operation now. Try again later.
Articles 1–20