Stability conditions for multiclass fluid queueing networks. - Dimitris Bertsimas; David Gamarnik; John N. Tsitsiklis (IEEE Trans. Autom. Control., 1996)

Correction to "Stability Conditions for Multiclass Fluid Queueing Networks". - Dimitris Bertsimas; David Gamarnik; John N. Tsitsiklis (IEEE Trans. Autom. Control., 1997)

Efficient Learning of Monotone Concepts via Quadratic Optimization. - David Gamarnik (COLT, 1998)

Stability of Adversarial Queues via Fluid Models. - David Gamarnik (FOCS, 1998)

Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. - David Gamarnik (STOC, 1999)

Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. - Dimitris Bertsimas; David Gamarnik (J. Algorithms, 1999)

Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. - Dimitris Bertsimas; David Gamarnik; John N. Tsitsiklis (Mach. Learn., 1999)

Performance analysis of multiclass queueing networks. - Dimitris Bertsimas; David Gamarnik; John N. Tsitsiklis (SIGMETRICS Perform. Evaluation Rev., 1999)

Performance of multiclass Markovian queueing networks. - Dimitris Bertsimas; David Gamarnik; John N. Tsitsiklis (CDC, 2000)

On deciding stability of scheduling policies in queueing systems. - David Gamarnik (SODA, 2000)

Using fluid models to prove stability of adversarial queueing networks. - David Gamarnik (IEEE Trans. Autom. Control., 2000)

Stochastic online binpacking problem: exact conditions for bounded expected queue lengths under the best fit packing heuristic. - David Gamarnik (SIGMETRICS Perform. Evaluation Rev., 2001)

On deciding stability of constrained random walks and queueing systems. - David Gamarnik (SIGMETRICS Perform. Evaluation Rev., 2001)

On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems. - David Gamarnik (Math. Oper. Res., 2002)

The diameter of a long-range percolation graph. - Don Coppersmith; David Gamarnik; Maxim Sviridenko (Random Struct. Algorithms, 2002)

Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. - David Gamarnik (SIGMETRICS Perform. Evaluation Rev., 2002)

From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective. - Dimitris Bertsimas; David Gamarnik; Jay Sethuraman (Oper. Res., 2003)

Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks. - David Gamarnik (SIAM J. Comput., 2003)

Weak instability in stochastic and fluid queueing networks. - David Gamarnik; John J. Hasenbein (SIGMETRICS Perform. Evaluation Rev., 2003)

Extension of the PAC framework to finite and countable Markov chains. - David Gamarnik (IEEE Trans. Inf. Theory, 2003)

Linear phase transition in random linear constraint satisfaction problems. - David Gamarnik (SODA, 2004)

On the Value of a Random Minimum Weight Steiner Tree. - Béla Bollobás; David Gamarnik; Oliver Riordan; Benny Sudakov (Comb., 2004)

Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique. - David Gamarnik (Queueing Syst. Theory Appl., 2004)

Random MAX SAT, random MAX CUT, and their phase transitions. - Don Coppersmith; David Gamarnik; Mohammad Taghi Hajiaghayi; Gregory B. Sorkin (Random Struct. Algorithms, 2004)

An asymptotic optimality of the transposition rule for linear lists. - David Gamarnik; Petar Momcilovic (SIGMETRICS Perform. Evaluation Rev., 2004)

The expected value of random minimal length spanning tree of a complete graph. - David Gamarnik (SODA, 2005)

Hamiltonian completions of sparse random graphs. - David Gamarnik; Maxim Sviridenko (Discret. Appl. Math., 2005)

An improved upper bound for the TSP in cubic 3-edge-connected graphs. - David Gamarnik; Moshe Lewenstein; Maxim Sviridenko (Oper. Res. Lett., 2005)

Embracing the giant component. - Abraham D. Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2005)

Counting without sampling: new algorithms for enumeration problems using statistical physics. - Antar Bandyopadhyay; David Gamarnik (SODA, 2006)

First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (WINE, 2006)

Handling load with less stress. - Nikhil Bansal 001; David Gamarnik (Queueing Syst. Theory Appl., 2006)

Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. - David Gamarnik; Tomasz Nowicki; Grzegorz Swirszcz (Random Struct. Algorithms, 2006)

Correlation decay and deterministic FPTAS for counting list-colorings of a graph. - David Gamarnik; Dmitriy Katz (SODA, 2007)

Simple deterministic approximation algorithms for counting matchings. - Mohsen Bayati; David Gamarnik; Dimitriy A. Katz; Chandra Nair; Prasad Tetali (STOC, 2007)

On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks. - David Gamarnik (Math. Oper. Res., 2007)

Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models. - Antar Bandyopadhyay; David Gamarnik (Random Struct. Algorithms, 2008)

Sequential cavity method for computing limits of the log-partition function for lattice models. - David Gamarnik; Dmitriy Katz (SODA, 2009)

PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. - David Gamarnik; David A. Goldberg 001; Theophane Weber (SODA, 2010)

