Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_18

Larsen, K. G., Nelson, J., Huy L Nguyen & Thorup, M. (2019). Heavy Hitters via Cluster-Preserving Clustering. Communications of the ACM, 62(8), 95-100. https://doi.org/10.1145/3339185

Larsen, K. G. (2014). ON range searching in the group model and combinatorial discrepancy. S I A M Journal on Computing, 43(2), 673-686. https://doi.org/10.1137/120865240

Larsen, K. G., Malkin, T., Weinstein, O. & Yeo, K. (2020). Lower Bounds for Oblivious Near-Neighbor Search. In S. Chawla (Ed.), SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1116-1134). Society for Industrial and Applied Mathematics. https://doi.org/10.5555/3381089.3381157

Larsen, K. G. (2019). Constructive Discrepancy Minimization with Hereditary L2 Guarantees. In R. Niedermeier & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) Article 48 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2019.48

Larsen, M. R. E., Han, W. & Schulz, H.-J. (2020). Sketchy Rendering to Aid the Recollection of Regular Visualizations. In EuroVis 2020: Short Papers (pp. 139-143). Eurographics Association. https://doi.org/10.2312/evs.20201062

Larsen, K. G., Mitzenmacher, M. & Tsourakakis, C. E. (2020). Optimal Learning of Joint Alignments with a Faulty Oracle. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 (pp. 2492-2497). IEEE. https://doi.org/10.1109/ISIT44484.2020.9174310

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Larsen, K. G., Starup, J. L. & Steensgaard, J. (2021). Further Unifying the Landscape of Cell Probe Lower Bounds. 224-231. Paper presented at Happening virtually , -. https://cs.au.dk/~larsen/papers/FurtherUnifying.pdf

Larsen, K. G., Pagh, R. & Tetek, J. (2021). CountSketches, Feature Hashing and the Median of Three. In M. Meila & T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021 (pp. 6011-6020) http://proceedings.mlr.press/v139/larsen21a.html

Larsen, K. G. & Ritzert, M. (2022). Optimal Weak to Strong Learning. arxiv.org. https://doi.org/10.48550/arXiv.2206.01563

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Larsen, K. G. (2023). Bagging is an Optimal PAC Learner. In G. Neu & L. Rosasco (Eds.), Proceedings of COLT 2023 (Vol. 195, pp. 450-468). MLResearch Press.

Larsen, K. G. (2023). Fast Discrepancy Minimization with Hereditary Guarantees. In N. Bansal & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 276-289). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch11

Larsen, C. A., Schmidt, S. M., Steensgaard, J., Jakobsen, A. B., Pol, J. V. D. & Pavlogiannis, A. (2023). A Truly Symbolic Linear-Time Algorithm for SCC Decomposition. In S. Sankaranarayanan & N. Sharygina (Eds.), Tools and Algorithms for the Construction and Analysis of Systems: 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II (pp. 353-371). Springer. https://doi.org/10.1007/978-3-031-30820-8_22

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

Larsen, K. G. & Yu, H. (2023). Super-Logarithmic Lower Bounds for Dynamic Graph Problems. In Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023 (pp. 1589-1604). IEEE. https://doi.org/10.1109/FOCS57990.2023.00096

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

Larsen, K. G. (2013). Models and Techniques for Proving Data Structure Lower Bounds. Department of Computer Science, Aarhus University.

Larsen, S. B. (2006). Pervasive Home Care - Technological support for treatment of diabetic foot ulcers at home.

Larsen, K. G. & Simkin, M. (2026). Time/Space Tradeoffs for Generic Attacks on Delay Functions. In B. Applebaum & H. Lin (Eds.), 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

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

Larsen, K. G. & Yu, H. (2026). SUPER-LOGARITHMIC LOWER BOUNDS FOR DYNAMIC GRAPH PROBLEMS. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (3 ed., Vol. 55, pp. FOCS23-42-FOCS23-69) https://doi.org/10.1137/24M1638215

