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

Hogräfer, M., Grønbæk, J. E., Puschmann, J., Knudsen, S. K. & Schulz, H.-J. (2022). Enabling Collaborative Cybercartography with MapBlender. In E. Parseliunas, A. Mansourian, P. Partsinevelos & J. Suziedelyte-Visockiene (Eds.), Proceedings of the 25th AGILE Conference on Geographic Information Science (AGILE'22): Artificial Intelligence in the service of Geospatial Technologies Article 37 Copernicus Publications. https://doi.org/10.5194/agile-giss-3-37-2022

Hogräfer, M., Burkhardt, J. & Schulz, H.-J. (2022). A Pipeline for Tailored Sampling for Progressive Visual Analytics. In J. Bernard & M. Angelini (Eds.), Proceedings of the 13th International EuroVis Workshop on Visual Analytics (EuroVA) (pp. 49-53). Eurographics Association. https://doi.org/10.2312/eurova.20221079

Hogräfer, M. & Schulz, H.-J. (2024). Tailorable Sampling for Progressive Visual Analytics. IEEE Transactions on Visualization and Computer Graphics, 30(8), 4809-4824. https://doi.org/10.1109/TVCG.2023.3278084

Hogräfer, M., Moritz, D., Perer, A. & Schulz, H.-J. (2023). Combining Degree of Interest Functions and Progressive Visualization. In 2023 IEEE Visualization Conference – Short Papers: VIS 2023 (pp. 251-255). IEEE. https://doi.org/10.1109/VIS54172.2023.00059

Hogräfer, M. (2023). Contributions towards Improving the Usefulness of Partial Visualizations in Progressive Visual Analytics. [PhD thesis, Aarhus University]. Aarhus Universitet.

Høgh, K. (2023). Complexity of Total Search Problems. [PhD thesis, Aarhus University]. Aarhus Universitet.

Hoggan, E., Hsieh, Y.-T., Myllymaa, K., Lantz, V., Kildal, J., Eiler, J. & Jacucci, G. (2017). An Exploration of Mobile Shape-Changing Textures. In TEI 2017 - Proceedings of the 11th International Conference on Tangible, Embedded, and Embodied Interaction: TEI '17 (pp. 275-282). Association for Computing Machinery. https://doi.org/10.1145/3024969.3024983

Hoggan, E. (2024). Multimodal Interaction. In Interaction Techniques and Technologies in Human-Computer Interaction (pp. 45-63). CRC Press. https://doi.org/10.1201/9781003490678-2

Hofer, C., Ostermann, K., Rendel, T. & Moors, A. (2008). Polymorphic Embedding of DSLs. In Y. Smaragdakis & J. G. Siek (Eds.), Proceedings of the 7th international conference on Generative programming and component engineering: SESSION: Technical papers 5 (pp. 137-148). Association for Computing Machinery.

Hofer, C. & Ostermann, K. (2010). Modular Domain-Specific Language Components in Scala. In Proceedings of the ninth International Conference on Generative Programming and Component Engineering (pp. 83-92). Association for Computing Machinery. https://doi.org/10.1145/1868294.1868307

Hobolth, A. & Jensen, E. B. V. (2002). Stereological analysis of shape. Image Analysis and Stereology, 21(4), S23-S29. https://doi.org/10.5566/ias.v21.pS23-S29

Hobolth, A., Pedersen, J. & Jensen, E. B. V. (2003). A continuous parametric shape model. Annals of the Institute of Statistical Mathematics, 55(2), 227-242. https://doi.org/10.1007/BF02530496

Hobolth, A., Christensen, O. F., Mailund, T. & Schierup, M. H. (2007). Genomic Relationships and Speciation Times of Human, Chimpanzee and Gorilla inferred from a Coalescent Hidden Markov Model. Poster session presented at Beyond the HapMap, Boston, United States.

Hobolth, A., Christensen, O. F., Mailund, T. & Schierup, M. H. (2007). Genomic relationships and speciation times of human, chimpanzee and gorilla inferred from a coalescent hidden Markov model. PLoS Genetics, 3(2). https://doi.org/10.1371/journal.pgen.0030007

Hladík, M., Daney, D. & Tsigaridas, E. (2011). Characterizing and approximating eigenvalue sets of symmetric interval matrices. Computers & Mathematics with Applications, 62(8), 3152-3163. https://doi.org/10.1016/j.camwa.2011.08.028

Hladik, M., Daney, D. & Tsigaridas, E. (2011). A filtering method for the interval eigenvalue problem. Applied Mathematics and Computation, 217(12), 5236-5242. https://doi.org/10.1016/j.amc.2010.09.066

Hjorth, A. & Wilensky, U. (2019). Studying Conceptual Change in Classrooms Using Association Rule Mining to Detect Changes in Students' Explanations of the Effects of Urban Planning and Social Policy. Constructivist Foundations, 14(3), 272-283. https://constructivist.info/14/3/272

Hjorth, H. A. (2020). NaturalLanguageProcessing4All: A Tool for Natural Language Processing in Social Studies Education for Non-Programmers. Poster session presented at Constructionism 2020, Dublin, Ireland.

Hjorth, H. A. & Wilensky, U. (2020). Thinking in Levels Across Multiple Levels. Paper presented at Constructionism 2020, Dublin, Ireland.

Hjorth, A., Head, B., Head, B. & Wilensky, U. (2020). Levelspace: A netlogo extension for multi-level agent-based modeling. JASSS, 23(1), Article 4. https://doi.org/10.18564/jasss.4130

Hjøllund, N. H. I., Jensen, T. K., Bonde, J. P., Henriksen, T. B., Andersson, A. M., Kolstad, H., Ernst, E., Giwercman, A., Skakkebaek, N. E. & Olsen, J. (1999). Distress and reduced fertility: a follow-up study of first-pregnancy planners. Fertility and Sterility, 72(1), 47-53.

Hirt, M. & Nielsen, J. B. (2005). Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computations. In B. Roy (Ed.), Advances in Cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings (pp. 79-99). Springer. https://doi.org/10.1007/11593447_5

Hirt, M., Nielsen, J. B. & Przydatek, B. (2005). Cryptographic Asynchronous Multi-party Computation with Optimal Resilience: Extended abstract. In R. Cramer (Ed.), Advances in Cryptology – EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings (pp. 322-340). Springer LNCS. https://doi.org/10.1007/11426639_19

Hirt, M. & Nielsen, J. B. (2006). Robust Multiparty Computation with Linear Communication Complexity. In C. Dwork (Ed.), Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference (pp. 463-482) https://doi.org/10.1007/11818175_28

Hirt, M., Nielsen, J. B. & Przydatek, B. (2008). Asynchronous Multi-Party Computation with Quadratic Communication. Lecture Notes in Computer Science, 5126, 473-485. https://doi.org/10.1007/978-3-540-70583-3_39

Hinrichsen, J. K., Bengtson, J. & Krebbers, R. (2022). ACTRIS 2.0: ASYNCHRONOUS SESSION-TYPE BASED REASONING IN SEPARATION LOGIC. Logical Methods in Computer Science, 18(2), 16:1-16:64. https://doi.org/10.46298/lmcs-18(2:16)2022

Hinrichsen, J. K., Jacobs, J. & Krebbers, R. (2024). Multris: Functional Verification of Multiparty Message Passing in Separation Logic. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), Article 322. https://doi.org/10.1145/3689762

