Brodal, G. S., Lyngsø, R. B., Östlin, A.
& Pedersen, C. N. S. (2002).
Solving the String Statistics Problem in Time O(n log n). In P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (Eds.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (pp. 728-739). Springer.
https://doi.org/10.1007/3-540-45465-9_62
Brodal, G. S., Rysgaard, C. M., Schou, J. K. R. & Svenning, R. (2023).
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. In P. Morin & S. Suri (Eds.),
Algorithms and Data Structures: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings (pp. 644-659). Springer.
https://doi.org/10.1007/978-3-031-38906-1_43
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (Ed.), Spirakis, P. G. (Ed.) & Leeuwen, J. V. (Ed.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science ed., Vol. 2076/2001, pp. 140-151). Springer.
Cohen-Addad, V.
, Larsen, K. G., Saulpic, D.
, Schwiegelshohn, C. & Sheikh-Omar, O. A. (2022).
Improved Coresets for Euclidean k-Means. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho & A. Oh (Eds.),
Advances in Neural Information Processing Systems 35 - 36th Conference on Neural Information Processing Systems, NeurIPS 2022 Neural Information Processing Systems Foundation.
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
Fleischhacker, N.
, Larsen, K. G. & Simkin, M. (2023).
How to Compress Encrypted Data. In C. Hazay & M. Stam (Eds.),
Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I (pp. 551-577). Springer.
https://doi.org/10.1007/978-3-031-30545-0_19
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