David Gamarnik
Title
Cited by
Cited by
Year
Validity of heavy traffic steady-state approximations in generalized Jackson networks
D Gamarnik, A Zeevi
The Annals of Applied Probability 16 (1), 56-90, 2006
1662006
The diameter of a long-range percolation graph
D Coppersmith, D Gamarnik, M Sviridenko
Mathematics and computer science II, 147-159, 2002
1312002
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
1222007
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
1132010
Asymptotically optimal algorithms for job shop scheduling and packet routing
D Bertsimas, D Gamarnik
Journal of Algorithms 33 (2), 296-318, 1999
1121999
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
922015
Limits of local algorithms over sparse random graphs
D Gamarnik, M Sudan
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
892014
Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
D Bertsimas, D Gamarnik, JN Tsitsiklis
Annals of Applied Probability, 1384-1428, 2001
882001
Belief propagation for min-cost network flow: Convergence and correctness
D Gamarnik, D Shah, Y Wei
Operations research 60 (2), 410-428, 2012
842012
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
802006
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
802004
Stability conditions for multiclass fluid queueing networks
D Bertsimas, D Gamarnik, JN Tsitsiklis
IEEE Transactions on Automatic Control 41 (11), 1618-1631, 1996
781996
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
772014
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, ...
Anesthesiology: The Journal of the American Society of Anesthesiologists 110 …, 2009
762009
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
762008
The need for (long) chains in kidney exchange
I Ashlagi, D Gamarnik, MA Rees, AE Roth
National Bureau of Economic Research Working Paper Series, 2012
652012
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
D Gamarnik, D Katz
arXiv preprint math/0606143, 2006
632006
An improved upper bound for the TSP in cubic 3-edge-connected graphs
D Gamarnik, M Lewenstein, M Sviridenko
Operations Research Letters 33 (5), 467-474, 2005
612005
Steady-state queue in the Halfin–Whitt regime
D Gamarnik, DA Goldberg
The Annals of Applied Probability 23 (6), 2382-2419, 2013
582013
Join the shortest queue with many servers. The heavy-traffic asymptotics
P Eschenfeldt, D Gamarnik
Mathematics of Operations Research 43 (3), 867-886, 2018
562018
The system can't perform the operation now. Try again later.
Articles 1–20