Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S. & Stoye, J. (1999).
Finding Maximal Pairs with Bounded Gap. In M. Crochemore & M. Paterson (Eds.),
Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings (pp. 134-149). Springer.
https://doi.org/10.1007/3-540-48452-3_11
Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M.
& Sitchinava, N. (2019).
Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.),
27th Annual European Symposium on Algorithms, ESA 2019 Article 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.ESA.2019.2
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
Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016).
How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_17
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.
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
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
Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022).
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In X. Goaoc & M. Kerber (Eds.),
38th International Symposium on Computational Geometry, SoCG 2022 Article 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SoCG.2022.2
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
Afshani, P., Cheng, P., Basu Roy, A. & Wei, Z. (2023).
On Range Summary Queries. In K. Etessami, U. Feige & G. Puppis (Eds.),
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (pp. 7:1-7:17). Article 7 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ICALP.2023.7