| Publication | Date of Publication | Type |
|---|
Ellipsoid fitting up to a constant
| 2024-11-14 | Paper |
Expander random walks: the general case and limitations
| 2024-06-24 | Paper |
Sum-of-squares lower bounds for densest \(k\)-subgraph
| 2024-05-08 | Paper |
On the mysteries of MAX NAE-SAT
| 2024-01-15 | Paper |
On the Approximability of Presidential Type Predicates
| 2023-10-31 | Paper |
scientific article; zbMATH DE number 7732139 (Why is no real title available?)
| 2023-08-28 | Paper |
Ellipsoid Fitting Up to a Constant
| 2023-07-12 | Paper |
Sum of squares bounds for the ordering principle
| 2022-07-21 | Paper |
Sum of squares lower bounds from symmetry and a good story
| 2022-07-18 | Paper |
On Mixing Distributions Via Random Orthogonal Matrices and the Spectrum of the Singular Values of Multi-Z Shaped Graph Matrices
| 2022-06-05 | Paper |
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle and the Ordering Principle
| 2022-05-07 | Paper |
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS
| 2020-11-18 | Paper |
Lengths of words accepted by nondeterministic finite automata
Information Processing Letters | 2020-10-07 | Paper |
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
| 2020-09-03 | Paper |
The Spectrum of the Singular Values of Z-Shaped Graph Matrices
| 2020-06-24 | Paper |
A note on amortized branching program complexity
| 2020-05-26 | Paper |
A Conjecture on Induced Subgraphs of Cayley Graphs
| 2020-03-29 | Paper |
On the approximation resistance of balanced linear threshold functions
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A nearly tight sum-of-squares lower bound for the planted clique problem
SIAM Journal on Computing | 2019-05-07 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
ACM Transactions on Algorithms | 2018-11-13 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Bounds on Monotone Switching Networks for Directed Connectivity
Journal of the ACM | 2018-05-17 | Paper |
Bounds on the norms of uniform low degree graph matrices
| 2018-04-19 | Paper |
Sum-of-squares Lower Bounds for Planted Clique
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Tight bounds for monotone switching networks via Fourier analysis
Theory of Computing | 2015-02-03 | Paper |
A note on a problem of Erdos and Rothschild
| 2014-12-04 | Paper |
Tight bounds for monotone switching networks via Fourier analysis
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees
| 2013-01-16 | Paper |
The critical group of a line graph
Annals of Combinatorics | 2013-01-03 | Paper |
Maximal caps in \(\mathrm{AG}(6,3)\).
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Proof of Han's Hook Expansion Conjecture
| 2008-08-06 | Paper |
