| No quantum speedup over gradient descent for non-smooth convex optimization | 0 | 0.34 | 2021 |
| Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. | 0 | 0.34 | 2021 |
| Operator Scaling: Theory and Applications | 1 | 0.37 | 2020 |
| Learning sums of powers of low-degree polynomials in the non-degenerate case | 1 | 0.35 | 2020 |
| Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. | 0 | 0.34 | 2020 |
| Computational Extractors with Negligible Error in the CRS Model. | 0 | 0.34 | 2019 |
| More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer | 0 | 0.34 | 2019 |
| Determinant Equivalence Test over Finite Fields and over Q. | 0 | 0.34 | 2019 |
| Determinant equivalence test over finite fields and over $\mathbf{Q}$. | 0 | 0.34 | 2019 |
| Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. | 0 | 0.34 | 2019 |
| Classical Lower Bounds from Quantum Upper Bounds | 0 | 0.34 | 2018 |
| A matrix expander Chernoff bound. | 2 | 0.37 | 2018 |
| Monotone Circuit Lower Bounds from Resolution. | 0 | 0.34 | 2018 |
| Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes | 2 | 0.37 | 2018 |
| Expected Communication Cost of Distributed Quantum Tasks. | 0 | 0.34 | 2018 |
| Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing. | 5 | 0.79 | 2018 |
| Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. | 3 | 0.40 | 2018 |
| Separating quantum communication and approximate rank. | 0 | 0.34 | 2017 |
| Barriers for Rank Methods in Arithmetic Complexity. | 2 | 0.44 | 2017 |
| Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. | 10 | 0.65 | 2017 |
| Managing Information Uncertainty in Wave Height Modeling for the Offshore Structural Analysis through Random Set. | 0 | 0.34 | 2017 |
| Matrix Concentration for Expander Walks. | 1 | 0.35 | 2017 |
| Algorithmic aspects of Brascamp-Lieb inequalities. | 0 | 0.34 | 2016 |
| Lower Bound on Expected Communication Cost of Quantum Huffman Coding. | 0 | 0.34 | 2016 |
| Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality. | 19 | 0.77 | 2016 |
| A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing | 15 | 1.01 | 2015 |
| Near-optimal bounds on bounded-round quantum communication complexity of disjointness. | 7 | 0.47 | 2015 |
| On Communication Cost of Distributed Statistical Estimation and Dimensionality. | 12 | 0.70 | 2014 |
| Lower Bound for High-Dimensional Statistical Learning Problem via Direct-Sum Theorem. | 1 | 0.38 | 2014 |
| Small value parallel repetition for general games. | 12 | 0.67 | 2014 |
| Public vs Private Coin in Bounded-Round Information. | 9 | 0.71 | 2013 |
| Information Lower Bounds via Self-reducibility. | 2 | 0.38 | 2012 |
| From information to exact communication | 20 | 1.11 | 2012 |
| Constructive extensions of two results on graphic sequences. | 1 | 0.48 | 2011 |
| Close Clustering Based Automated Color Image Annotation | 0 | 0.34 | 2010 |