Hill, M. C. & Østerby, O. (2003). Determining extreme parameter correlation in ground water models. Groundwater, 41(4), 420-430. https://doi.org/10.1111/j.1745-6584.2003.tb02376.x

Hilker, R., Sickinger, C., Pedersen, C. N. S. & Stoye, J. (2012). UniMoG - A unifying framework for genomic distance calculation and sorting based DCJ. Bioinformatics, 28(19), 2509-2511. https://doi.org/10.1093/bioinformatics/bts440

Higuchi, N., Imamura, Y., Mic, V., Shinohara, T., Hirata, K. & Kuboyama, T. (2024). Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance. In M. Castrillon-Santana, M. De Marsico & A. Fred (Eds.), Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods - ICPRAM (Vol. 1, pp. 499-510). SCITEPRESS Digital Library. https://doi.org/10.5220/0012322700003654

Hernest, M.-D. & Kohlenbach, U. (2005). A complexity analysis of functional interpretations. Theoretical Computer Science, 338(1-3), 200-246.

Hermanns, J., Tsitsulin, A., Munkhoeva, M., Bronstein, A., Mottin, D. & Karras, P. (2021). GRASP: Graph Alignment through Spectral Signatures. In L. Hou U, M. Spaniol, Y. Sakurai & J. Chen (Eds.), Web and Big Data - 5th International Joint Conference, APWeb-WAIM 2021, Proceedings (pp. 44-52). Springer. https://doi.org/10.1007/978-3-030-85896-4_4