Belief Propagation for Min-cost Network Flow: Convergence & Correctness. - David Gamarnik; Devavrat Shah; Yehua Wei (SODA, 2010)

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. - Mohsen Bayati; David Gamarnik; Prasad Tetali (STOC, 2010)

Stability of Skorokhod problem is undecidable - David Gamarnik; Dmitriy Katz (CoRR, 2010)

Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. - David Gamarnik; David A. Goldberg 001 (Comb. Probab. Comput., 2010)

A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix. - David Gamarnik; Dmitriy Katz (J. Comput. Syst. Sci., 2010)

On exponential ergodicity of multiclass queueing networks. - David Gamarnik; Sean P. Meyn (Queueing Syst. Theory Appl., 2010)

Performance Analysis of Queueing Networks via Robust Optimization. - Dimitris Bertsimas; David Gamarnik; Alexander Anatoliy Rikun (Oper. Res., 2011)

First-passage percolation on a ladder graph, and the path cost in a VCG auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2011)

Counting Independent Sets Using the Bethe Approximation. - Venkat Chandrasekaran; Misha Chertkov; David Gamarnik; Devavrat Shah; Jinwoo Shin (SIAM J. Discret. Math., 2011)

Belief Propagation for Min-Cost Network Flow: Convergence and Correctness. - David Gamarnik; Devavrat Shah; Yehua Wei (Oper. Res., 2012)

Correlation decay and deterministic FPTAS for counting colorings of a graph. - David Gamarnik; Dmitriy Katz (J. Discrete Algorithms, 2012)

Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution. - David Gamarnik; Alexander L. Stolyar (Queueing Syst. Theory Appl., 2012)

Limits of local algorithms over sparse random graphs. - David Gamarnik; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2013)

Hardness of parameter estimation in graphical models. - Guy Bresler; David Gamarnik; Devavrat Shah (NIPS, 2014)

Structure learning of antiferromagnetic Ising models. - Guy Bresler; David Gamarnik; Devavrat Shah (NIPS, 2014)

Local Algorithms for Graphs. - David Gamarnik; Mathieu Hemery; Samuel Hetterich (CoRR, 2014)

Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem. - David Gamarnik; Madhu Sudan 001 (CoRR, 2014)

Correlation Decay in Random Decision Networks. - David Gamarnik; David A. Goldberg 001; Theophane Weber (Math. Oper. Res., 2014)

A dynamic model of barter exchange. - Ross Anderson; Itai Ashlagi; David Gamarnik; Yash Kanoria (SODA, 2015)

Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted. - Ross Anderson; Itai Ashlagi; David Gamarnik; Michael Rees; Alvin E. Roth; Tayfun Sönmez; M. Utku Ünver (Interfaces, 2015)

The stability of the deterministic Skorokhod problem is undecidable. - David Gamarnik; Dmitriy Katz (Queueing Syst. Theory Appl., 2015)

Strong spatial mixing of list coloring of graphs. - David Gamarnik; Dmitriy Katz; Sidhant Misra (Random Struct. Algorithms, 2015)

Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems. - David Gamarnik; John N. Tsitsiklis; Martin Zubeldia (SIGMETRICS, 2016)

A Message Passing Algorithm for the Problem of Path Packing in Graphs. - Patrick Eschenfeldt; David Gamarnik (CoRR, 2016)

Preface to the Special Issue on Information and Decisions in Social and Economic Networks. - Edward J. Anderson; David Gamarnik; Anton J. Kleywegt; Asuman E. Ozdaglar (Oper. Res., 2016)

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem. - David Gamarnik; Sidhant Misra (IEEE Signal Process. Lett., 2016)

High Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transtition. - David Gamarnik; Ilias Zadik (COLT, 2017)

Matrix Completion from $O(n)$ Samples in Linear Time. - David Gamarnik; Quan Li 001; Hongyi Zhang (COLT, 2017)

Efficient Dynamic Barter Exchange. - Ross Anderson; Itai Ashlagi; David Gamarnik; Yash Kanoria (Oper. Res., 2017)

Convergent sequences of sparse graphs: A large deviations approach. - Christian Borgs; Jennifer T. Chayes; David Gamarnik (Random Struct. Algorithms, 2017)

Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem. - David Gamarnik; Madhu Sudan 001 (SIAM J. Comput., 2017)

High Dimensional Linear Regression using Lattice Basis Reduction. - Ilias Zadik; David Gamarnik (NeurIPS, 2018)

Explicit construction of RIP matrices is Ramsey-hard. - David Gamarnik (CoRR, 2018)

Computing the partition function of the Sherrington-Kirkpatrick model is hard on average. - David Gamarnik (CoRR, 2018)

Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics. - Patrick Eschenfeldt; David Gamarnik (Math. Oper. Res., 2018)

On the max-cut of sparse random graphs. - David Gamarnik; Quan Li 001 (Random Struct. Algorithms, 2018)

