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

Brody, J. & Verbin, E. (2010). The Coin Problem and Pseudorandomness for Branching Programs. In 51st Annual IEEE Symposium on Foundations of Computer Science. FOCS 2010 (pp. 30-39). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2010.10

Kranen, P., Assent, I., Baldauf, C. & Seidl, T. (2011). The ClusTree : indexing micro-clusters for anytime stream mining. Knowledge and Information Systems, 29(2), 249-272. https://doi.org/10.1007/s10115-010-0342-8

Sosso, A., Bernardelli, A. M. & Gualandi, S. (2026). The cloven traveling salesman: cycle covers and the integrality gap of small ATSP instances. Optimization Letters. https://doi.org/10.1007/s11590-026-02312-x

Bahr, P., Grathwohl, H. B. & Møgelberg, R. E. (2017). The clocks are ticking: No more delays! In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 Article 8005097 IEEE. https://doi.org/10.1109/LICS.2017.8005097

Satyanarayan, A., Strazzulla, D., Klokmose, C. N., Beaudouin-Lafon, M. & Mackay, W. (2013). The CHI 2013 interactive schedule. In W. E. Mackay, S. Brewster & S. Brewster (Eds.), CHI EA '13 CHI '13 Extended Abstracts on Human Factors in Computing Systems (pp. 2987-2990). Association for Computing Machinery. https://doi.org/10.1145/2468356.2479591

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2015). The Chaining Lemma and its application. In A. Lehmann & S. Wolf (Eds.), Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 181-196). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_11

Gal, A. & Miltersen, P. B. (2003). The Cell Probe Complexity of Succinct Data Structures. In J. C. M. Baeten, J. K. Lenstra, J. Parrow & G. J. Wöeginger (Eds.), Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings (pp. 442-453). Springer. https://doi.org/10.1007/3-540-45061-0_28

