| Publication | Date of Publication | Type |
|---|
| Convex minimization with integer minima in \(\widetilde{O} (n^4)\) time | 2024-11-28 | Paper |
| Space-efficient interior point method, with applications to linear programming and maximum weight bipartite matching | 2024-11-14 | Paper |
| Hyperbolic concentration, anti-concentration, and discrepancy | 2024-08-22 | Paper |
| Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut} | 2024-05-14 | Paper |
| Super-resolution and robust sparse continuous Fourier transform in any constant dimension: nearly linear time and sample complexity | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126277 | 2024-04-09 | Paper |
| Convergence analysis of distributed population dynamics based on second-order Delaunay triangulation | 2024-03-27 | Paper |
| A faster algorithm for solving general LPs | 2023-11-14 | Paper |
| Almost optimal super-constant-pass streaming lower bounds for reachability | 2023-11-14 | Paper |
| Efficient Algorithm for Solving Hyperbolic Programs | 2023-06-13 | Paper |
| Solving Linear Programs in the Current Matrix Multiplication Time | 2022-12-08 | Paper |
| Third party interventions mitigate conflicts on interdependent networks | 2021-11-10 | Paper |
| Reducing approximate Longest Common Subsequence to approximate Edit Distance | 2021-02-02 | Paper |
| Solving tall dense linear programs in nearly linear time | 2021-01-19 | Paper |
| An improved cutting plane method for convex optimization, convex-concave games, and its applications | 2021-01-19 | Paper |
| Learning mixtures of linear regressions in subexponential time via Fourier moments | 2021-01-19 | Paper |
| Four deviations suffice for rank 1 matrices | 2020-12-03 | Paper |
| Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle | 2020-11-23 | Paper |
| Hyperbolic Concentration, Anti-concentration, and Discrepancy | 2020-08-21 | Paper |
| The exact formula of the optimal penalty parameter value of the spectral penalty method for differential equations | 2020-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111390 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5214187 | 2020-02-07 | Paper |
| Solving Tall Dense Linear Programs in Nearly Linear Time | 2020-02-06 | Paper |
| Solving linear programs in the current matrix multiplication time | 2020-01-30 | Paper |
| Stronger L 2 /L 2 compressed sensing; without iterating | 2020-01-30 | Paper |
| Relative Error Tensor Low Rank Approximation | 2019-10-15 | Paper |
| A matrix expander Chernoff bound | 2019-08-22 | Paper |
| A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees | 2018-10-18 | Paper |
| A Max-Product EM Algorithm for Reconstructing Markov-Tree Sparse Signals From Compressive Samples | 2018-08-22 | Paper |
| Optimizing squares covering a set of points | 2018-05-17 | Paper |
| The $p$-Center Problem in Tree Networks Revisited | 2017-10-17 | Paper |
| Weighted low rank approximations with provable guarantees | 2017-09-29 | Paper |
| Low rank approximation with entrywise l 1 -norm error | 2017-08-17 | Paper |
| Batch Codes Through Dense Graphs Without Short Cycles | 2017-04-28 | Paper |
| Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks | 2015-09-21 | Paper |
| Optimizing Squares Covering a Set of Points | 2015-09-11 | Paper |
| A linear time algorithm for computing minmax regret 1-median on a tree network | 2015-01-19 | Paper |
| Back-Up 2-Center on a Path/Tree/Cycle/Unicycle | 2014-09-26 | Paper |
| Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles | 2014-03-31 | Paper |
| Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights | 2013-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3501410 | 2008-06-03 | Paper |
| Quantum Speedup for Spectral Approximation of Kronecker Products | N/A | Paper |
