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

Tsirogiannis, C. & Tsirogiannis, C. (2016). Uncovering the Hidden Routes: Algorithms for Identifying Paths and Missing Links in Trade Networks . In T. Brughmans, A. Collar & F. Coward (Eds.), The Connected Past: Challenges to Network Studies in Archaeology and History Oxford University Press.

David, B. M., Dowsley, R., van der Graaf, J., Marques, D., Nascimento, A. C. A. & Pinto, A. (2015). Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra. I E E E Transactions on Information Forensics and Security, 11(1), 59 - 73 . https://doi.org/10.1109/TIFS.2015.2476783

Meldgaard, S. T. (2013). Unconditionally Secure Protocols. Institut for Datalogi, Aarhus Universitet.

Damgård, I. B., Nielsen, J. B., Toft, T., Kiltz, E. & Fitzi, M. (2006). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In S. Halevi & T. Rabin (Eds.), Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings (pp. 285-304). Springer. https://doi.org/10.1007/11681878_15

Damgård, I., Nielsen, J. B., Ostrovsky, R. & Rosén, A. (2016). Unconditionally secure computation with reduced interaction. In M. Fischlin & J.-S. Coron (Eds.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 9666, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-49896-5_15

Damgård, I. B. & Scafuro, A. (2013). Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 100-119 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_6

Damgård, I. B., Dupont, K. & Pedersen, M. Ø. (2006). Unclonable Group Identification. In S. Vaudenay (Ed.), Advances in Cryptology - EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006. Proceedings (pp. 555-572). Springer. https://doi.org/10.1007/11761679_33

Christensen, H. B. (2019). Uncle Henrik’s Clean Code Principles.

Draganov, A. A., Weber, P., Jørgensen, R. S. M., Beer, A., Plant, C. & Assent, I. (2025). Ultrametric Cluster Hierarchies: I Want ‘em All!. https://neurips.cc/media/PosterPDFs/NeurIPS%202025/119173.png?t=1762960797.979475

Kyng, M. & Mathiassen, L. (1976). Udkast til ansøgning om projekttilskud fra Teknologirådet.

Moradan, A., Draganov, A., Mottin, D. & Assent, I. (2021). UCoDe: Unified Community Detection with Graph Convolutional Networks. ArXiv. https://doi.org/10.48550/arXiv.2112.14822

Moradan, A., Draganov, A., Mottin, D. & Assent, I. (2023). UCoDe: unified community detection with graph convolutional networks. Machine Learning, 112(12), 5057-5080. https://doi.org/10.1007/s10994-023-06402-0

Bødker, S., Klokmose, C. N. & Brodersen, A. C. (2007). Ubiquitous Substitution. In Proceedings of 11th IFIP TC 13 International Conference (Vol. 4662/2007, pp. 179-192). Springer.

Grønbæk, K. (2006). Ubiquitous hypermedia and social interaction in physical environments. In HYPERTEXT '06: Proceedings of the seventeenth conference on Hypertext and hypermedia (pp. 119-120). Association for Computing Machinery. https://doi.org/10.1145/1149941.1149965

Dalsgård, P. & Eriksson, E. (2007). Ubiquitous Computing in Physico-Spatial Environments: Activity Theoretical Considerations.

Hansen, F. A. (2006). Ubiquitous Annotation Systems: Technologies and Challenges. In Proceedings of the Seventeenth Conference on Hypertext and Hypermedia (pp. 121-132). Association for Computing Machinery. https://doi.org/10.1145/1149941.1149967

Mezzetti, G., Møller, A. & Strocco, F. (2016). Type unsoundness in practice: An empirical study of dart. In R. Ierusalimschy (Ed.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (pp. 13-24). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989227

Kristensen, E. K. & Møller, A. (2017). Type Test Scripts for TypeScript Testing. Proceedings of the ACM on Programming Languages , 1(OOPSLA), 90:1-90:25. Article 90. https://doi.org/10.1145/3133914

Schwartzbach, M. I. & Palsberg, J. (1990). Type Substitution for Object-Oriented Programming. In A. Yonezawa (Ed.), Proceedings of the European Conference on Object-Oriented Programming Systems, Languages and Applications (pp. 151-160). Association for Computing Machinery. https://doi.org/10.1145/97945.97965

Strocco, F. (2016). Type Soundness in the Dart Programming Language. Department of Computer Science, University of Aarhus.

Schwartzbach, M. I. & Meineche Smidt, E. (1990). Types and Automata. Aarhus Universitetsforlag.

Heinze, T. S., Møller, A. & Strocco, F. (2016). Type safety analysis for dart. In R. Ierusalimschy (Ed.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (pp. 1-12). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989226

Mezzetti, G., Møller, A. & Torp, M. T. (2018). Type Regression Testing to Detect Breaking Changes in Node.js Libraries. In T. D. Millstein (Ed.), 32nd European Conference on Object-Oriented Programming, ECOOP 2018 (Vol. 109, pp. 7:1-7:24). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2018.7

Schwartzbach, M. I. (1991). Type Inference with Inequalities. In TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8-12, 1991 (pp. 441-455). Springer. https://doi.org/10.1007/3-540-53982-4_24

Schwartzbach, M. I., Askari, H. & Hougaard, O. I. (1995). Type Inference of Turbo Pascal. International Journal on Software Tools for Technology Transfer, 16(4), 160-169.

Schwartzbach, M. I., Agesen, O. & Palsberg, J. (1993). Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In O. M. Nierstrasz (Ed.), ECOOP' 93 - Object-Oriented Programming: 7th European Conference Kaiserslautern, Germany, July 26-30, 1993 Proceedings (pp. 247-267). Springer. https://doi.org/10.1007/3-540-47910-4_14

Schwartzbach, M. I., Agesen, O. & Palsberg, J. (1995). Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. Software: Practice & Experience, 25(9), 975-995.

Iversen, J. & Mosses, P. D. (Ed.) (2002). Type Inference for the New Action Notation. Paper presented at International Workshop on Action Semantics (AS 2002), København, Denmark.

Rendel, T., Ostermann, K. & Hofer, C. (2009). Typed Self-Representation. In Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (pp. 293-303). Association for Computing Machinery. https://doi.org/10.1145/1542476.1542509

Hansen, K. M. & Yndigegn, C. (1999). Typed links in Webvise. Computer programme

Danvy, O. (1999). Type-Directed Partial Evaluation. In J. Hatcliff, T. Æ. Mogensen & P. Thiemann (Eds.), Partial Evaluation: Practice and Theory DIKU 1998 International Summer School Copenhagen, Denmark, June 29 – July 10, 1998 (pp. 367-411). Springer. https://doi.org/10.1007/3-540-47018-2_16

Danvy, O. (1996). Type-Directed Partial Evaluation. In Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium (pp. 242-257). Association for Computing Machinery.

Danvy, O. (1998). Type-Directed Partial Evaluation. BRICS Lecture Series, (LS-98-3).

Brabrand, C. & Thomsen, J. G. (2010). Typed and Unambiguous Pattern Matching on Strings using Regular Expressions. In T. Kutsia, W. Schreiner & M. Fernandez (Eds.), Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming. PPDP '10: (pp. 243-254). Association for Computing Machinery. https://doi.org/10.1145/1836089.1836120

Kirkegaard, C. & Møller, A. (2006). Type Checking with XML Schema in XACT. Paper presented at PLAN-X 2006: ACM SIGPLAN Workshop on Programming Language Technologies for XML, Charleston, SC, United States.

Jensen, S. H., Møller, A. & Thiemann, P. (2009). Type Analysis for JavaScript. Lecture Notes in Computer Science, 5673, 238–255. https://doi.org/10.1007/978-3-642-03237-0_17

Bødker, S., Dindler, C. & Iversen, O. S. (2017). Tying Knots: Participatory Infrastructuring at Work. Computer Supported Cooperative Work, 26(1-2), 245-273. https://doi.org/10.1007/s10606-017-9268-y

Kondi, Y., Orlandi, C. & Roy, L. (2023). Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology – CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023, Proceedings, Part I (pp. 646-677). Springer. https://doi.org/10.1007/978-3-031-38557-5_21

Mukherjee, P. & Wichs, D. (2015). Two Round MPC from LWE via Multi-Key FHE. Cryptology ePrint Archive. http://eprint.iacr.org/2015/345

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2022). Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. Journal of Cryptology, 35(2), Article 14. https://doi.org/10.1007/s00145-022-09425-3

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2021). Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, 2021, Proceedings: 24rd IACR International Conference on Practice and Theory of Public-Key Cryptography, proceedings part 1 (pp. 99-130). Springer. https://doi.org/10.1007/978-3-030-75245-3_5

Garg, S. & Polychroniadou, A. (2015). Two-round adaptively secure MPC from indistinguishability obfuscation. In Y. Dodis & J. Buus Nielsen (Eds.), Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II (pp. 614-637). Springer VS. https://doi.org/10.1007/978-3-662-46497-7_24

Annenkov, D., Capriotti, P. & Kraus, N. (2017, May 9). Two-Level Type Theory and Applications. arxiv.org. https://arxiv.org/pdf/1705.03307.pdf

Damgård, I. B. & Knudsen, L. R. (1998). Two-Key Triple Encryption. Journal of Cryptology, 11(3), 209-218. https://doi.org/10.1007/s001459900044

Westergaard, M. & Kristensen, L. M. (2008). Two Interfaces to the CPN Tools Simulator. In Ninth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (pp. 83-102). Department of Computer Science.

Møller-Nielsen, P. (2022). Two Extensions of a Phase Vocoder.

Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012). Two Dimensional Range Minimum Queries and Fibonacci Lattices. Lecture Notes in Computer Science, 7501, 217-228 . https://doi.org/10.1007/978-3-642-33090-2_20

Stølting Brodal, G., Davoodi, P., Lewenstein, M., Raman, R. & Satti, S. R. (2016). Two dimensional range minimum queries and Fibonacci lattices. Theoretical Computer Science, 638, 33-43. https://doi.org/10.1016/j.tcs.2016.02.016

Davoodi, P., Smid, M. & Walderveen, F. V. (2012). Two-dimensional range diameter queries. Lecture Notes in Computer Science, 7256, 219–230. https://doi.org/10.1007/978-3-642-29344-3_19

Avdic, M., Bødker, S. & Larsen-Ledet, I. (2021). Two Cases For Traces: A Theoretical Framing of Mediated Joint Activity. Proceedings of the ACM on Human-Computer Interaction, 5(CSCW1), Article 190. https://doi.org/10.1145/3449289

Displaying results 301 to 350 out of 5896

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University