| Publication | Date of Publication | Type |
|---|
| Learning arithmetic formulas in the presence of noise: a general framework and applications to unsupervised learning | 2025-11-04 | Paper |
| Learning sums of powers of low-degree polynomials in the non-degenerate case | 2025-08-12 | Paper |
| Towards a theory of non-commutative optimization: geodesic 1st and 2nd order methods for moment maps and polytopes | 2025-08-12 | Paper |
| More barriers for rank methods, via a ``numeric to symbolic'' transfer | 2025-08-12 | Paper |
| Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes | 2025-08-12 | Paper |
| Classical lower bounds from quantum upper bounds | 2025-08-12 | Paper |
| A deterministic polynomial time algorithm for non-commutative rational identity testing | 2025-08-06 | Paper |
| Near-optimal bounds on bounded-round quantum communication complexity of disjointness | 2025-08-05 | Paper |
| Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization | 2024-11-14 | Paper |
| Learning generalized depth three arithmetic circuits in the non-degenerate case | 2024-08-22 | Paper |
scientific article; zbMATH DE number 7799591 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
| Determinant Equivalence Test over Finite Fields and over Q | 2022-07-21 | Paper |
Scalar Poincaré implies matrix Poincaré
Electronic Communications in Probability | 2022-01-06 | Paper |
| Low error efficient computational extractors in the CRS model | 2021-12-01 | Paper |
scientific article; zbMATH DE number 7204275 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
(available as arXiv preprint) | 2019-10-02 | Paper |
A matrix expander Chernoff bound
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| More barriers for rank methods, via a "numeric to symbolic" transfer | 2019-04-08 | Paper |
Expected Communication Cost of Distributed Quantum Tasks
IEEE Transactions on Information Theory | 2018-12-19 | Paper |
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
SIAM Journal on Computing | 2018-12-19 | Paper |
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
Geometric and Functional Analysis. GAFA | 2018-04-25 | Paper |
| Efficient algorithms for tensor scaling, quantum marginals and moment polytopes | 2018-04-12 | Paper |
Managing information uncertainty in wave height modeling for the offshore structural analysis through random set
Complexity | 2017-10-26 | Paper |
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Lower bound on expected communication cost of quantum Huffman coding | 2017-07-19 | Paper |
Information lower bounds via self-reducibility
Theory of Computing Systems | 2017-01-18 | Paper |
Small value parallel repetition for general games
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
From information to exact communication
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Public vs private coin in bounded-round information
Automata, Languages, and Programming | 2014-07-01 | Paper |
Information Lower Bounds via Self-reducibility
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Constructive extensions of two results on graphic sequences
Discrete Applied Mathematics | 2012-04-30 | Paper |
