The following pages link to David Gamarnik (Q373836):
Displayed 50 items.
- On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime (Q373837) (← links)
- Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution (Q383244) (← links)
- Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime (Q389068) (← links)
- Right-convergence of sparse random graphs (Q466899) (← links)
- On the value of a random minimum weight Steiner tree (Q705741) (← links)
- Handling load with less stress (Q851238) (← links)
- On exponential ergodicity of multiclass queueing networks (Q975794) (← links)
- Stochastic bandwidth packing process: stability conditions via Lyapunov function technique (Q1771277) (← links)
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions (Q1872422) (← links)
- Linear phase transition in random linear constraint satisfaction problems (Q1881641) (← links)
- Estimation of time-varying parameters in statistical models: An optimization approach (Q1964326) (← links)
- Finding a large submatrix of a Gaussian random matrix (Q1991667) (← links)
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition (Q2131259) (← links)
- A lower bound on the queueing delay in resource constrained load balancing (Q2192743) (← links)
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models (Q2227713) (← links)
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average (Q2240857) (← links)
- Uniqueness of Gibbs measures for continuous hardcore models (Q2327937) (← links)
- Suboptimality of local algorithms for a class of max-cut problems (Q2421823) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Validity of heavy traffic steady-state approximations in generalized Jackson networks (Q2494573) (← links)
- Instability in stochastic and fluid queueing networks (Q2572388) (← links)
- Hamiltonian completions of sparse random graphs (Q2576345) (← links)
- Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks (Q2819547) (← links)
- Belief Propagation for Min-Cost Network Flow: Convergence and Correctness (Q2917635) (← links)
- (Q2921730) (← links)
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
- Local algorithms for graphs (Q2990203) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- Counting Independent Sets Using the Bethe Approximation (Q3094955) (← links)
- Performance Analysis of Queueing Networks via Robust Optimization (Q3098770) (← links)
- The diameter of a long-range percolation graph (Q3150196) (← links)
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method (Q3376664) (← links)
- Giant Component in Random Multipartite Graphs with Given Degree Sequences (Q3466715) (← links)
- Steady-state analysis of a multiserver queue in the Halfin-Whitt regime (Q3516402) (← links)
- (Q3549606) (← links)
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
- Counting without sampling (Q3581598) (← links)
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models (Q3608304) (← links)
- Invariant probability measures and dynamics of exponential linear type maps (Q3623581) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← links)
- (Q4315764) (← links)
- (Q4428906) (← links)
- (Q4451041) (← links)
- (Q4471319) (← links)
- Using fluid models to prove stability of adversarial queueing networks (Q4507107) (← links)
- On the max‐cut of sparse random graphs (Q4564857) (← links)
- Efficient Dynamic Barter Exchange (Q4602462) (← links)
- Extension of the PAC framework to finite and countable Markov chains (Q4679911) (← links)
- Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks (Q4706197) (← links)