| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126292 | 2024-04-09 | Paper |
| Learnability can be independent of set theory (invited paper) | 2023-11-14 | Paper |
| Adversarial laws of large numbers and optimal regret in online classification | 2023-11-14 | Paper |
| Boosting simple learners | 2023-11-14 | Paper |
| A theory of universal learning | 2023-11-14 | Paper |
| Private and Online Learnability Are Equivalent | 2023-04-27 | Paper |
| Replicability and stability in learning | 2023-04-07 | Paper |
| Diagonalization Games | 2023-01-05 | Paper |
| On the perceptron's compression | 2022-12-16 | Paper |
| The unstable formula theorem revisited via algorithms | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091184 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088983 | 2022-07-18 | Paper |
| Unlabeled sample compression schemes and corner peelings for ample and maximum classes | 2022-04-04 | Paper |
| How Expressive Are Friendly School Partitions? | 2022-03-21 | Paper |
| Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper | 2021-09-27 | Paper |
| Agnostic Online Learning and Excellent Sets | 2021-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002761 | 2021-07-28 | Paper |
| On weak \(\epsilon\)-nets and the Radon number | 2021-01-29 | Paper |
| A Sauer-Shelah-Perles lemma for lattices | 2020-11-05 | Paper |
| Private PAC learning implies finite Littlestone dimension | 2020-01-30 | Paper |
| Near-optimal Linear Decision Trees for k-SUM and Related Problems | 2019-11-21 | Paper |
| Twenty (short) questions | 2019-09-04 | Paper |
| Near-optimal linear decision trees for k-SUM and related problems | 2019-08-22 | Paper |
| Approximate nonnegative rank is equivalent to the smooth rectangle bound | 2019-06-20 | Paper |
| The Optimal Approximation Factor in Density Estimation | 2019-02-10 | Paper |
| Learners that Use Little Information | 2019-02-06 | Paper |
| A Sauer-Shelah-Perles lemma for sumsets | 2018-11-22 | Paper |
| The entropy of lies: playing twenty questions with a liar | 2018-11-06 | Paper |
| Sample Compression Schemes for VC Classes | 2018-08-02 | Paper |
| Sign rank versus Vapnik-Chervonenkis dimension | 2018-04-06 | Paper |
| Shattered Sets and the Hilbert Function | 2018-03-21 | Paper |
| Hitting Set for hypergraphs of low VC-dimension | 2018-03-02 | Paper |
| Teaching and Compressing for Low VC-Dimension | 2018-02-26 | Paper |
| Internal Compression of Protocols to Entropy | 2017-08-31 | Paper |
| Twenty (simple) questions | 2017-08-17 | Paper |
| Direct sum fails for zero error average communication | 2017-05-19 | Paper |
| Fooling Pairs in Randomized Communication Complexity | 2016-12-01 | Paper |
| Direct sum fails for zero-error average communication | 2016-11-29 | Paper |
| Labeled Compression Schemes for Extremal Classes | 2016-11-09 | Paper |
| On statistical learning via the lens of compression | 2016-10-11 | Paper |
| Simple and optimal randomized fault-tolerant rumor spreading | 2016-05-23 | Paper |
| A note on average-case sorting | 2016-03-02 | Paper |
| Node-Balancing by Edge-Increments | 2015-11-19 | Paper |
| Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces | 2015-07-09 | Paper |
| Sign rank versus VC dimension | 2015-03-26 | Paper |
| Shattering, graph orientations, and connectivity | 2014-08-14 | Paper |
| Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound | 2014-07-01 | Paper |
| Shattering-Extremal Systems | 2012-11-13 | Paper |
