The following pages link to Zhao Song (Q486973):
Displayed 36 items.
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- The exact formula of the optimal penalty parameter value of the spectral penalty method for differential equations (Q2185414) (← links)
- Four deviations suffice for rank 1 matrices (Q2213767) (← links)
- Third party interventions mitigate conflicts on interdependent networks (Q2242822) (← links)
- Back-Up 2-Center on a Path/Tree/Cycle/Unicycle (Q2920478) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Batch Codes Through Dense Graphs Without Short Cycles (Q2976882) (← links)
- (Q3501410) (← links)
- A Max-Product EM Algorithm for Reconstructing Markov-Tree Sparse Signals From Compressive Samples (Q4578843) (← links)
- Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights (Q4909575) (← links)
- Low rank approximation with entrywise l <sub>1</sub> -norm error (Q4978015) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)
- (Q5111390) (← links)
- Learning mixtures of linear regressions in subexponential time via Fourier moments (Q5144945) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- An improved cutting plane method for convex optimization, convex-concave games, and its applications (Q5144979) (← links)
- Reducing approximate Longest Common Subsequence to approximate Edit Distance (Q5146876) (← links)
- Stronger L <sub>2</sub> /L <sub>2</sub> compressed sensing; without iterating (Q5212770) (← links)
- Solving linear programs in the current matrix multiplication time (Q5212834) (← links)
- (Q5214187) (← links)
- A matrix expander Chernoff bound (Q5230365) (← links)
- Relative Error Tensor Low Rank Approximation (Q5236363) (← links)
- Weighted low rank approximations with provable guarantees (Q5361834) (← links)
- The $p$-Center Problem in Tree Networks Revisited (Q5369508) (← links)
- Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles (Q5405052) (← links)
- Almost optimal super-constant-pass streaming lower bounds for reachability (Q6087027) (← links)
- A faster algorithm for solving general LPs (Q6087047) (← links)
- Convergence analysis of distributed population dynamics based on second-order Delaunay triangulation (Q6122279) (← links)
- (Q6126277) (← links)
- A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees (Q6308472) (← links)
- Solving Tall Dense Linear Programs in Nearly Linear Time (Q6334245) (← links)
- Hyperbolic Concentration, Anti-concentration, and Discrepancy (Q6347517) (← links)
- Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle (Q6354358) (← links)
- Efficient Algorithm for Solving Hyperbolic Programs (Q6440119) (← links)