Cohen-Addad, V., Epasto, A., Lattanzi, S., Mirrokni, V., Munoz Medina, A., Saulpic, D.
, Schwiegelshohn, C. & Vassilvitskii, S. (2022).
Scalable Differentially Private Clustering via Hierarchically Separated Trees. In
KDD 2022 - Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 221-230). Association for Computing Machinery, Inc.
https://doi.org/10.1145/3534678.3539409
Grønlund, A., Kamma, L., Larsen, K. G., Mathiasen, A. & Nelson, J. (2019).
Margin-Based Generalization Lower Bounds for Boosted Classifiers. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox & R. Garnett (Eds.),
Advances in Neural Information Processing Systems 32 (NIPS 2019) (Vol. 32). Neural Information Processing Systems Foundation.
https://arxiv.org/abs/1909.12518
Jørgensen, A. G., Brodal, G. S., Moruz, G., Mølhave, T., Fagerberg, R., Finocchi, I., Grandoni, F. & Italiano, G. F. (2007).
Optimal Resilient Dynamic Dictionaries. In L. Arge, M. Hoffmann & E. Welzl (Eds.),
Algorithms – ESA 2007: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings (pp. 347-358). Springer.
https://doi.org/10.1007/978-3-540-75520-3_32
Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K. & Yoon, J. (2013).
I/O-Efficient Planar Range Skyline and Attrition Priority Queues. In R. Hull & W. Fan (Eds.),
Proceedings of the 32nd symposium on Principles of database systems , PODS '13 (pp. 103-114 ). Association for Computing Machinery.
https://doi.org/10.1145/2463664.2465225
Larsen, K. G., Munro, J. I.
, Nielsen, J. A. S. & Thankachan, S. V. (2014).
On Hardness of Several String Indexing Problems. In A. Kulikov, S. O. Kuznetsov & P. Pevzner (Eds.),
Combinatorial Pattern Matching: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (pp. 242-251 ). Springer VS.
https://doi.org/10.1007/978-3-319-07566-2_25