Miltersen, P. B. & Gal, A. (2007). The Cell Probe Complexity of Succinct Data Structures. Theoretical Computer Science, 379(3), 405-417. https://doi.org/10.1016/j.tcs.2007.02.047

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. In STOC’12 : Proceedings of the 44th symposium on Theory of Computing (pp. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

Gratzer, D., Weinberger, J. & Buchholtz, U. (2026). The ∞-Category of ∞-Categories in Simplicial Type Theory. In F. Claudia, K. Joost-Pieter & K. Joost-Pieter (Eds.), 41st Annual Symposium on Logic in Computer Science, LICS 2026 Article 52 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.LICS.2026.52

Ernst, E. (2010). The Case for Simple Object-Orientation in VDM++. Datalogisk Institut, Aarhus Universitet. http://wiki.overturetool.org/images/5/5d/2010ernst.pdf

Arge, L. A. (2003). The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica, 37, Issue 1, 1-24. https://doi.org/10.1007/s00453-003-1021-x

Arge, L. A. (1995). The buffer tree: A new technique for optimal I/O-algorithms. In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (pp. 334-345). Springer. https://doi.org/10.1007/3-540-60220-8_74

Westergaard, M. (2006). The BRITNeY Suite: A Platfor for Experiments. In K. Jensen (Ed.), Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools: CPN'06 workshop (pp. 97-116). Aarhus Universitetsforlag.

Westergaard, M. & Lassen, K. B. (2006). The BRITNeY Suite Animation Tool. In Petri Nets and Other Models of Concurrency ICATPN 2006 (Vol. 4024, pp. 331-340). Springer.

Damgård, I. B. & Knudsen, L. R. (1994). The breaking of the AR Hash Function. In T. Helleseth (Ed.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings Springer. https://doi.org/10.1007/3-540-48285-7_25

Bødker, S., Zander, P.-O. & Borchorst, N. G. (2009). The boundaries of participatory citizenship. In I. Wagner, H. Tellioglu, E. Balka, C. Simone & L. Ciolfi (Eds.), Proceedings of the 11th European Conference on Computer Supported Cooperative Work, (ECSCW) (pp. 1-20). Springer. https://doi.org/10.1007/978-1-84882-854-4_1

Eriksen, S. H., Jensen, B. B., Kristensen, B. B. & Madsen, O. L. (1977). The BOBS-system. Aarhus Universitet. Daimi Report Series (DAIMI PB) No. 71

Miltersen, P. B. (1993). The bit probe complexity measure revisited. In P. Enjalbert, A. Finkel & K. W. Wagner (Eds.), STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25-27, 1993 Proceedings (pp. 662-671). Springer. https://doi.org/10.1007/3-540-56503-5_65

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. In É. Tardos, E. Elkind & R. Vohra (Eds.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (pp. 149-150). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219198

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2023). The Big Match with a Clock and a Bit of Memory. Mathematics of Operations Research, 48(1), 419-432. https://doi.org/10.1287/moor.2022.1267

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. In M. Gairing & R. Savani (Eds.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Vol. 9928, pp. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Feldthaus, A. & Møller, A. (2009). The Big Manual for the Java String Analyzer: Latest release: version 2.1-1, November 30, 2009. http://www.brics.dk/JSA/

Kristensen, B. B., Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1987). The BETA Programming Language. In B. D. Shriver & P. Wegner (Eds.), Research Directions in Object Oriented Programming (pp. 7-48). MIT Press.

Hansen, K. M. (1999). The BetaDBC Library.

Bilstrup, K.-E. K., Kaspersen, M. H., Larsen, M. F., Bouvin, N. O. & Petersen, M. G. (2022). The Best of Both Worlds: Designing a Tiered Hybrid Interface for Teaching Machine Learning in K-9 Education. In Participative Computing for Sustainable Futures : Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) Article 51 https://doi.org/10.1145/3546155.3546156

Bardram, J. E. & Hansen, T. R. (2004). The AWARE Architecture: Supporting Context Mediated Social Awareness in Mobile Cooperation. In Ikke angivet (pp. 192-201). Association for Computing Machinery.

Ackerman, M. & Branzei, S. (2014). The Authorship Dilemma: Alphabetical or Contribution? In A. Bazzan & M. Huhns (Eds.), Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems : AAMAS '14 (pp. 1487-1488). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2616025&bnc=1

Srinivasan, A. & Elmqvist, N. (2026). The Attention-Aware Pipeline: Design Tensions from Making Attention Visible in XR. CEUR Workshop Proceedings, 4226, 26-35.

Markussen, R., Mogensen, P. H., Bødker, S., Christiansen, E., Ehn, P. & Trigg, R. (1993). The AT project. Practical Research in Cooperative Design. In The AT Project (Vol. DAIMI PB-454,). Department of Computer Science, University of Aarhus.

Miltersen, P. B., Paterson, M. & Tarui, J. (1996). The asymptotic complexity of merging networks. Journal of the ACM, 43(1), 147-165. https://doi.org/10.1145/227595.227693

Miltersen, P. B., Paterson, M. & Tarui, J. (1992). The asymptotic complexity of merging networks. In 33rd Annual Symposium on Foundations of Computer Science, 1992. Proceedings. (pp. 236-246). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1992.267768

Kristensen, L. M. (2007). The ASCoVeCo State Space Analysis Platform: Next Generation Tool Support for State Space Analysis (Invited Tutorial). In K. Jensen (Ed.), Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (pp. 1-6)

Bødker, S. (1998). The artifacts of boundary crossing in systems design. Paper presented at Congress of the International Society for Cultural Research and Activity Theory, SCRAT 1998, Århus, Denmark.

Bouvin, N. O. (1999). The Arakne Framework. Department of Computer Science, Aarhus University.

Weinberg, M. S., Villeneuve, L. M., Ehsani, A., Amarzguioui, M., Aagaard, L., Chen, Z.-X., Riggs, A. D., Rossi, J. J. & Morris, K. V. (2006). The antisense strand of small interfering RNAs directs histone methylation and transcriptional gene silencing in human cells. RNA, 12(2), 256–262. https://doi.org/10.1261/rna.2235106

Petersen, M. G. & Rasmussen, M. K. (2011). The Ambiguity of Shape Changing Interfaces. Paper presented at Organic User Interface Workshop, Funchal, Portugal.

Pedersen, M. Ø. & Pagter, J. I. (2007). The All-or-Nothing Anti-Theft Policy - Theft Protection for Pervasive Computing. In Proceedings of AINA Workshops (1 ed., Vol. 1, pp. 626-631). IEEE Computer Society Press.

Sitchinava, N. & Svenning, R. (2024). The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. In SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 259-268). Association for Computing Machinery. https://doi.org/10.1145/3626183.3659979

