| Publication | Date of Publication | Type |
|---|
A lower bound on the trace norm of Boolean matrices and its applications
Algorithmica | 2026-06-17 | Paper |
| Refuting approaches to the log-rank conjecture for XOR functions | 2026-01-14 | Paper |
Block complexity and idempotent Schur multipliers
IMRN. International Mathematics Research Notices | 2025-12-18 | Paper |
Separation of the factorization norm and randomized communication complexity
Computational Complexity | 2025-11-28 | Paper |
| Communication complexity and discrepancy of halfplanes | 2025-11-24 | Paper |
Boolean functions with small approximate spectral norm
Discrete Analysis | 2025-09-12 | Paper |
| The implicit graph conjecture is false | 2025-08-15 | Paper |
| Structure of protocols for XOR functions | 2025-08-06 | Paper |
| Estimating the distance from testable affine-invariant properties | 2025-05-20 | Paper |
A tight lower bound on non-adaptive group testing estimation
Discrete Applied Mathematics | 2025-02-28 | Paper |
| Separation of the factorization norm and randomized communication complexity | 2024-11-19 | Paper |
| Online learning and disambiguations of partial concept classes | 2024-11-14 | Paper |
| Lower bound methods for sign-rank and their limitations | 2024-08-22 | Paper |
| A Borsuk-Ulam lower bound for sign-rank and its applications | 2024-05-08 | Paper |
Dimension-free bounds and structural results in communication complexity
Israel Journal of Mathematics | 2023-04-24 | Paper |
| On depth-3 circuits and covering number: an explicit counter-example | 2022-10-15 | Paper |
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
Discrete Applied Mathematics | 2022-10-13 | Paper |
On public-coin zero-error randomized communication complexity
Information Processing Letters | 2022-09-02 | Paper |
Sign-rank vs. discrepancy
Theory of Computing | 2022-07-26 | Paper |
| Sign rank vs discrepancy | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561551 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Approximation algorithms for hitting subgraphs
(available as arXiv preprint) | 2022-03-22 | Paper |
| The Implicit Graph Conjecture is False | 2021-11-25 | Paper |
| Typical structure of hereditary properties of binary matroids | 2021-05-05 | Paper |
| Higher-order Fourier analysis and applications | 2020-11-12 | Paper |
scientific article; zbMATH DE number 7204267 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Lower bounds for graph bootstrap percolation via properties of polynomials
Journal of Combinatorial Theory. Series A | 2020-04-27 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Algorithmica | 2019-10-17 | Paper |
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
(available as arXiv preprint) | 2019-02-20 | Paper |
On the boundary of the region defined by homomorphism densities
Journal of Combinatorics | 2019-01-28 | Paper |
Trading information complexity for error
Theory of Computing | 2018-06-15 | Paper |
Graph properties, graph limits, and entropy
Journal of Graph Theory | 2018-02-23 | Paper |
Graph properties, graph limits, and entropy
Journal of Graph Theory | 2018-02-23 | Paper |
Structure of protocols for XOR functions
SIAM Journal on Computing | 2018-02-22 | Paper |
Teaching dimension, VC dimension, and critical sets in Latin squares
Journal of Combinatorics | 2018-01-15 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Lecture Notes in Computer Science | 2017-10-23 | Paper |
On the sum of the L₁ influences of bounded functions
Israel Journal of Mathematics | 2016-09-15 | Paper |
On the additive bases problem in finite fields
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
On the additive bases problem in finite fields
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
A characterization of functions with vanishing averages over products of disjoint sets
European Journal of Combinatorics | 2016-05-11 | Paper |
General systems of linear forms: equidistribution and true complexity
Advances in Mathematics | 2016-03-02 | Paper |
Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime
SIAM Journal on Computing | 2014-11-14 | Paper |
Limits of Boolean functions on \(\mathbb{F}_p^n\)
The Electronic Journal of Combinatorics | 2014-10-23 | Paper |
Limits of Boolean functions on \(\mathbb{F}_p^n\)
The Electronic Journal of Combinatorics | 2014-10-23 | Paper |
The inducibility of blow-up graphs
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
Every locally characterized affine-invariant property is testable
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Limits of locally-globally convergent graph sequences
Geometric and Functional Analysis. GAFA | 2014-06-06 | Paper |
Correlation testing for affine invariant properties on F <sub>p</sub> <sup>n</sup> in the high error regime
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
The entropy of random-free graphons and properties
Combinatorics, Probability and Computing | 2013-07-26 | Paper |
On the number of pentagons in triangle-free graphs
Journal of Combinatorial Theory. Series A | 2013-03-06 | Paper |
Spectral norm of symmetric functions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Non-three-colourable common graphs exist
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
A structure theorem for Boolean functions with small total influences
Annals of Mathematics. Second Series | 2012-08-30 | Paper |
The scaling window for a random graph with a given degree sequence
Random Structures & Algorithms | 2012-08-30 | Paper |
| Limits of local-global convergent graph sequences | 2012-05-19 | Paper |
Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
Geometric and Functional Analysis. GAFA | 2012-01-10 | Paper |
Undecidability of linear inequalities in graph homomorphism densities
Journal of the American Mathematical Society | 2011-04-04 | Paper |
The fractional chromatic number of graphs of maximum degree at most three
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Graph norms and Sidorenko's conjecture
Israel Journal of Mathematics | 2010-09-21 | Paper |
Decision Trees and Influences of Variables Over Product Probability Spaces
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
Information Processing Letters | 2010-03-24 | Paper |
Integrality gaps of semidefinite programs for vertex cover and relations to \(\ell_1\) embeddability of negative type metrics
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Amenability constants for semilattice algebras
Semigroup Forum | 2009-10-14 | Paper |
| On generalizations of Gowers norms and their geometry | 2009-03-18 | Paper |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Fourier analysis and large independent sets in powers of complete graphs
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
Perfect dominating sets in the Cartesian products of prime cycles
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
Perfect dominating sets in the Cartesian products of prime cycles
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
Perfect dominating sets in the Cartesian products of prime cycles
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
| Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms | 2006-12-14 | Paper |
| scientific article; zbMATH DE number 5062518 (Why is no real title available?) | 2006-10-11 | Paper |
\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
Journal of Combinatorial Theory. Series B | 2005-11-22 | Paper |
On the computational complexity of defining sets
Discrete Applied Mathematics | 2005-09-02 | Paper |
Circular chromatic index of graphs of maximum degree 3
Journal of Graph Theory | 2005-08-29 | Paper |
On the size of the minimum critical set of a Latin square
Discrete Mathematics | 2005-06-01 | Paper |
Random cubic graphs are not homomorphic to the cycle of size 7
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
On the complexity of the circular chromatic number
Journal of Graph Theory | 2005-02-16 | Paper |
On the spectrum of the forced matching number of graphs
(available as arXiv preprint) | 2004-10-15 | Paper |
scientific article; zbMATH DE number 2076804 (Why is no real title available?)
(available as arXiv preprint) | 2004-06-22 | Paper |
| scientific article; zbMATH DE number 1940456 (Why is no real title available?) | 2003-06-26 | Paper |
Sparse graph counting and Kelley-Meka bounds for binary systems
(available as arXiv preprint) | N/A | Paper |
