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

Aranha, D. F. & Pagnin, E. (2019). The simplest multi-key linearly homomorphic signature scheme. In P. Schwabe & N. Thériault (Eds.), Progress in Cryptology – LATINCRYPT 2019 (pp. 280-300). Springer. https://doi.org/10.1007/978-3-030-30530-7_14

Lutze, M., Schuster, P. & Brachthäuser, J. I. (2025). The Simple Essence of Monomorphization. Proceedings of the ACM on Programming Languages , 9(OOPSLA1), Article 116. https://doi.org/10.1145/3720472

Tsitsulin, A., Munkhoeva, M., Mottin, D., Karras, P., Bronstein, A., Oseledets, I. & Müller, E. (2020). The Shape of Data: Intrinsic Distance for Data Distributions. Paper presented at The International Conference on Learning Representations (ICLR), Ababa, Ethiopia.

Andersen, P. B. & Brynskov, M. (2007). The semiotics of smart appliances and pervasive computing. In R. Gudwin & J. Queiroz (Eds.), Semiotics and Intelligent Systems Development (1 ed., pp. 211-256). Idea Group Publishing.

Gerhardy, P. (2005). The Role of Quantifier Alternations in Cut Elimination. Notre Dame Journal of Formal Logic, 46(2), 165-171.

Orlandi, C., Scholl, P. & Yakoubov, S. (2021). The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In A. Canteaut & F.-X. Standaert (Eds.), Advances in Cryptology – EUROCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 678-708). Springer. https://doi.org/10.1007/978-3-030-77870-5_24

Nayara Ortiz, J., Ricardo de Araujo, R., Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021). The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings. Entropy, 23(9), Article 1108. https://doi.org/10.3390/e23091108

Sun, X., Wang, C. & Yu, W. (2012). The Relationship between Inner Product and Counting Cycles. Lecture Notes in Computer Science, 7256, 643-654. https://doi.org/10.1007/978-3-642-29344-3_54

Atzeni, P., Jensen, C. S. ., Orsi, G., Ram, S., Tanca, L. Z. I. & Torlone, R. (2013). The relational model is dead, SQL is dead, and i don't feel so good myself. SIGMOD Record, 42(2), 64-68. https://doi.org/10.1145/2503792.2503808

Henderson, A. & Kyng, M. (1991). There is no place like home - continuing design in use. In J. Greenbaum & M. Kyng (Eds.), Design at Work: Cooperative Design of Computer Systems (pp. 219-240). Lawrence Erlbaum Associates.

Fink, D. I., Skowronski, M., Zagermann, J., Reinschluessel, A. V., Reiterer, H. & Feuchtner, T. (2024). There Is More to Avatars Than Visuals: Investigating Combinations of Visual and Auditory User Representations for Remote Collaboration in Augmented Reality. Proceedings of the ACM on Human-Computer Interaction, 8(ISS), 540-568. https://doi.org/10.1145/3698148

Danvy, O. & Goldberg, M. (2001). There and Back Again. B R I C S Report Series, (RS-01-39).

Danvy, O. & Goldberg, M. (2002). There and Back Again. In Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (pp. 230-234). Association for Computing Machinery. https://doi.org/10.1145/581478.581500

Danvy, O. & Goldberg, M. (2005). There and Back Again. Fundamenta Informaticae, 66(4), 397-413.

Danvy, O. & Goldberg, M. (2002). There and Back Again. B R I C S Report Series, (RS-02-12).

Hansen, K. A. (2017). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. In V. Bilò & M. Flammini (Eds.), Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings: 10th International Symposium, SAGT 2017 (pp. 119-130). Springer VS. https://doi.org/10.1007/978-3-319-66700-3_10

Hansen, K. A. (2019). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory of Computing Systems, 63(7), 1554-1571. https://doi.org/10.1007/s00224-018-9887-9

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A. & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages , 5(OOPSLA), Article 164. https://doi.org/10.1145/3485541