Laoudias, C., Nikitin, A., Karras, P., Youssef, M. & Zeinalipour-Yazti, D. (2021). Indoor Quality-of-Position Visual Assessment Using Crowdsourced Fingerprint Maps. ACM Transactions on Spatial Algorithms and Systems, 7(2), Article 10. https://doi.org/10.1145/3433026

Lanng, H., Lykkegaard, A., Thornholm, S., Tzannis, P. & Verdezoto, N. (2016). PeaceKeeper: Augmenting the Awareness and Communication of Noise Pollution in Student Dormitories. In Proceedings of the 7th Augmented Human International Conference, AH 2016: AH '16 Article 39 Association for Computing Machinery. https://doi.org/10.1145/2875194.2875218

Lange, M. (2007). Three Notes on the Complexity of Model Checking Fixpoint Logic with Chop. R.A.I.R.O. - Theoretical Informatics and Applications.

Lange, M. (2007). Linear Time Logics around PSL: Complexity, Expressiveness, and a little bit of Succinctness. In Proc. of the 18th Int. Conf. on Concurrency Theory (Vol. LNCS 4703, pp. 90-104). Springer.

Lange, M., Thulesen, J., Feldt-Rasmussen, U., Skakkebaek, N. E., Vahl, N., Jørgensen, J. O. L., Christiansen, J. S., Poulsen, S. S., Sneppen, S. E. B. & Juul, A. (2001). Skin morphological changes in growth hormone deficiency and acromegaly. European Journal of Endocrinology, 145(2), 147-53.

Langdal, J., Kjærgaard, M. B., Toftkjær, T. & Schougaard, K. R. (2010). Exposing Position Uncertainty in Middleware. In S. Terzis & L. Veiga (Eds.), Proceedings of the Second International Workshop on Middleware for Pervasive Mobile and Embedded Computing (M-MPAC 2010) (pp. Article no. 1). Association for Computing Machinery. https://doi.org/10.1145/1890791.1890792

Landis, D. & Schwartzbach, N. (2023). Stackelberg Attacks on Auctions and Blockchain Transaction Fee Mechanisms. In K. Gal, K. Gal, A. Nowe, G. J. Nalepa, R. Fairstein & R. Radulescu (Eds.), ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings (pp. 2073-2080). IOS Press. https://doi.org/10.3233/FAIA230501

Lampropoulos, K., Zardbani, F., Mamoulis, N. & Karras, P. (2023). Adaptive Indexing in High-Dimensional Metric Spaces. Proceedings of the VLDB Endowment, 16(10), 2525-2537. https://doi.org/10.14778/3603581.3603592

Lämmel, R. & Ostermann, K. (2006). Software extension and integration with type classes: A tutorial for functional and OO programmers. In S. Jarzabek, D. C. Schmidt & T. L. Veldhuizen (Eds.), Generative Programming and Component Engineering '06: Proceedings of the 5th international conference on Generative programming and component engineering (pp. 161-170). Association for Computing Machinery.

Lambov, B. Z. (2003). A Two Layer Approach to the Computability and Complexity of Real Functions. In Computability and Complexity in Analysis 2003 (302 of Informatic Berichte ed., pp. 279-302). Fern-Universität Hagen.

Lambov, B. Z. (2005). RealLib: an Efficient Implementation of Exact Real Arithmetic. In T. Grubba, P. Hertling, H. Tsuiki & K. Weihrauch (Eds.), econd International Conference on Computability and Complexity in Analysis, CCA 2005 Proceedings (Kyoto, Japan, August 25-29, 2005) (pp. 169-175)

Lambov, B. Z. (2005). Complexity and Intensionality in a Type-1 Framework for Computable Analysis. In C.-H. L. Ong (Ed.), Computer Science Logic, 19th International Workshop, CSL 2005 Proceedings, 14th Annual Conference of the EACSL (Oxford, UK, August 22-25, 2005) (pp. 442-461). Springer LNCS.

