| Publication | Date of Publication | Type |
|---|
On the threshold for Szemerédi's theorem with random differences
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
| On converses to the polynomial method | 2024-06-27 | Paper |
Orthogonal schedules in single round robin tournaments
Operations Research Letters | 2024-06-17 | Paper |
| Discreteness of asymptotic tensor ranks | 2023-06-02 | Paper |
| On the threshold for Szemer\'edi's theorem with random differences | 2023-04-06 | Paper |
scientific article; zbMATH DE number 7651032 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Random restrictions of high-rank tensors and polynomial maps | 2022-12-28 | Paper |
Subspaces of tensors with high analytic rank
(available as arXiv preprint) | 2022-10-06 | Paper |
| Subspaces of tensors with high analytic rank | 2022-10-06 | Paper |
scientific article; zbMATH DE number 7559121 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Quantum query algorithms are completely bounded forms | 2021-06-15 | Paper |
Gaussian width bounds with applications to arithmetic progressions in random settings
IMRN. International Mathematics Research Notices | 2021-03-16 | Paper |
High-entropy dual functions over finite fields and locally decodable codes
Forum of Mathematics, Sigma | 2021-03-10 | Paper |
Failure of the trilinear operator space Grothendieck theorem
discrete Analysis | 2020-01-17 | Paper |
Outlaw distributions and locally decodable codes
Theory of Computing | 2019-12-05 | Paper |
Quasirandom quantum channels
(available as arXiv preprint) | 2019-08-17 | Paper |
Quantum query algorithms are completely bounded forms
SIAM Journal on Computing | 2019-05-07 | Paper |
Outlaw distributions and locally decodable codes
(available as arXiv preprint) | 2018-05-03 | Paper |
| scientific article; zbMATH DE number 6840818 (Why is no real title available?) | 2018-02-19 | Paper |
Tight hardness of the non-commutative Grothendieck problem
Theory of Computing | 2018-01-10 | Paper |
Round elimination in exact communication complexity
(available as arXiv preprint) | 2017-07-12 | Paper |
Entanglement-assisted zero-error source-channel coding
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Arithmetic expanders and deviation bounds for random tensors | 2016-10-11 | Paper |
| On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination | 2016-08-22 | Paper |
On the existence of 0/1 polytopes with high semidefinite extension complexity
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
On the existence of 0/1 polytopes with high semidefinite extension complexity
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
Grothendieck inequalities for semidefinite programs with rank constraint
Theory of Computing | 2014-10-06 | Paper |
Violating the Shannon capacity of metric graphs with entanglement
Proceedings of the National Academy of Sciences | 2014-07-25 | Paper |
Lower bounds for approximate LDCs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Lower bounds for approximate LDCs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Zero-error source-channel coding with entanglement
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
On the existence of 0/1 polytopes with high semidefinite extension complexity
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Explicit lower and upper bounds on the entangled value of multiplayer XOR games
Communications in Mathematical Physics | 2013-07-26 | Paper |
Explicit lower and upper bounds on the entangled value of multiplayer XOR games
Communications in Mathematical Physics | 2013-07-26 | Paper |
Locally decodable codes and the failure of cotype for projective tensor products
Electronic Research Announcements in Mathematical Sciences | 2012-12-03 | Paper |
Monotonicity testing and shortest-path routing on the cube
Combinatorica | 2012-09-18 | Paper |
| Locally decodable quantum codes | 2012-04-24 | Paper |
Locally decodable quantum codes
(available as arXiv preprint) | 2012-04-24 | Paper |
All Schatten spaces endowed with the Schur product are \(Q\)-algebras
Journal of Functional Analysis | 2011-12-14 | Paper |
A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
Communications in Mathematical Physics | 2011-08-23 | Paper |
Monotonicity testing and shortest-path routing on the cube
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
The positive semidefinite Grothendieck problem with rank constraint
Automata, Languages and Programming | 2010-09-07 | Paper |
Testing equivalence of pure quantum states and graph states under SLOCC
International Journal of Quantum Information | 2010-06-03 | Paper |
Noisy decoding by shallow circuits with parities: classical and quantum
(available as arXiv preprint) | N/A | Paper |
