| Detecting correlations with little memory and communication Y Dagan, O Shamir Conference On Learning Theory, 1145-1198, 2018 | 29 | 2018 |
| Optimality of maximum likelihood for log-concave density estimation and bounded convex regression G Kur, Y Dagan, A Rakhlin arXiv preprint arXiv:1903.05315, 2019 | 27* | 2019 |
| Adversarial laws of large numbers and optimal regret in online classification N Alon, O Ben-Eliezer, Y Dagan, S Moran, M Naor, E Yogev Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 22 | 2021 |
| Learning from weakly dependent data under Dobrushin’s condition Y Dagan, C Daskalakis, N Dikkala, S Jayanti Conference on Learning Theory, 914-928, 2019 | 21 | 2019 |
| Learning Ising models from one or multiple samples Y Dagan, C Daskalakis, N Dikkala, AV Kandiros Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 16* | 2021 |
| Space lower bounds for linear prediction in the streaming model Y Dagan, G Kur, O Shamir Conference on Learning Theory, 929-954, 2019 | 16* | 2019 |
| A bounded-noise mechanism for differential privacy Y Dagan, G Kur arXiv preprint arXiv:2012.03817, 2020 | 10 | 2020 |
| Twenty (simple) questions Y Dagan, Y Filmus, A Gabizon, S Moran Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 9-21, 2017 | 9 | 2017 |
| Pac learning with stable and private predictions Y Dagan, V Feldman Conference on Learning Theory, 1389-1410, 2020 | 7 | 2020 |
| A better resource allocation algorithm with semi-bandit feedback Y Dagan, C Koby Algorithmic Learning Theory, 268-320, 2018 | 7 | 2018 |
| Majorizing measures, sequential complexities, and online learning A Block, Y Dagan, A Rakhlin Conference on Learning Theory, 587-590, 2021 | 6 | 2021 |
| Interaction is necessary for distributed learning with privacy or communication constraints Y Dagan, V Feldman Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 5 | 2020 |
| Trading information complexity for error Y Dagan, Y Filmus, H Hatami, Y Li arXiv preprint arXiv:1611.06650, 2016 | 5 | 2016 |
| Twenty (short) questions Y Dagan, Y Filmus, A Gabizon, S Moran Combinatorica 39 (3), 597-626, 2019 | 4 | 2019 |
| Statistical estimation from dependent data V Kandiros, Y Dagan, N Dikkala, S Goel, C Daskalakis International Conference on Machine Learning, 5269-5278, 2021 | 3 | 2021 |
| The entropy of lies: playing twenty questions with a liar Y Dagan, Y Filmus, D Kane, S Moran arXiv preprint arXiv:1811.02177, 2018 | 3 | 2018 |
| Proactive rerouting in network overlays R Cohen, Y Dagan, G Nakibly 2018 IFIP Networking Conference (IFIP Networking) and Workshops, 1-9, 2018 | 1 | 2018 |
| Twenty questions game using restricted sets of questions Y Dagan, Y Filmus Computer Science Department, Technion, 2018 | 1 | 2018 |
| Statistical Estimation from Dependent Data Y Dagan, C Daskalakis, N Dikkala, S Goel, AV Kandiros arXiv preprint arXiv:2107.09773, 2021 | | 2021 |
| Generalization and Learning Under Dobrushin's Condition Y Dagan, C Daskalakis, N Dikkala, S Jayanti 32nd Annual Conference on Learning Theory, 2019 | | 2019 |