Lambov, B. Z. (2005). Rates of Convergence of Recursively Defined Sequences. Electronic Notes in Computer Science, 120, 125-133.

Lambov, B. Z. (2006). Topics in the Theory and Practice of Computable Analysis.

Lambertini, M., Magnani, M., Marzolla, M., Montesi, D. & Paolino, C. (2014). Large-Scale Social Network Analysis. In A. Gkoulalas-Divanis & A. Labbi (Eds.), Large scale data analytics (pp. 155-187). Springer. https://doi.org/10.1007/978-1-4614-9242-9

Lamanna, C., Blonder, B., Violle, C., Kraft, N., Sandel, B. S., Simova, I., Donoghue, J., Svenning, J.-C., McGill, B., Boyle, B., Buzzard, V., Dolins, S., Jorgensen, P., Marcuse-Kubitza, A., Morueta-Holme, N., Peet, R., Piel, W., Regetz, J., Schildhauer, M. ... Enquist, B. (2014). Functional trait space and the latitudinal diversity gradient. Proceedings of the National Academy of Sciences (PNAS), 111(38), 13745-13750. http://www.pnas.org/content/111/38/13745.full.pdf+html

Lam, T.-W., Lee, L. K., To, I. K. K. & Wong, P. W. H. (2013). Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. Algorithmica, 65(3), 605-633 . https://doi.org/10.1007/s00453-012-9613-y

Lakos, C. & Kristensen, L. M. (2005). State Space Exploration of Object-Based Systems using Equivalence Reduction and the Sweep-line Method. In Third International Symposium on Automated Technology for Verification and Analysis (pp. 187-201). Springer LNCS.

Lahire, P., Arévalo, G., Astudillo, H., Black, A. P., Ernst, E., Huchard, M., Oplustil, T., Sakkinen, M. & Valtchev, P. (Eds.) (2004). MASPEGHI 2004 - Mechanisms for Specialization, Generalization, and Inheritance. In B. M. Østvold & J. Malenfant (Eds.), Object-Oriented Technology. ECOOP 2004 Workshop Reader: ECOOP 2004 Workshops, Oslo, Norway, June 14-18, 2004, Final Reports (pp. 101-117). Springer. https://doi.org/10.1007/978-3-540-30554-5_11

Lacerda, F. G., Renes, J. M. & Scholz, V. B. (2016). Coherent state constellations for Bosonic Gaussian channels. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 2499-2503). Article 7541749 IEEE. https://doi.org/10.1109/ISIT.2016.7541749

Lacerda, F., Renes, J. M. & Scholz, V. B. (2017). Coherent-state constellations and polar codes for thermal Gaussian channels. Physical Review A, 95(6), Article 062343. https://doi.org/10.1103/PhysRevA.95.062343

Kyster, A. F., Nielsen, S. D., Hermanns, J., Mottin, D. & Karras, P. (2021). Boosting Graph Alignment Algorithms. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM '21) (pp. 3166-3170). Association for Computing Machinery. https://doi.org/10.1145/3459637.3482067

Kyster, A., Nielsen, F. H., Oechsner, S. & Scholl, P. (2025). Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. In M. Blanton, W. Enck & C. Nita-Rotaru (Eds.), 2025 IEEE Symposium on Security and Privacy (SP) (pp. 2491-2508). IEEE. https://doi.org/10.1109/SP61157.2025.00176

Kyng, M., Büscher, M. & Mogensen, P. H. (2004). Integrated Conceptual Framework. Palcom External Reports, (11).

Kyng, M., Kristensen, M. & Christensen, E. F. (2007). Wireless Distribution and Use of Bio-sensor Data. Prehospital and Disaster Medicine, (2).

Displaying results 1951 to 2000 out of 5998

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University