Learning Graphical Models From the Glauber Dynamics. - Guy Bresler; David Gamarnik; Devavrat Shah (IEEE Trans. Inf. Theory, 2018)

High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm. - David Gamarnik; Eren C. Kizildag (ISIT, 2019)

Sparse High-Dimensional Isotonic Regression. - David Gamarnik; Julia Gaudio (NeurIPS, 2019)

The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property. - David Gamarnik; Ilias Zadik (CoRR, 2019)

The Overlap Gap Property in Principal Submatrix Recovery. - David Gamarnik; Aukosh Jagannath; Subhabrata Sen (CoRR, 2019)

Stationary Points of Shallow Neural Networks with Quadratic Activation Function. - David Gamarnik; Eren C. Kizildag; Ilias Zadik (CoRR, 2019)

Low-Degree Hardness of Random Optimization Problems. - David Gamarnik; Aukosh Jagannath; Alexander S. Wein (FOCS, 2020)

Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average. - David Gamarnik; Eren C. Kizildag (ISIT, 2020)

Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena. - Matt Emschwiller; David Gamarnik; Eren C. Kizildag; Ilias Zadik (CoRR, 2020)

The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case. - Edward Farhi; David Gamarnik; Sam Gutmann (CoRR, 2020)

Stability, memory, and messaging tradeoffs in heterogeneous service systems. - David Gamarnik; John N. Tsitsiklis; Martin Zubeldia (CoRR, 2020)

Finding cliques using few probes. - Uriel Feige; David Gamarnik; Joe Neeman; Miklós Z. Rácz; Prasad Tetali (Random Struct. Algorithms, 2020)

Self-Regularity of Output Weights for Overparameterized Two-Layer Neural Networks. - David Gamarnik; Eren C. Kizildag; Ilias Zadik (ISIT, 2021)

Circuit Lower Bounds for the p-Spin Optimization Problem. - David Gamarnik; Aukosh Jagannath; Alexander S. Wein (CoRR, 2021)

The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures. - David Gamarnik (CoRR, 2021)

Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection. - David Gamarnik; Eren C. Kizildag; Ilias Zadik (IEEE Trans. Inf. Theory, 2021)

Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models. - Joao Basso; David Gamarnik; Song Mei; Leo Zhou (FOCS, 2022)

Algorithms and Barriers in the Symmetric Binary Perceptron Model. - David Gamarnik; Eren C. Kizildag; Will Perkins 001; Changji Xu (FOCS, 2022)

The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers. - David Gamarnik; Eren C. Kizildag (ISIT, 2022)

Disordered Systems Insights on Computational Hardness. - David Gamarnik; Cristopher Moore; Lenka Zdeborová (CoRR, 2022)

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems. - David Gamarnik; John N. Tsitsiklis; Martin Zubeldia (Math. Oper. Res., 2022)

Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks. - David Gamarnik; Eren C. Kizildag; Ilias Zadik (IEEE Trans. Signal Process., 2022)

Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. - David Gamarnik; Eren C. Kizildag; Will Perkins 001; Changji Xu (COLT, 2023)

Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on cite{schuetz2022combinatorial}, cite{angelini2023modern}, cite{schuetz2023reply}. - David Gamarnik (CoRR, 2023)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. - David Gamarnik; Elchanan Mossel; Ilias Zadik (CoRR, 2023)

Computing the Volume of a Restricted Independent Set Polytope Deterministically. - David Gamarnik; Devin Smedira (CoRR, 2023)

Correlation decay and the absence of zeros property of partition functions. - David Gamarnik (Random Struct. Algorithms, 2023)

Integrating High-Dimensional Functions Deterministically. - David Gamarnik; Devin Smedira (CoRR, 2024)

Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs. - Houssam El Cheairi; David Gamarnik (CoRR, 2024)

Combinatorial NLTS From the Overlap Gap Property. - Eric R. Anschütz; David Gamarnik; Bobak T. Kiani (Quantum, 2024)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. - David Gamarnik; Mihyun Kang; Pawel Pralat (SIAM J. Discret. Math., 2024)

Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. - David Gamarnik; Aukosh Jagannath; Alexander S. Wein (SIAM J. Comput., 2024)

Stationary Points of a Shallow Neural Network with Quadratic Activations and the Global Optimality of the Gradient Descent Algorithm. - David Gamarnik; Eren C. Kizildag; Ilias Zadik (Math. Oper. Res., 2025)

Hardness of Sampling Solutions From the Symmetric Binary Perceptron. - Ahmed El Alaoui; David Gamarnik (Random Struct. Algorithms, 2025)

Densest Subgraphs of a Dense Erdös-Rényi Graph. Asymptotics, Landscape, and Universality. - Houssam El Cheairi; David Gamarnik (SIAM J. Discret. Math., 2025)

Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes. - David Gamarnik (CoRR, 2025)

Optimal Hardness of Online Algorithms for Large Independent Sets. - David Gamarnik; Eren C. Kizildag; Lutz Warnke (CoRR, 2025)