| Publication | Date of Publication | Type |
|---|
| 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 | 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 | 2022-10-13 | Paper |
| On public-coin zero-error randomized communication complexity | 2022-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093405 | 2022-07-26 | Paper |
| Sign rank vs discrepancy | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091215 | 2022-07-21 | Paper |
| Approximation algorithms for hitting subgraphs | 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 |
| https://portal.mardi4nfdi.de/entity/Q5133219 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111146 | 2020-05-26 | Paper |
| Lower bounds for graph bootstrap percolation via properties of polynomials | 2020-04-27 | Paper |
| Information complexity of the AND function in the two-party and multi-party settings | 2019-10-17 | Paper |
| Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions | 2019-02-20 | Paper |
| On the boundary of the region defined by homomorphism densities | 2019-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568116 | 2018-06-15 | Paper |
| Graph properties, graph limits, and entropy | 2018-02-23 | Paper |
| Structure of Protocols for XOR Functions | 2018-02-22 | Paper |
| Teaching dimension, VC dimension, and critical sets in Latin squares | 2018-01-15 | Paper |
| Information complexity of the AND function in the two-party and multi-party settings | 2017-10-23 | Paper |
| On the sum of the \(L_1\) influences of bounded functions | 2016-09-15 | Paper |
| On the additive bases problem in finite fields | 2016-09-13 | Paper |
| A characterization of functions with vanishing averages over products of disjoint sets | 2016-05-11 | Paper |
| General systems of linear forms: equidistribution and true complexity | 2016-03-02 | Paper |
| Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime | 2014-11-14 | Paper |
| Limits of Boolean functions on \(\mathbb{F}_p^n\) | 2014-10-23 | Paper |
| The inducibility of blow-up graphs | 2014-10-22 | Paper |
| Every locally characterized affine-invariant property is testable | 2014-08-07 | Paper |
| Limits of locally-globally convergent graph sequences | 2014-06-06 | Paper |
| Correlation testing for affine invariant properties on F p n in the high error regime | 2014-06-05 | Paper |
| The entropy of random-free graphons and properties | 2013-07-26 | Paper |
| On the number of pentagons in triangle-free graphs | 2013-03-06 | Paper |
| Spectral Norm of Symmetric Functions | 2012-11-02 | Paper |
| Non-three-colourable common graphs exist | 2012-09-12 | Paper |
| A structure theorem for Boolean functions with small total influences | 2012-08-30 | Paper |
| The scaling window for a random graph with a given degree sequence | 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 | 2012-01-10 | Paper |
| Undecidability of linear inequalities in graph homomorphism densities | 2011-04-04 | Paper |
| The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three | 2010-12-03 | Paper |
| Graph norms and Sidorenko's conjecture | 2010-09-21 | Paper |
| Decision Trees and Influences of Variables Over Product Probability Spaces | 2010-04-23 | Paper |
| Approximation and inapproximability results for maximum clique of disc graphs in high dimensions | 2010-03-24 | Paper |
| Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics | 2010-03-17 | Paper |
| Amenability constants for semilattice algebras | 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 | 2009-02-17 | Paper |
| Fourier analysis and large independent sets in powers of complete graphs | 2007-12-10 | Paper |
| Perfect dominating sets in the Cartesian products of prime cycles | 2007-07-16 | Paper |
| Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms | 2006-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5491335 | 2006-10-11 | Paper |
| \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number | 2005-11-22 | Paper |
| On the computational complexity of defining sets | 2005-09-02 | Paper |
| Circular chromatic index of graphs of maximum degree 3 | 2005-08-29 | Paper |
| On the size of the minimum critical set of a Latin square | 2005-06-01 | Paper |
| Random cubic graphs are not homomorphic to the cycle of size 7 | 2005-03-08 | Paper |
| On the complexity of the circular chromatic number | 2005-02-16 | Paper |
| On the spectrum of the forced matching number of graphs | 2004-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470234 | 2004-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406883 | 2003-06-26 | Paper |
| Sparse graph counting and Kelley-Meka bounds for binary systems | N/A | Paper |
