The following pages link to Smoothed analysis of algorithms (Q3583576):
Displaying 50 items.
- Some new results on the eigenvalues of complex non-central Wishart matrices with a rank-1 mean (Q290695) (← links)
- Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Nearly optimal minimax estimator for high-dimensional sparse linear regression (Q385791) (← links)
- Running time of the treapsort algorithm (Q387004) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Learning with stochastic inputs and adversarial outputs (Q439998) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- The null space property for sparse recovery from multiple measurement vectors (Q533503) (← links)
- \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- The double pivot simplex method (Q684156) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Smoothed analysis of integer programming (Q877191) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- On realistic terrains (Q934023) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Mean width of random perturbations of random polytopes (Q1707387) (← links)
- On the smoothness of paging algorithms (Q1743122) (← links)
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem (Q1782048) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
- Random perturbation of sparse graphs (Q2030748) (← links)
- Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices (Q2040198) (← links)
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
