David Gamarnik

From MaRDI portal
Person:373836

Available identifiers

zbMath Open gamarnik.davidWikidataQ102246461 ScholiaQ102246461MaRDI QIDQ373836

List of research outcomes





PublicationDate of PublicationType
The landscape of the planted clique problem: dense subgraphs and the overlap gap property2024-10-09Paper
Self-regularity of non-negative output weights for overparameterized two-layer neural networks2024-09-12Paper
Circuit lower bounds for the \(p\)-spin optimization problem2024-09-12Paper
Cliques, chromatic number, and independent sets in the semi-random process2024-08-28Paper
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics2024-02-28Paper
Algorithmic obstructions in the random number partitioning problem2024-01-19Paper
Computing the Volume of a Restricted Independent Set Polytope Deterministically2023-12-06Paper
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique2023-11-07Paper
Correlation decay and the absence of zeros property of partition functions2023-10-17Paper
Shattering in the Ising Pure $p$-Spin Model2023-07-14Paper
Maximally-stable Local Optima in Random Graphs and Spin Glasses: Phase Transitions and Universality2023-05-05Paper
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process2023-03-23Paper
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization2023-02-13Paper
Disordered systems insights on computational hardness2022-12-13Paper
Densest Subgraphs of a Dense Erd\"os-R\'{e}nyi Graph. Asymptotics, Landscape and Universality2022-12-07Paper
Disordered Systems Insights on Computational Hardness2022-10-15Paper
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems2022-09-26Paper
Sparse high-dimensional linear regression. Estimating squared error and a phase transition2022-04-25Paper
Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models2022-04-21Paper
Algorithms and Barriers in the Symmetric Binary Perceptron Model2022-03-29Paper
Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection2022-02-17Paper
The overlap gap property in principal submatrix recovery2022-01-18Paper
Computing the partition function of the Sherrington-Kirkpatrick model is hard on average2021-11-04Paper
Circuit Lower Bounds for the p-Spin Optimization Problem2021-09-03Paper
The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures2021-08-01Paper
Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks2021-03-02Paper
The overlap gap property and approximate message passing algorithms for \(p\)-spin models2021-02-15Paper
Explicit Construction of RIP Matrices Is Ramsey‐Hard2020-11-13Paper
A lower bound on the queueing delay in resource constrained load balancing2020-08-17Paper
Finding cliques using few probes2020-06-19Paper
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems2020-06-18Paper
Estimation of Monotone Multi-Index Models2020-06-04Paper
Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics2020-03-12Paper
Uniqueness of Gibbs measures for continuous hardcore models2019-10-08Paper
The Overlap Gap Property in Principal Submatrix Recovery2019-08-26Paper
Sparse High-Dimensional Isotonic Regression2019-07-02Paper
Suboptimality of local algorithms for a class of max-cut problems2019-06-18Paper
Finding a large submatrix of a Gaussian random matrix2018-10-30Paper
Learning Graphical Models From the Glauber Dynamics2018-09-14Paper
On the max‐cut of sparse random graphs2018-06-07Paper
High Dimensional Linear Regression using Lattice Basis Reduction2018-03-18Paper
Efficient Dynamic Barter Exchange2018-01-11Paper
Sparse High-Dimensional Linear Regression. Algorithmic Barriers and a Local Search Algorithm2017-11-14Paper
Limits of local algorithms over sparse random graphs2017-10-05Paper
A dynamic model of barter exchange2017-10-05Paper
Convergent sequences of sparse graphs: A large deviations approach2017-09-26Paper
Limits of local algorithms over sparse random graphs2017-05-19Paper
Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem2017-03-10Paper
High-Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transition2017-01-16Paper
Supermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics2016-10-11Paper
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks2016-09-29Paper
Local algorithms for graphs2016-07-29Paper
Giant Component in Random Multipartite Graphs with Given Degree Sequences2016-01-25Paper
https://portal.mardi4nfdi.de/entity/Q55012482015-08-03Paper
Right-convergence of sparse random graphs2014-10-31Paper
The expected value of random minimal length spanning tree of a complete graph2014-10-13Paper
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs2014-08-13Paper
Correlation Decay in Random Decision Networks2014-07-11Paper
https://portal.mardi4nfdi.de/entity/Q54176242014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176232014-05-22Paper
Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem2014-02-01Paper
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs2014-01-31Paper
Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime2014-01-17Paper
Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution2013-11-25Paper
On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime2013-10-25Paper
Belief propagation for min-cost network flow: convergence and correctness2012-10-01Paper
Correlation decay and deterministic FPTAS for counting colorings of a graph2012-05-11Paper
Performance Analysis of Queueing Networks via Robust Optimization2011-11-18Paper
Counting Independent Sets Using the Bethe Approximation2011-10-27Paper
First-passage percolation on a ladder graph, and the path cost in a VCG auction2011-05-11Paper
Counting without sampling2010-08-16Paper
On exponential ergodicity of multiclass queueing networks2010-06-11Paper
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections2010-04-23Paper
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective2009-07-09Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Invariant probability measures and dynamics of exponential linear type maps2009-04-21Paper
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models2009-03-04Paper
https://portal.mardi4nfdi.de/entity/Q35496062009-01-05Paper
Steady-state analysis of a multiserver queue in the Halfin-Whitt regime2008-08-05Paper
On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks2008-05-27Paper
Handling load with less stress2006-11-17Paper
Validity of heavy traffic steady-state approximations in generalized Jackson networks2006-06-29Paper
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method2006-03-24Paper
Hamiltonian completions of sparse random graphs2005-12-27Paper
Embracing the giant component2005-11-15Paper
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems2005-11-11Paper
Instability in stochastic and fluid queueing networks2005-11-08Paper
An improved upper bound for the TSP in cubic 3-edge-connected graphs2005-08-25Paper
A Transposition Rule Analysis Based on a Particle Process2005-08-25Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Analysis of Stochastic Online Bin Packing Processes2005-07-27Paper
Extension of the PAC framework to finite and countable Markov chains2005-05-31Paper
Stochastic bandwidth packing process: stability conditions via Lyapunov function technique2005-04-07Paper
On the value of a random minimum weight Steiner tree2005-02-14Paper
https://portal.mardi4nfdi.de/entity/Q48289512004-11-29Paper
Linear phase transition in random linear constraint satisfaction problems2004-10-05Paper
Random MAX SAT, random MAX CUT, and their phase transitions2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44713192004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44510412004-02-22Paper
https://portal.mardi4nfdi.de/entity/Q44289062003-09-22Paper
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks2003-06-19Paper
The diameter of a long-range percolation graph2003-05-25Paper
Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions2003-05-06Paper
Using fluid models to prove stability of adversarial queueing networks2000-10-17Paper
Estimation of time-varying parameters in statistical models: An optimization approach2000-06-13Paper
https://portal.mardi4nfdi.de/entity/Q49526532000-05-10Paper
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing2000-03-19Paper
Stability conditions for multiclass fluid queueing networks1997-01-15Paper
https://portal.mardi4nfdi.de/entity/Q43157641995-01-24Paper
WITHDRAWN: Product states optimize quantum $p$-spin models for large $p$N/APaper
Integrating High-Dimensional Functions DeterministicallyN/APaper

Research outcomes over time

This page was built for person: David Gamarnik