Årdal, M. A., Basso, A. & Riepel, D. (2026). The Algebraic Isogeny Model: A General Model with Applications to SQIsign and Key Exchanges. In J. Daemen & E. Thomé (Eds.), Advances in Cryptology – EUROCRYPT 2026 - 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 604-635) https://doi.org/10.1007/978-3-032-25327-9_21

Aziz, H., Branzei, S., Filos-Ratsikas, A. & Frederiksen, S. K. S. (2015). The Adjusted Winner Procedure: Characterizations and Equilibria. Paper presented at International Joint Conference on Artificial Intelligence, Buinos Aires, Argentina.

Bertelsen, O. W. (2004). The Activity Walkthrough: An Expert Review Method Based on Activity Theory. In Proceedings of the third Nordic conference on Human-computer interaction (pp. 251-254). Association for Computing Machinery. https://doi.org/10.1145/1028014.1028052

van den Brand, M., Iversen, J., Mosses, P. D., Hedin, G. (Ed.) & Van Wyk, E. (Ed.) (2004). The Action Environment: Tool Demonstration. In Ikke angivet (pp. 177-180). Elsevier.

Breinbjerg, M., Caprani, O. & Lunding, R. (2005). The Acousmatic Music Environment: Musique Concret for Children.

Westergaard, M. & Kristensen, L. M. (2009). The Access/CPN Framework: A Tool for Interacting With the CPN Tools Simulator. Lecture Notes in Computer Science, 313-322. https://doi.org/10.1007/978-3-642-02424-5_19

Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2001). The Abstraction and Instantiation of String-Matching Programs. BRICS Report Series, (RS-01-12).

Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2002). The Abstraction and Instantiation of String-Matching Programs. In T. Mogensen, D. Schmidt & H. Sudborough (Eds.), The Essence of Computation: Complexity, Analysis, Transformation (pp. 332-357). Springer. https://doi.org/10.1007/3-540-36377-7_15

Bunde-Pedersen, J., Mogensen, M. & Bardram, J. E. (2006). The ABC Adaptive Fusion Architecture. In Proceedings of The 4th International Workshop on Middleware for Pervasive and Ad-Hoc Computing, a workshop of The 7th International Middleware Conference

Ernst, E., Gerhardt, F. & Benedicenti, L. (Eds.) (1998). The 8th Workshop for PhD Students in Object-Oriented Systems. In S. Demeyer & J. Bosch (Eds.), Object-Oriented Technology: ECOOP’98 Workshop Reader: ECOOP’ 98 Workshops, Demos, and Posters Brussels, Belgium, July 20–24, 1998 Proceedings (pp. 592-634). Springer. https://doi.org/10.1007/3-540-49255-0_1

Ernst, E., Gerhardt, F. & Wohlrab, L. (Eds.) (1997). The 7th Workshop for PhD Students in Object-Oriented Systems. In J. Bosch & S. Mitchell (Eds.), Object-Oriented Technologys: ECOOP’97 Workshop Reader ECOOP’97 Workshops Jyväskylä, Finland, June 9–13, 1997 Proceedings (pp. 389-431). Springer. https://doi.org/10.1007/3-540-69687-3_79

Displaying results 801 to 850 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