Department of Computer Science

Aarhus University Seal
 Department of Computer Science Research Publications

Publications

Sort by: Type and year

2015

Contribution to conference

Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J.-C. & Ejrnæs, R. (2015). Ecospace - a unified framework for understanding variation in biodiversity. Poster session presented at Biodiversitetssymposiet 2015, Aarhus , Denmark.
Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J.-C. & Ejrnæs, R. (2015). Ecospace - a unified framework for understanding variation in biodiversity. Poster session presented at International Congress for Conservation Biology, Montpellier, France.
Moeslund, J. E., Brunbjerg, A. K., Clausen, K. K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2015). Dark diversity illuminates the dim side of restoration. Poster session presented at International Congress for Conservation Biology, Montpellier, France.
Jones, M., Moeslund, J. E., Alexander, C., Bøcher, P. K. & Svenning, J.-C. (2013). Near-ground temperature variability and its predictability in Denmark. Poster session presented at Biodiversitetssymposium 2013, København, Denmark.
Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J.-C. (2009). The impacts of coastal squeezing on salt-meadow plant communities in Denmark. Poster session presented at Beyond Kyoto: Addressing the challenges of climate change, Aarhus, Denmark.

2008

Contribution to book anthology

Brodal, G. S. (2008). Cache-Oblivious Sorting. In M.-Y. Kao (Ed.), Encyclopedia of Algorithms (Vol. 3, pp. 126-129). Springer. https://doi.org/10.1007/978-0-387-30162-4_63
Caragiannis, I., Larsen, K. G. & Shyam, S. (2026). A New Lower Bound for Multicolor Discrepancy with Applications to Fair Division. In R. Lavi & J. Zhang (Eds.), Algorithmic Game Theory: 18th International Symposium, SAGT 2025, Bath, UK, September 2–5, 2025, Proceedings (pp. 228-246). Springer. https://doi.org/10.1007/978-3-032-03639-1_13
Sølvsten, S., Rysgaard, C. M. & van de Pol, J. (2025). Random Access on Narrow Decision Diagrams in External Memory. In T. Neele & A. Wijs (Eds.), Model Checking Software: 30th International Symposium, SPIN 2024, Luxembourg City, Luxembourg, April 8–9, 2024, Proceedings (pp. 137–145). Springer. https://doi.org/10.1007/978-3-031-66149-5_7
Brodal, G. S. & Rysgaard, C. M. (2025). Pure Binary Finger Search Trees. In I.-O. Bercea & R. Pagh (Eds.), 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025 (pp. 172-195). Society for Industrial and Applied Mathematics.
Cohen-Addad, V., Draganov, A., Russo, M., Saulpic, D. & Schwiegelshohn, C. (2025). A Tight VC-Dimension Analysis of Clustering Coresets with Applications. In Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025 (pp. 4783-4808). Association for Computing Machinery.
da Cunha, A., Larsen, K. G. & Ritzert, M. (2025). Boosting, Voting Classifiers and Randomized Sample Compression Schemes. In G. Kamath & P. L. Loh (Eds.), Proceedings of Machine Learning Research (Vol. 272, pp. 390-404). MLResearch Press.
Biniaz, A., Maheshwari, A., Merrild, M. C. R., Mitchell, J. S. B., Odak, S., Polishchuk, V., Robson, E. W., Rysgaard, C. M., Schou, J. K. R., Shermer, T., Spalding-Jamieson, J., Svenning, R. & Zheng, D. W. (2025). Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. In O. Aichholzer & H. Wang (Eds.), 41st International Symposium on Computational Geometry, SoCG 2025 (pp. 20:1-20:21). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2025.20
Karthik, C. S., Lee, E., Rabani, Y., Schwiegelshohn, C. & Zhou, S. (2025). On Approximability of l22Min-Sum Clustering. In O. Aichholzer & H. Wang (Eds.), 41st International Symposium on Computational Geometry, SoCG 2025 Article 62 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2025.62
Afshani, P., Nekrich, Y. & Staals, F. (2025). Convexity Helps Iterated Search in 3D. In O. Aichholzer & H. Wang (Eds.), 41st International Symposium on Computational Geometry, SoCG 2025 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2025.3
Cohen-Addad, V., Grandoni, F., Lee, E., Schwiegelshohn, C. & Svensson, O. (2025). A (2+ϵ)-Approximation Algorithm for Metric κ-Median. In M. Koucký & N. Bansal (Eds.), STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 615-624). Association for Computing Machinery. https://doi.org/10.1145/3717823.3718299
Cohen-Addad, V., Lattanzi, S. & Schwiegelshohn, C. (2025). Almost Optimal PAC Learning for k-Means. In M. Koucky & N. Bansal (Eds.), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 2019-2030). Association for Computing Machinery. https://doi.org/10.1145/3717823.3718180
Brodal, G. S. (2025). A Simple Integer Successor-Delete Data Structure. In P. Mutzel & N. Prezza (Eds.), 23rd International Symposium on Experimental Algorithms, SEA 2025 Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SEA.2025.8
Høgsgaard, M. M. & Larsen, K. G. (2025). Improved Margin Generalization Bounds for Voting Classifiers. In Proceedings of Thirty Eighth Conference on Learning Theory (Vol. 291, pp. 2822-2855). PMLR. https://proceedings.mlr.press/v291/hogsgaard-moller25a.html
Høgsgaard, M. M. (2025). Efficient Optimal PAC Learning. In Proceedings of The 36th International Conference on Algorithmic Learning Theory (pp. 578-580). PMLR.
Asilis, J., Høgsgaard, M. M. & Velegkas, G. (2025). Understanding Aggregations of Proper Learners in Multiclass Classification. In Proceedings of The 36th International Conference on Algorithmic Learning Theory (pp. 89-111). PMLR.
Afshani, P., Buchin, M., Driemel, A., Richter, M. & Wong, S. (2025). Property Testing of Curve Similarity. In A. Benoit, H. Kaplan, S. Wild, S. Wild & G. Herman (Eds.), 33rd Annual European Symposium on Algorithms, ESA 2025 Article 84 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2025.84
Brodal, G. S., Rysgaard, C. M. & Svenning, R. (2025). Buffered Partially-Persistent External-Memory Search Trees. In A. Benoit, H. Kaplan, S. Wild, S. Wild & G. Herman (Eds.), 33rd Annual European Symposium on Algorithms, ESA 2025 Article 82 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2025.82
Brodal, G. S., Iacono, J., Meyer, U., Sitchinava, N., Goodrich, M. T., Lo, J., Pagan, V. & Svenning, R. (2025). External-Memory Priority Queues with Optimal Insertions. In A. Benoit, H. Kaplan, S. Wild, S. Wild & G. Herman (Eds.), 33rd Annual European Symposium on Algorithms, ESA 2025 Article 5 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2025.5
Rysgaard, C. M. & Wild, S. (2025). Lazy B-Trees. In P. Gawrychowski, F. Mazowiecki & M. Skrzypczak (Eds.), 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025 Article 87 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2025.87
Burkhardt, J., Keller, H. J., Orlandi, C. & Schwiegelshohn, C. (2025). Distributed Differentially Private Data Analytics via Secure Sketching. In Forty-second International Conference on Machine Learning: ICML 2025 (Vol. 267, pp. 5913-5942). Article 10733 https://openreview.net/forum?id=2Snksn3U47
Afshani, P. & Sitchinava , N. (2025). A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM. In ACACM-SIAM Symposium on Discrete Algorithms, SODA 2025 (pp. 3998-4008). Association for Computing Machinery. https://doi.org/10.1137/1.9781611978322.136
Afshani, P., Storandt, S. & Bosch, Y. (2025). Circle-Segment Intersection Queries in Connected Geometric Graphs. In 36th International Symposium on Algorithms and Computation (ISAAC 2025) (pp. 3:1-3:16). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2025.3
Gao, J., Jayaram, R., Kolbe, B., Sapir, S., Schwiegelshohn, C., Silwal, S. & Waingarten, E. (2025). Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures. In Proceedings of the 42nd International Conference on Machine Learning (Vol. 267, pp. 18363-18385)
Høgsgaard, M. M. & Paudice, A. (2025). Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means. In Proceedings of the 42nd International Conference on Machine Learning (Vol. 267, pp. 23357-23381)
Larsen, K. G. & Simkin, M. (2025). Time/Space Tradeoffs for Generic Attacks on Delay Functions. In Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part IV (pp. 451-477). Springer. https://doi.org/10.1007/978-3-032-12290-2_15
Bringmann, K., Larsen, K. G., Nusser, A., Rotenberg, E. & Wang, Y. (2025). Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. In 41st International Symposium on Computational Geometry (SoCG 2025) (Vol. 332, pp. 25:1-25:16). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2025.25
Larsen, K. G. & Schalburg, N. (2025). Tight Generalization Bounds for Large-Margin Halfspaces. In The Thirty-ninth Annual Conference on Neural Information Processing Systems https://openreview.net/forum?id=wAq0ZLxrGq
Paudice, A., Høgsgaard, M. M., da Cunha, A. & Sun, Y. (2025). Revisiting Agnostic Boosting. In The Thirty-Ninth Annual Conference on Neural Information Processing Systems
Karbasi, A. & Larsen, K. G. (2024). The Impossibility of Parallelizing Boosting. In Proceedings of Machine Learning Research (Vol. 237, pp. 635-653)
Brodal, G. S. & Wild, S. (2024). Deterministic Cache-Oblivious Funnelselect. In H. L. Bodlaender (Ed.), 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 Article 17 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SWAT.2024.17
Brodal, G. S. (2024). Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. In A. Z. Broder & T. Tamir (Eds.), 12th International Conference on Fun with Algorithms, FUN 2024 Article 6 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2024.6
Brewer, B., Brodal, G. S. & Wang, H. (2024). Dynamic Convex Hulls for Simple Paths. In W. Mulzer & J. M. Phillips (Eds.), 40th International Symposium on Computational Geometry, SoCG 2024 Article 24 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2024.24
Larsen, K. G., Pagh, R., Persiano, G., Pitassi, T., Yeo, K. & Zamir, O. (2024). Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. In K. Bringmann, M. Grohe, G. Puppis & O. Svensson (Eds.), 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024 Article 104 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2024.104
Larsen, K. G. (2024). From TCS to Learning Theory. In R. Kralovic & A. Kucera (Eds.), 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2024.4
Alon, N., Grønlund, A., Jørgensen, S. F. & Larsen, K. G. (2024). Sublinear Time Shortest Path in Expander Graphs. In R. Kralovic & A. Kucera (Eds.), 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024 (pp. 8:1-8:13). Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2024.8
Brodal, G. S., Fagerberg, R. & Rysgaard, C. M. (2024). On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. In T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms, ESA 2024 Article 35 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2024.35
Fleischhacker, N., Larsen, K. G., Obremski, M. & Simkin, M. (2024). Invertible Bloom Lookup Tables with Less Memory and Randomness. In T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms, ESA 2024 Article 54 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2024.54
Schou, J. K. R. & Wang, B. (2024). PersiSort: A New Perspective on Adaptive Sorting Based on Persistence. In R. I. Nishat (Ed.), Canadian Conference on Computational Geometry: Proceedings of the 36th Canadian Conference on Computational Geometry (CCCG 2024) Brock University, St. Catharines, Canada, July 17 - 19, 2024 (pp. 287-312)
Bringmann, K., Grønlund, A., Künnemann, M. & Larsen, K. G. (2024). The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. In V. Guruswami (Ed.), 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) (pp. 22:1-22:25). Article 22 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2024.22
Larsen, K. G. (2024). Bagging is an Optimal PAC Learner (Extended Abstract). In K. Larson (Ed.), Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI-24) (pp. 8411-8415). IJCAI Organization. https://doi.org/10.24963/ijcai.2024/932
Kalavasis, A., Karbasi, A., Larsen, K. G., Velegkas, G. & Zhou, F. (2024). Replicable Learning of Large-Margin Halfspaces. In Proceedings of the 41 st International Conference on Machine Learning (Vol. 235, pp. 22861-22878). MLResearch Press.
Hanneke, S., Larsen, K. G. & Zhivotovskiy, N. (2024). Revisiting Agnostic PAC Learning. In Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024 (pp. 1968-1982). IEEE. https://doi.org/10.1109/FOCS61266.2024.00118
Afshani, P. & Schwiegelshohn, C. (2024). Optimal Coresets for Low-Dimensional Geometric Median. In International Conference on Machine Learning (pp. 262-270). PMLR.
Høgsgaard, M. M., Kamma, L., Larsen, K. G., Nelson, J. & Schwiegelshohn, C. (2024). Sparse Dimensionality Reduction Revisited. In International Conference on Machine Learning (pp. 18454-18469). PMLR.
Aden-Ali, I., Høgsgaard, M. M., Larsen, K. G. & Zhivotovskiy, N. (2024). Majority-of-Three: The Simplest Optimal Learner? In Proceedings of Thirty Seventh Conference on Learning Theory (Vol. 247, pp. 22-45). PMLR. https://proceedings.mlr.press/v247/aden-ali24a.html

Displaying results 51 to 100 out of 451

Previous

1

2

3

4

5

6

7

8

9

10

Next

Head of research

Revised 01.09.2025