Brodal, G. S., Chaudhuri, S. & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. Nordic Journal of Computing, 3(4), 337-351.

Christensen, H. B. (1999). The Ragnarok Software Development Environment. Nordic Journal of Computing, 6(1), 4-21.

Christensen, H. B. (1999). The Ragnarok Architectural Software Configuration Management Model. In Proceedings of the 32nd Annual Hawaii International Conference on System Sciences, 1999. HICSS-32 IEEE Computer Society Press. https://doi.org/10.1109/HICSS.1999.773099

Afshani, P., Afrawal, M., Benjamin, D., Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012). The Query Complexity of Finding a Hidden Permutation. Electronic Colloquium on Computational Complexity, (TR12-087). http://eccc.hpi-web.de/report/2012/087/

Afshani, P., Agrawal, M., Benjamin, D., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-642-40273-9_1

Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2019). The query complexity of a permutation-based variant of Mastermind. Discrete Applied Mathematics, 260, 28-50. https://doi.org/10.1016/j.dam.2019.01.007

Arge, L., de Berg, M., Haverkort, H. & Yi, K. (2004). The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-tree. In G. Weikum, A. C. König & S. Dessloch (Eds.), Proceedings of ACM SIGMOD International Conference on Management of Data (pp. 347-358). Association for Computing Machinery. https://doi.org/10.1145/1007568.1007608

Arge, L., de Berg, M., Haverkort, H. & Yi, K. (2008). The Priority R-tree: A Practically Efficient and Worst-Case Optimal R-tree. A C M Transactions on Algorithms, 4(1). https://doi.org/10.1145/1328911.1328920

Madsen, M. (2022). The Principles of the Flix Programming Language. In Onward! 2022 - Proceedings of the 2022 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, co-located with SPLASH 2022 (pp. 112-127). Association for Computing Machinery. https://doi.org/10.1145/3563835.3567661

Braverman, V., Cohen-Addad, V., Jiang, S. H.-C., Krauthgamer, R., Schwiegelshohn, C., Toftrup, M. B. & Wu, X. (2022). The Power of Uniform Sampling for Coresets. In Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (pp. 462-473). IEEE. https://doi.org/10.1109/FOCS54457.2022.00051

Berlin, R., Borchorst, N. G., Mathiasen, N. R. & Svarre, T. (2008). The Potential of Genre Theory within E-Governance Web Applications. In J. J. Jensen (Ed.), Proceedings of the Eight Danish Human-Computer Interaction Research Symposium (pp. 19-22). Aalborg Universitetsforlag.

Møller, A. & Schwartzbach, M. I. (2001). The Pointer Assertion Logic Engine. In M. L. Sofia (Ed.), Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Vol. 36(5), pp. 221-231). Association for Computing Machinery. https://doi.org/10.1145/381694.378851

Billington, J., Christensen, S., Hee, K. V., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M., Aalst, W. M. P. V. D. (Ed.) & Best, E. (Ed.) (2003). The Petri Net Markup Language: Concepts, Technology, and Tools. In Ikke angivet (2679 of Lecture Notes in Computer Science ed., pp. 483-505). Springer.

Bardram, J. E., Adlam, T. (Ed.), Wactlar, H. (Ed.) & Korhonen, I. (Ed.) (2004). The Personal Medical Unit - A Ubiquitous Computing Infrastructure for Personal Pervasive Healthcare. In UbiHealth 2004: The 3nd International Workshop on Ubiquitous Computing for Pervasive Healthcare Applications (Nottingham, England ) UbiComp.org Community.

Jensen, C. S., Li, K.-J. & Winter, S. (2011). The other 87%: a report on The Second International Workshop on Indoor Spatial Awareness (San Jose, California - November 2, 2010). SIGSPATIAL Special, 3(1), 10-12. https://doi.org/10.1145/1966478.1966483

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Springer VS. Lecture Notes in Computer Science Vol. 9015 https://doi.org/10.1007/978-3-662-46497-7

