| Publication | Date of Publication | Type |
|---|
| A spectral bound on hypergraph discrepancy | 2026-03-18 | Paper |
| A spectral approach to approximately counting independent sets in dense bipartite graphs | 2026-01-14 | Paper |
On the evolution of structure in triangle-free graphs
Advances in Mathematics | 2025-10-14 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2025-08-15 | Paper |
| Unbalanced random matching markets with partial preferences | 2025-01-01 | Paper |
Algorithms for the ferromagnetic Potts model on expanders
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
| Approximately counting independent sets in bipartite graphs via graph containers | 2024-07-19 | Paper |
Error-Correcting Graph Codes
(available as arXiv preprint) | 2024-01-01 | Paper |
Sampling and counting triangle-free graphs near the critical density
(available as arXiv preprint) | 2024-01-01 | Paper |
Lower tails for triangles inside the critical window
(available as arXiv preprint) | 2024-01-01 | Paper |
| On the evolution of structure in triangle-free graphs | 2023-12-14 | Paper |
scientific article; zbMATH DE number 7758332 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Approximately counting independent sets in bipartite graphs via graph containers
Random Structures & Algorithms | 2023-10-12 | Paper |
Approximately counting independent sets in bipartite graphs via graph containers
Random Structures & Algorithms | 2023-10-12 | Paper |
| Approximately counting independent sets in dense bipartite graphs via subspace enumeration | 2023-07-18 | Paper |
Independent sets of a given size and structure in the hypercube
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
On the AC^0[oplus] Complexity of Andreev's Problem
(available as arXiv preprint) | 2023-02-03 | Paper |
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
(available as arXiv preprint) | 2023-01-01 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2022-04-04 | Paper |
| Enumerating independent sets in Abelian Cayley graphs | 2021-09-13 | Paper |
Improved Inapproximability of Rainbow Coloring
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Enumerating independent sets in Abelian Cayley graphs
(available as arXiv preprint) | 2021-01-01 | Paper |
| A spectral bound on hypergraph discrepancy | 2019-07-07 | Paper |
| Simplified inpproximability of hypergraph coloring via t-agreeing families | 2019-04-01 | Paper |
| Improved efficiency for covering codes matching the sphere-covering bound | 2019-02-20 | Paper |
Simplified inpproximability of hypergraph coloring via t-agreeing families
(available as arXiv preprint) | 2019-01-01 | Paper |
Improved efficiency for covering codes matching the sphere-covering bound
(available as arXiv preprint) | 2019-01-01 | Paper |
| Discrepancy in random hypergraph models | 2018-11-04 | Paper |
On zeros of a polynomial in a finite grid
Combinatorics, Probability and Computing | 2018-04-23 | Paper |
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
(available as arXiv preprint) | 2018-03-15 | Paper |
| Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields | 2018-03-15 | Paper |
Discrepancy in random hypergraph models
(available as arXiv preprint) | 2018-01-01 | Paper |
| A short note on the joint entropy of n/2-wise independence | 2017-09-03 | Paper |
| On the Alon-Füredi bound | 2017-02-13 | Paper |
A short note on the joint entropy of n/2-wise independence
(available as arXiv preprint) | 2017-01-01 | Paper |
| Cauchy-Davenport Theorem for linear maps: Simplification and Extension | 2016-12-29 | Paper |
Cauchy-Davenport Theorem for linear maps: Simplification and Extension
(available as arXiv preprint) | 2016-01-01 | Paper |
