David Gamarnik
Affiliations: | 1997 | Massachusetts Institute of Technology, Cambridge, MA, United States |
Google:
"David Gamarnik"Parents
Sign in to add mentor| Dimitris Bertsimas | grad student | 1997 | MIT | |
| (Stability and performance of multiclass queueing networks) | ||||
| John Nikolaos Tsitsiklis | grad student | 1997 | (E-Tree) | |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Gamarnik D, Tsitsiklis JN, Zubeldia M. (2020) A lower bound on the queueing delay in resource constrained load balancing Annals of Applied Probability. 30: 870-901 |
| Chen W, Gamarnik D, Panchenko D, et al. (2019) Suboptimality of local algorithms for a class of max-cut problems Annals of Probability. 47: 1587-1618 |
| Eschenfeldt P, Gamarnik D. (2018) Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics Mathematics of Operations Research. 43: 867-886 |
| Bresler G, Gamarnik D, Shah D. (2018) Learning Graphical Models From the Glauber Dynamics Ieee Transactions On Information Theory. 64: 4072-4080 |
| Gamarnik D, Li Q. (2018) On the max-cut of sparse random graphs Random Structures and Algorithms. 52: 219-262 |
| Gamarnik D, Sudan M. (2017) Limits of local algorithms over sparse random graphs Annals of Probability. 45: 2353-2376 |
| Gamarnik D, Sudan M. (2017) Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem Siam Journal On Computing. 46: 590-619 |
| Borgs C, Chayes JT, Gamarnik D. (2017) Convergent sequences of sparse graphs: A large deviations approach Random Structures and Algorithms. 51: 52-89 |
| Gamarnik D, Misra S. (2016) A Note on Alternating Minimization Algorithm for the Matrix Completion Problem Ieee Signal Processing Letters. 23: 1340-1343 |
| Anderson R, Ashlagi I, Gamarnik D, et al. (2015) Finding long chains in kidney exchange using the traveling salesman problem. Proceedings of the National Academy of Sciences of the United States of America. 112: 663-8 |