[15] Vladimir Braverman, Avinatan Hassidim, Yossi Matias, Mariano Schain, Sandeep Silwal, and Samson Zhou. Adversarial robustness of streaming algorithms through importance sampling. In Advances in Neural Information Processing Systems (NeurIPS), 2021. A
[16] Nicolò Cesa-Bianchi, Ofer Dekel, and Ohad Shamir. Online learning with switching costs and other adaptive adversaries. In Advances in Neural Information Processing Systems (NIPS), 2013. A
[17] Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, learning, and games. Cambridge university press, 2006. 1.2, A
[18] Amit Chakrabarti, Prantar Ghosh, and Manuel Stoeckl. Adversarily robust coloring for graph streams. In 13th Innovations in Theoretical Computer Science Conference (ITCS), 2022. A
[19] Yeshwanth Cherapanamjeri and Jelani Nelson. On adaptive distance estimation. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS, 2020. A
[20] Yeshwanth Cherapanamjeri and Jelani Nelson. Uniform approximations for randomized hadamard transforms with applications. In STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 659-671, 2022. A
[21] Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou. Robust algorithms on adaptive inputs from bounded adversaries. In 11th International Conference on Learning Representations, ICLR, Conference Track Proceedings, 2023. A
[22] Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, and Uri Stemmer. On the robustness of countsketch to adaptive inputs. In International Conference on Machine Learning, ICML, pages 4112-4140, 2022. A
[23] Thomas M Cover. Universal portfolios. Mathematical finance, 1(1):1-29, 1991. 1.2
[24] Thomas M. Cover and Erik Ordentlich. Universal portfolios with side information. IEEE Trans. Inf. Theory, 42(2):348-363, 1996. 1.2
[25] Daniela Pucci de Farias and Nimrod Megiddo. Combining expert advice in reactive environments. J. ACM, 53(5):762-799, 2006. A
[26] Ofer Dekel, Jian Ding, Tomer Koren, and Yuval Peres. Bandits with switching costs:  $T^{2/3}$  regret. In Annual ACM Symposium on Theory of Computing (STOC), 2014. A
[27] Ofer Dekel, Ambuj Tewari, and Raman Arora. Online bandit learning against an adaptive adversary: from regret to policy regret. In Proceedings of the 29th International Conference on Machine Learning (ICML), 2012. A
[28] Itai Dinur, Uri Stemmer, David P. Woodruff, and Samson Zhou. On differential privacy and adaptive data analysis with bounded space. CoRR, abs/2302.05707, 2023. A
[29] Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Aaron Leon Roth. Preserving statistical validity in adaptive data analysis. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC), 2015. 2.4
[30] Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam D. Smith. Calibrating noise to sensitivity in private data analysis. In Third Theory of Cryptography Conference (TCC), 2006. 2.1
[31] Cynthia Dwork, Guy N. Rothblum, and Salil P. Vadhan. Boosting and differential privacy. In 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2010. 2.3
[32] Yoav Freund and Robert E Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997. 1.2