Dodis, Y. & Nielsen, J. B. (Eds.) (2015). Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Springer VS. Lecture Notes in Computer Science Vol. 9014 https://doi.org/10.1007/978-3-662-46494-6

Damgård, I. B. (2006). Theory and Practice of Multiparty Computation. In R. De Prisco & M. Yung (Eds.), Security and Cryptography for Networks: 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006. Proceedings (pp. 360-364). Springer. https://doi.org/10.1007/11832072_25

Arge, L. A., Procopiuc, O., Ramaswamy, S., Suel, T. & Vitter, J. S. (1998). Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (pp. 685-694). Association for Computing Machinery.

Keller, M. (2012). Theory and practice of cryptographic protocols -or- cryptography: will it blend? Department of Computer Science, Aarhus University.

Balasch, J., Faust, S., Gierlichs, B. & Verbauwhede, I. (2012). Theory and Practice of a Leakage Resilient Masking Scheme. Lecture Notes in Computer Science, 7658, 758-775. https://doi.org/10.1007/978-3-642-34961-4_45

Birkedal, L., Dinsdale-Young, T., Guéneau, A., Jaber, G., Svendsen, K. & Tzevelekos, N. (2021). Theorems for free from separation logic specifications. Proceedings of the ACM on Programming Languages , 5(ICFP), Article 81. https://doi.org/10.1145/3473586

Assadi Soumeh, E., Van Milgen, J., Sloth, N. M., Corrent, E., Poulsen, H. D. & Norgaard, J. V. (2015). The optimum ratio of standardized ileal digestible leucine to lysine for 8 to 12 kg female pigs. Journal of Animal Science, 93(5), 2218-2224. https://doi.org/10.2527/jas.2014-8699

Wang, H., Schwefel, H.-P. & Toftegaard, T. S. (2008). The Optimal Joint Power and Rate Adaption for Mobile Multicast: A Theoretical Approach. In 2008 IEEE Sarnoff Symposium IEEE Computer Society Press. https://doi.org/10.1109/SARNOF.2008.4520061

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 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2024.22

Vindum, S. F., Georges, A. L. & Birkedal, L. (2025). The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logic. In K. Stark, A. Timany, S. Blazy & N. Tabareau (Eds.), Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with: POPL 2025 (pp. 83-97). Association for Computing Machinery, Inc.. https://doi.org/10.1145/3703595.3705876

Christensen, H. B. (2012). The Net4Care Platform. http://www.net4care.org

Caspersen, M. E. & Christensen, H. B. (2003). The Need for Killer Examples for Object-Oriented Frameworks. In OOPSLA Workshop "Killer Examples": Conference on Object Oriented Programming Systems Languages and Applications Association for Computing Machinery.

Klokmose, C. N. & Bertelsen, O. W. (2013). The Mysterious Whiteboard. In P. Kotzé , G. Marsden , G. Lindgaard, J. Wesson & M. Winckler (Eds.), Human-Computer Interaction – INTERACT 2013: 14th IFIP TC 13 International Conference, Cape Town, South Africa, September 2-6, 2013, Proceedings, Part II (pp. 37-54 ). Springer VS. https://doi.org/10.1007/978-3-642-40480-1_3

Ursem, R. K. & Justesen, P. (2010). The Multi-Objective Distinct Candidates Optimization approach. In B. Filipic & J. Silc (Eds.), Proceedings of the 4th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA 2010) (pp. 55-66). Ljublana: Jozef Stefan Institute.

Brian, G., Faonio, A., Obremski, M., Ribeiro, J., Simkin, M., Skorski, M. & Venturi, D. (2022). The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Transactions on Information Theory, 68(12), 8197-8227. https://doi.org/10.1109/TIT.2022.3193848

Dooms, G. & Katriel, I. (2006). The Minimum Spanning Tree Constraint. In F. Benhamou (Ed.), CP 2006 (pp. 152-166) https://doi.org/10.1007/11889205_13

Displaying results 601 to 650 out of 5702

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University