| Publication | Date of Publication | Type |
|---|
The \epsilon-t-Net Problem
(available as arXiv preprint) | N/A | Paper |
Identifying the Deviator
(available as arXiv preprint) | N/A | Paper |
Universality for graphs with bounded density
(available as arXiv preprint) | N/A | Paper |
Partitioning the hypercube into smaller hypercubes
(available as arXiv preprint) | N/A | Paper |
Erasure codes and Tur\'an hypercube problems
(available as arXiv preprint) | N/A | Paper |
Sumsets in the Hypercube
(available as arXiv preprint) | N/A | Paper |
Adversarial laws of large numbers and optimal regret in online classification
SIAM Journal on Computing | 2026-09-02 | Paper |
| Explicit unique-neighbor expanders | 2026-05-29 | Paper |
| Learning a hidden matching | 2026-05-29 | Paper |
| Sublinear time shortest path in expander graphs | 2026-05-12 | Paper |
| Efficient splitting of necklaces | 2026-05-12 | Paper |
| Universality and tolerance | 2026-05-08 | Paper |
| Testing of clustering | 2026-05-08 | Paper |
| Testing subgraphs in large graphs | 2026-05-08 | Paper |
| Semi-direct product in groups and zig-zag product in graphs: connections and applications | 2026-05-08 | Paper |
| Regular languages are testable with a constant number of queries | 2026-05-06 | Paper |
| Efficient testing of large graphs | 2026-05-06 | Paper |
Universality for graphs with bounded density
Journal of Combinatorial Theory. Series B | 2026-03-16 | Paper |
Maximum shattering
Journal of Combinatorial Designs | 2025-11-17 | Paper |
Hitting k primes by dice rolls
The Electronic Journal of Combinatorics | 2025-11-12 | Paper |
| A theory of PAC learnability of partial concept classes | 2025-08-13 | Paper |
| Testing hereditary properties of ordered graphs and matrices | 2025-08-06 | Paper |
| Optimal compression of approximate inner products and dimension reduction | 2025-08-06 | Paper |
| Welfare maximization with limited interaction | 2025-08-05 | Paper |
Rainbow stackings of random edge-colorings
Bulletin of the London Mathematical Society | 2025-07-07 | Paper |
Partitioning the hypercube into smaller hypercubes
Illinois Journal of Mathematics | 2025-05-30 | Paper |
| A non-linear lower bound for planar epsilon-nets | 2025-04-29 | Paper |
| Solving linear systems through nested dissection | 2025-04-29 | Paper |
Essentially tight bounds for rainbow cycles in proper edge-colourings
Proceedings of the London Mathematical Society. Third Series | 2025-04-25 | Paper |
| Expander graphs, strong blocking sets and minimal codes (extended abstract) | 2025-04-08 | Paper |
Unit and distinct distances in typical norms
Geometric and Functional Analysis. GAFA | 2025-02-18 | Paper |
Sumsets in the hypercube
SIAM Journal on Discrete Mathematics | 2025-02-07 | Paper |
The power of many colours
Forum of Mathematics, Sigma | 2024-12-12 | Paper |
Diagonalization Games
American Mathematical Monthly | 2024-12-12 | Paper |
Erasure list-decodable codes and Turán hypercube problems
Finite Fields and their Applications | 2024-11-01 | Paper |
Implicit representation of sparse hereditary families
Discrete & Computational Geometry | 2024-10-25 | Paper |
Connectivity graph-codes
Random Structures & Algorithms | 2024-10-24 | Paper |
Identifying the deviator
The Annals of Applied Probability | 2024-10-16 | Paper |
Cats in cubes
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Eli Goodman (1933--2021) and Ricky Pollack (1935--2018)
Notices of the American Mathematical Society | 2024-09-26 | Paper |
On sums and products along the edges, II
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica | 2024-09-11 | Paper |
On a random model of forgetting
The Annals of Applied Probability | 2024-08-21 | Paper |
Logarithmically larger deletion codes of all distances
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Erratum to: ``Multitasking capacity: hardness results and improved constructions''
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Strong blocking sets and minimal codes from expander graphs
Transactions of the American Mathematical Society | 2024-07-12 | Paper |
Boosting simple learners
TheoretiCS | 2024-07-03 | Paper |
Hitting a Prime in 2.43 Dice Rolls (On Average)
The American Statistician | 2024-06-27 | Paper |
Graph-codes
European Journal of Combinatorics | 2024-02-05 | Paper |
Invertibility of Digraphs and Tournaments
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Turán graphs with bounded matching number
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Fair Partitions
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Adversarial laws of large numbers and optimal regret in online classification
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Adversarial laws of large numbers and optimal regret in online classification
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Boosting simple learners
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7760134 (Why is no real title available?) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7758308 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Spanning trees with few non-leaves
Israel Journal of Mathematics | 2023-10-23 | Paper |
Near-sunflowers and focal families
Israel Journal of Mathematics | 2023-10-23 | Paper |
Complete minors and average degree: A short proof
Journal of Graph Theory | 2023-10-12 | Paper |
Divisible subdivisions
Journal of Graph Theory | 2023-10-04 | Paper |
New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
European Journal of Combinatorics | 2023-10-02 | Paper |
List Ramsey numbers
Journal of Graph Theory | 2023-09-29 | Paper |
| Essentially tight bounds for rainbow cycles in proper edge-colourings | 2023-09-08 | Paper |
| The power of many colours | 2023-08-29 | Paper |
Rank of Matrices with Entries from a Multiplicative Group
IMRN. International Mathematics Research Notices | 2023-08-15 | Paper |
| Connectivity Graph-Codes | 2023-08-15 | Paper |
| Ordering Candidates via Vantage Points | 2023-08-09 | Paper |
| On bipartite coverings of graphs and multigraphs | 2023-07-31 | Paper |
Largest subgraph from a hereditary property in a random graph
Discrete Mathematics | 2023-06-12 | Paper |
| Strong blocking sets and minimal codes from expander graphs | 2023-05-24 | Paper |
Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Private and Online Learnability Are Equivalent
Journal of the ACM | 2023-04-27 | Paper |
Irregular subgraphs
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
| The limit points of the top and bottom eigenvalues of regular graphs | 2023-04-03 | Paper |
The diameter of the uniform spanning tree of dense graphs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Structured Codes of Graphs
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Counting dope matrices
Journal of Algebra | 2023-02-21 | Paper |
| Unit and distinct distances in typical norms | 2023-02-17 | Paper |
On sums of monotone random integer variables
Electronic Communications in Probability | 2023-01-23 | Paper |
Friends and strangers walking on graphs
Séminaire Lotharingien de Combinatoire | 2023-01-05 | Paper |
| Diagonalization Games | 2023-01-05 | Paper |
| Cats in cubes | 2022-11-27 | Paper |
Typical and extremal aspects of friends-and-strangers graphs
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
| Logarithmically larger deletion codes of all distances | 2022-09-23 | Paper |
| Hitting a prime in 2.43 dice rolls (on average) | 2022-09-15 | Paper |
The \(\varepsilon\)-\(t\)-net problem
Discrete & Computational Geometry | 2022-08-25 | Paper |
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
(available as arXiv preprint) | 2022-07-21 | Paper |
The runsort permuton
Advances in Applied Mathematics | 2022-06-13 | Paper |
Counting Dope Matrices
(available as arXiv preprint) | 2022-05-18 | Paper |
High-girth near-Ramanujan graphs with localized eigenvectors
Israel Journal of Mathematics | 2022-04-25 | Paper |
Additive approximation of generalized Turán questions
Algorithmica | 2022-03-25 | Paper |
| On a random model of forgetting | 2022-03-04 | Paper |
On the hat guessing number of graphs
Discrete Mathematics | 2022-02-14 | Paper |
| Implicit representation of sparse hereditary families | 2022-01-02 | Paper |
| Random necklaces require fewer cuts | 2021-12-29 | Paper |
Asymmetric list sizes in bipartite graphs
Annals of Combinatorics | 2021-12-18 | Paper |
Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
Experimental Mathematics | 2021-11-03 | Paper |
Explicit expanders of every degree and size
Combinatorica | 2021-10-25 | Paper |
Irregular Subgraphs
(available as arXiv preprint) | 2021-08-05 | Paper |
Efficient removal lemmas for matrices
(available as arXiv preprint) | 2021-07-28 | Paper |
