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

Biernacki, D. (2005). The Theory and Practice of Programming Languages with Delimited Continuations. Aarhus Universitet.

Damgård, I. B., Groth, J., Salomonsen, G. & Gritzalis, D. (Ed.) (2002). The Theory and Implementation of Electronic Voting Systems. In Secure Electronic Voting (Vol. 7, pp. 77-100). Kluwer Academic Publishers.

Corry, A. V. & Søndergaard, B. D. (2011). The Teaching Portfolio. Developing Good Teachers and Scientists, 1.

Kyng, M. (1991). The System Work Group Computer Science Department Aarhus University. In CHI '91 Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology (pp. 477-478). Association for Computing Machinery. https://doi.org/10.1145/108844.109011

Jensen, K., Kristensen, L. M. & Mailund, T. (2012). The sweep-line state space exploration method. Theoretical Computer Science, 429, 169–179. https://doi.org/10.1016/j.tcs.2011.12.036

Verbin, E. & Yu, W. (2011). The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2011 (pp. 11-25). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_002_verbine.pdf

Corry, A. V., Gjerlufsen, T. & Olsen, J. W. (2005). The Stone: Digital Support for (Un)common Pregnancies. In 3rd Scandinavian conference on Health Informatics (3 ed., pp. 37-41). Aalborg University.

Aranha, D. F., Engelmann, F. T., Kolby, S. & Yakoubov, S. (2022). The State of the Union: Union-Only Signatures for Data Aggregation. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 387-410). Springer. https://doi.org/10.1007/978-3-031-14791-3_17

Hogräfer, M., Heitzler, M. & Schulz, H.-J. (2020). The State of the Art in Map‐Like Visualization. Computer Graphics Forum, 39(3), 647-674. https://doi.org/10.1111/cgf.14031

Sand, A. & Steel, M. (2013). The standard lateral gene transfer model is statistically consistent for pectinate four-taxon trees. Journal of Theoretical Biology, 335, 295-298. https://doi.org/10.1016/j.jtbi.2013.07.002

Rasmusson, A., Hahn, U., Larsen, J. O., Gundersen, H. J. G., Jensen, E. B. V. & Nyengaard, J. R. (2013). The spatial rotator. Journal of Microscopy, 250(2), 88-100. https://doi.org/10.1111/jmi.12022

Rasmusson, A. (2009). The Spatiale Rotator. In V. Capasso et al., Ed. (Ed.), Stereology and Image Analysis. Ecs10: Proceeding of the 10th European Conference of ISS. (Vol. 4). ESCULAPIO Pub. Co, Bologna. http://newrobin.mat.unimi.it/OCS/index.php/ECS/ecs10/paper/view/199

Wei, Z. & Yi, K. (2013). The Space Complexity of 2-Dimensional Approximate Range Counting. In S. Sanjeev Khanna (Ed.), Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (pp. 252-264). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973105.19

Nielsen, J. D. & Schwartzbach, M. I. (2007). The SMCL Language Specification.

Roune, B. H. (2009). The Slice Algorithm For Irreducible Decomposition of Monomial Ideals. Journal of Symbolic Computation, 44(4), 358-381.

Andersen, M. S., Kjærgaard, M. B. & Grønbæk, K. (2013). The SITA principle for Location Privacy – Conceptual Model and Architecture. Paper presented at International Conference on Privacy and Security in Mobile Systems, Atlantic City, NJ, United States.

Andersen, M. S., Kjærgaard, M. B. & Grønbæk, K. (2013). The SITA principle for Location Privacy: Conceptual model and architecture . In 2013 International Conference on Privacy and Security in Mobile Systems (PRISMS) (pp. 1 - 8 ). IEEE. https://doi.org/10.1109/PRISMS.2013.6927184

Chou, T. & Orlandi, C. (2015). The Simplest Protocol for Oblivious Transfer. http://eprint.iacr.org/2015/267

Chou, T. & Orlandi, C. (2015). The simplest protocol for oblivious transfer. In K. Lauter & F. Rodríguez-Henríquez (Eds.), Progress in Cryptology - LATINCRYPT 2015: 4th International Conference on Cryptology and Information Security in Latin America, Guadalajara, Mexico, August 23-26, 2015, Proceedings (Vol. 9230, pp. 40-58). Springer. https://doi.org/10.1007/978-3-319-22174-8_3

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. BRICS 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. BRICS 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

Kristensen, L. M., Christensen, S. & Jensen, K. (1998). The Practitioner's guide to Coloured Petri Nets. International Journal on Software Tools for Technology Transfer, 2(2), 98-132. https://doi.org/10.1007/s100090050021

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

Displaying results 601 to 650 out of 5919

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University