| Publication | Date of Publication | Type |
|---|
| 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 |
| Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees | 2024-05-08 | Paper |
Paradigms for Unconditional Pseudorandom Generators
Foundations and Trends® in Theoretical Computer Science | 2024-03-05 | Paper |
scientific article; zbMATH DE number 7758331 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Dimension-free bounds and structural results in communication complexity
Israel Journal of Mathematics | 2023-04-24 | Paper |
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
Discrete Applied Mathematics | 2022-10-13 | Paper |
| Near-optimal pseudorandom generators for constant-depth read-once formulas | 2022-07-27 | Paper |
scientific article; zbMATH DE number 7561551 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561734 (Why is no real title available?) | 2022-07-21 | Paper |
| Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates | 2022-07-18 | Paper |
| The Implicit Graph Conjecture is False | 2021-11-25 | Paper |
| Pseudorandom generators for low sensitivity functions | 2021-06-15 | Paper |
XOR lemmas for resilient functions against polynomials
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Higher-order Fourier analysis and applications | 2020-11-12 | Paper |
An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
Combinatorica | 2020-10-02 | Paper |
| scientific article; zbMATH DE number 7250141 (Why is no real title available?) | 2020-09-22 | Paper |
Pseudorandom generators from polarizing random walks
Theory of Computing | 2019-12-05 | Paper |
Improved pseudorandomness for unordered branching programs through local monotonicity
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
(available as arXiv preprint) | 2019-02-20 | Paper |
Low-sensitivity functions from unambiguous certificates
(available as arXiv preprint) | 2018-05-03 | Paper |
On the Structure of Quintic Polynomials
(available as arXiv preprint) | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6850352 (Why is no real title available?) | 2018-03-15 | Paper |
Algorithmic regularity for polynomials and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A characterization of functions with vanishing averages over products of disjoint sets
European Journal of Combinatorics | 2016-05-11 | Paper |
An arithmetic analogue of Fox's triangle removal argument
Online Journal of Analytic Combinatorics | 2016-03-02 | Paper |
An arithmetic analogue of Fox's triangle removal argument
Online Journal of Analytic Combinatorics | 2016-03-02 | Paper |
General systems of linear forms: equidistribution and true complexity
Advances in Mathematics | 2016-03-02 | 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 |
Every locally characterized affine-invariant property is testable
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| scientific article; zbMATH DE number 5572981 (Why is no real title available?) | 2009-06-30 | Paper |
Measure preserving homomorphisms and independent sets in tensor graph powers
Discrete Mathematics | 2009-04-09 | Paper |
On the signed edge domination number of graphs
Discrete Mathematics | 2009-04-08 | Paper |
A lower bound for the length of a partial transversal in a Latin square
Journal of Combinatorial Theory. Series A | 2008-12-08 | Paper |
An approximation algorithm for the total covering problem
Discussiones Mathematicae Graph Theory | 2008-06-18 | Paper |
On minimum vertex covers of generalized Petersen graphs
(available as arXiv preprint) | 2008-03-11 | 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 |
