| Interactive algorithms: from pool to stream S Sabato, T Hess Conference on Learning Theory, 1419-1439, 2016 | 18 | 2016 |
| Sequential no-substitution k-median-clustering T Hess, S Sabato International Conference on Artificial Intelligence and Statistics, 962-972, 2020 | 6 | 2020 |
| A constant approximation algorithm for sequential no-substitution k-median clustering under a random arrival order T Hess, M Moshkovitz, S Sabato | 5 | 2021 |
| Interactive algorithms: Pool, stream and precognitive stream S Sabato, T Hess Journal of Machine Learning Research 18 (229), 1-39, 2018 | 5 | 2018 |
| A constant approximation algorithm for sequential random-order no-substitution k-median clustering T Hess, M Moshkovitz, S Sabato Advances in Neural Information Processing Systems 34, 3298-3308, 2021 | 3 | 2021 |
| Fast distributed k-means with a small number of rounds T Hess, R Visbord, S Sabato International Conference on Artificial Intelligence and Statistics, 850-874, 2023 | 2 | 2023 |
| The submodular secretary problem under a cardinality constraint and with limited resources T Hess, S Sabato CoRR, vol. abs/1702.03989, 2017 | 2 | 2017 |
| Selecting with History T Hess, S Sabato arXiv preprint arXiv:1702.03989, 2017 | | 2017 |