Hermanns, J., Skitsas, K., Tsitsulin, A., Munkhoeva, M., Kyster, A., Nielsen, S., Bronstein, A. M., Mottin, D. & Karras, P. (2023). GRASP: Scalable Graph Alignment by Spectral Corresponding Functions. ACM Transactions on Knowledge Discovery from Data, 17(4), 1-26. Article 50. https://doi.org/10.1145/3561058

Hermanns, J. F. (2022). Spectral Graph Correspondences. [PhD thesis, Aarhus University]. Aarhus Universitet.

Herings, P. J.-J., Jurdzinski, M., Miltersen, P. B., Tardos, É. & von Stengel, B. (2008). Equilibrium Computation: 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings, 07471.

Henriksen, M., Egund, N., Christensen, F. B., Bünger, C. & Senholt, T. (2010). Sagittal Spinal Balance After Lumbar Spinal Fusion: The Impact of Anterior Column Support: Results From a Randomized Clinical Trial With an Eight- to Thirteen-Year Radiographic Follow-up. Spine. https://doi.org/10.1097/BRS.0b013e3181cd9ee5

Henriksen, A., Enni, S. & Bechmann, A. (2021). Situated Accountability: Ethical Principles, Certification Standards, and Explanation Methods in Applied AI. In AIES '21: Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society (pp. 574-585). Association for Computing Machinery. https://doi.org/10.1145/3461702.3462564

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.

Heljanko, K., Junttila, T. A., Keinänen, M., Lange, M. & Latvala, T. (2006). Bounded Model Checking for Weak Alternating Büchi Automata. In T. Ball & R. B. Jones (Eds.), CAV ´06: Computer Aided Verification, 18th International Conference (pp. 95-108) https://doi.org/10.1007/11817963_12

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

Hein, J., Jensen, J. L. & Pedersen, C. N. S. (2002). Recursions for Statistical Multiple Alignment. Department of Mathematical Sciences , University of Aarhus.

Hein, J., Jensen, J. L. & Pedersen, C. N. S. (2003). Recursions for statistical multiple alignment. Proceedings of the National Academy of Sciences (PNAS), 100(25), 14960-14965. https://doi.org/10.1073/pnas.2036252100

Hein, J., Pedersen, C. N. S. & Jensen, J. L. (2002). Recursions for Statistical Multiple Alignment. Proceedings of the National Academy of Sciences (PNAS), 100(25), 14960-14965.

Hein, J., Wiuf, C., Møller, M., Knudsen, B. & Wibling, G. (2000). Statistical alignment: computational properties, homology testing and goodness-of-fit. J. Mol. Biol., 302(1), 265-279. https://doi.org/10.1006/jmbi.2000.4061

Hedin, G., Magnusson, B., Fors, D. S., Robertz, S., Gjerlufsen, T. & Andersen, P. (2007). PalCom Deliverable 49 (2.6.3). Support for End-User Composition in PalCom. http://www.ist-palcom.org/publications/deliverables/Deliverable-49-[2.6.3]-end-user-composition.pdf

Hedegaard Morsing, L., Sheikh-Omar, O. A. & Iosifidis, A. (2021). Supervised Domain Adaptation: A Graph Embedding Perspective and a Rectified Experimental Protocol. IEEE Transactions on Image Processing, 30, 8619-8631. https://doi.org/10.1109/TIP.2021.3118978

Hazay, C. & Toft, T. (2010). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. Lecture Notes in Computer Science, 6477, 195-212. https://doi.org/10.1007/978-3-642-17373-8_12

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2011). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. http://eprint.iacr.org/2011/494

Hazay, C., Mikkelsen, G. L., Rabin, T. & Toft, T. (2012). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Lecture Notes in Computer Science, 7178, 313-331. https://doi.org/10.1007/978-3-642-27954-6_20

Hazay, C. & Nissim , K. (2012). Efficient Set Operations in the Presence of Malicious Adversaries. Journal of Cryptology, 25(3), 383-433 . https://doi.org/10.1007/s00145-011-9098-x

Displaying results 2601 to 2650 out of 5797

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University