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) 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 [2] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224
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. Lecture Notes in Computer Science Vol. 8486
https://doi.org/10.1007/978-3-319-07566-2_25
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. Lecture Notes in Computer Science Vol. 4698
https://doi.org/10.1007/978-3-540-75520-3_32
Alstrup, S.
, Brodal, G. S. & Rauhe, T. (2000).
Pattern matching in dynamic texts. In D. Shmoys (Ed.),
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.
Zardbani, F., Afshani, P. & Karras, P. (2020).
Revisiting the theory and practice of database cracking. In A. Bonifati, Y. Zhou, M. A. Vaz Salles, A. Bohm, D. Olteanu, G. Fletcher, A. Khan & B. Yang (Eds.),
Advances in Database Technology - EDBT 2020: 23rd International Conference on Extending Database Technology, Proceedings (pp. 415-418). openproceedings.org. Advances in Database Technology - EDBT Vol. 2020-March
https://doi.org/10.5441/002/edbt.2020.46
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. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
https://doi.org/10.1145/3534678.3539409
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. Lecture Notes in Computer Science Vol. 2380
https://doi.org/10.1007/3-540-45465-9_62
Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007).
The ComBack Method - Extending Hash Compaction with Backtracking. In
Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (pp. 455-464). Springer. Lecture Notes in Computer Science Vol. 4546
https://doi.org/10.1007/978-3-540-73094-1_26