Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

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

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

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

Christensen, P. K., Skovgaard, C. Ø. & Petersen, M. G. (2019). Together together: Combining shared and separate activities in designing technology for family life. I Proceedings of the 18th ACM International Conference on Interaction Design and Children, IDC 2019 (s. 374-385). Association for Computing Machinery. https://doi.org/10.1145/3311927.3323141

Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C. & Sabelfeld, A. (2019). TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. Proceedings on Privacy Enhancing Technologies, 2019(4), 93-111. https://doi.org/10.2478/popets-2019-0060

Thiel, S.-K., Remy, C., Roque, L., Orji, R., Dalsgaard, P., Latulipe, C. & Sarcar, S. (2019). Towards a Research Agenda for Gameful Creativity. I DIS 2019 Companion - Companion Publication of the 2019 ACM Designing Interactive Systems Conference (s. 393-396). Association for Computing Machinery. https://doi.org/10.1145/3301019.3320003

Krogh-Jespersen, M. (2019). Towards Modular Reasoning for Stateful and Concurrent Programs. Aarhus Universitet.

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

Li, Y., Tan, T. & Xue, J. (2019). Understanding and analyzing Java reflection. ACM Transactions on Software Engineering and Methodology, 28(2), Artikel 7. https://doi.org/10.1145/3295739

Van Oosterhout, A. (2019). Understanding the benefits and drawbacks of shape change in contrast or addition to other modalities. I DIS 2019 Companion - Companion Publication of the 2019 ACM Designing Interactive Systems Conference (s. 113-116). Association for Computing Machinery. https://doi.org/10.1145/3301019.3324875

Winthereik, B., Grønbæk, K., Glæsel, J. & Larsen, K. G. (2019). Vi må ikke lade skandaler om datamisbrug bremse vores brug af data i samfundets tjeneste. Berlingske Tidende. https://www.berlingske.dk/kronikker/vi-maa-ikke-lade-skandaler-om-datamisbrug-bremse-vores-brug-af-data-i

Bardam, S. K., Mathisen, A., Rädle, R., Klokmose, C. N. & Elmqvist, N. (2019). Vistrates: A Component Model for Ubiquitous Analytics. IEEE Transactions on Visualization and Computer Graphics, 25(1), 586-596. Artikel 8440803. https://doi.org/10.1109/TVCG.2018.2865144

Horak, T., Mathisen, A., Klokmose, C. N., Dachselt, R. & Elmqvist, N. (2019). Vistribute: Distributing Interactive Visualizations in Dynamic Multi-Device Setups. I CHI 2019 - Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems Artikel 616 Association for Computing Machinery. https://doi.org/10.1145/3290605.3300846

Eriksson, E., Iversen, O. S., Baykal, G. E., Van Mechelen, M., Smith, R. C., Wagner, M.-L., Fog, B. V., Klokmose, C. N., Cumbo, B., Hjorth, H. A., Musaeus, L. H., Petersen, M. G. & Bouvin, N. O. (2019). Widening the Scope of FabLearn Research: Integrating Computational Thinking, Design and Making. Afhandling præsenteret på Fablearn Europe 2019, Oulu, Finland. https://doi.org/10.1145/3335055.3335070

David, B., Dowsley, R. & Larangeira, M. (2018). 21 - Bringing down the complexity: Fast composable protocols for card games without secret state. I W. Susilo & G. Yang (red.), Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings (s. 45-63). Springer. https://doi.org/10.1007/978-3-319-93638-3_4

Ciosici, M. R. & Assent, I. (2018). Abbreviation Expander: A web-based system for easy reading of technical documents. 1-4. Afhandling præsenteret på CoLing 2018, Santa Fe, USA. http://www.aclweb.org/anthology/C18-2001

Jordan, V. E., Walker, J. A., Beckstrom, T. O., Steely, C. J., McDaniel, C. L., St Romain, C. P., The Baboon Genome Analysis Consortium, Worley, K. C., Phillips-Conroy, J., Jolly, C. J., Rogers, J., Konkel, M. K. & Batzer, M. A. (2018). A computational reconstruction of Papio phylogeny using Alu insertion polymorphisms. Mobile DNA, 9(1), Artikel 13. https://doi.org/10.1186/s13100-018-0118-3

Bertelsen, O. W. (2018). Against Boredom: The Demonic Pantheism in Design. I J. Bardzell, S. Berdzell & M. Blythe (red.), Critical Theory and Interaction Design (s. 81-94). MIT Press.

Timany, A., Stefanesco, L., Krogh-Jespersen, M. & Birkedal, L. (2018). A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST. I Proceedings of the ACM on Programming Languages (Bind 2, s. 64:00-64:28). Association for Computing Machinery. https://doi.org/10.1145/3158152

Bizjak, A. & Birkedal, L. (2018). A Model of Guarded Recursion via Generalised Equilogical Spaces. Theoretical Computer Science, 722, 1-18. https://doi.org/10.1016/j.tcs.2018.02.012

The Baboon Genome Analysis Consortium (2018). Analysis of lineage-specific Alu subfamilies in the genome of the olive baboon, Papio anubis. Mobile DNA, 9(1), Artikel 10. https://doi.org/10.1186/s13100-018-0115-6

Huang, D., Morrisett, G. & Spitters, B. (2018, jun. 20). An Application of Computable Distributions to the Semantics of Probabilistic Programs. Cornell University.

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2018). An efficient algorithm for the 1D total visibility-index problem and its parallelization. ACM Journal of Experimental Algorithmics, 23, Artikel 2.3. https://doi.org/10.1145/3209685

Mai, S. T., Assent, I., Jacobsen, J. & Dieu, M. S. (2018). Anytime parallel density-based clustering. Data Mining and Knowledge Discovery, 32(4), 1121-1176. https://doi.org/10.1007/s10618-018-0562-1

Jensen, M. M. & Aagaard, J. (2018). A Postphenomenological Method for HCI Research. I Proceedings of the 30th Australian Computer-Human Interaction Conference, OzCHI 2018: OzCHI 2018 (s. 242-251). Association for Computing Machinery. https://doi.org/10.1145/3292147.3292170

Angelini, M., Santucci, G., Schumann, H. & Schulz, H.-J. (2018). A Review and Characterization of Progressive Visual Analytics. Informatics, 5(3), Artikel 31. https://doi.org/10.3390/informatics5030031

Adamsen, C. Q. (2018). Automated Testing Techniques for Event-Driven and Dynamically Typed Software Applications. Aarhus Universitet.

Bertelsen, O. W., Bødker, S., Eriksson, E., Hoggan, E. & Vermeulen, J. (2018). Beyond Generalization: Research for the Very Particular. interactions, 26(1), 34-38. https://doi.org/10.1145/3289425

Badertscher, C., Garay, J., Maurer, U., Tschudi, D. & Zikas, V. (2018). But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. I J. Buus Nielsen (red.), Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings (Bind 10821, s. 34-65). Springer VS. https://doi.org/10.1007/978-3-319-78375-8_2

Dalskov, A. P. K. & Orlandi, C. (2018). Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. I J. Kim, G.-J. Ahn & S. Kim (red.), ASIACCS 2018 - Proceedings of the 2018 ACM Asia Conference on Computer and Communications Security (s. 343-355). Association for Computing Machinery. https://doi.org/10.1145/3196494.3196547

Christensen, H. B. (2018). Chained Property Files (CPF). Softwareprogram, Bitbucket repository. https://bitbucket.org/henrikbaerbak/cpf/src/master/

Engemann, K., Pedersen, C. B., Arge, L., Tsirogiannis, C., Mortensen, P. B. & Svenning, J.-C. (2018). Childhood exposure to green space - A novel risk-decreasing mechanism for schizophrenia? Schizophrenia Research, 199, 142-148. https://doi.org/10.1016/j.schres.2018.03.026

Mathisen, A. & Grønbæk, K. (2018). Clear Visual Separation of Temporal Event Sequences. I 2017 IEEE Visualization in Data Science, VDS 2017 (s. 7-14). Artikel 8573439 IEEE. https://doi.org/10.1109/VDS.2017.8573439

Ciampi, M. & Orlandi, C. (2018). Combining Private Set-Intersection with Secure Two-Party Computation. I D. Catalano & R. De Prisco (red.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Bind 11035, s. 464-482). Springer VS. https://doi.org/10.1007/978-3-319-98113-0

Bertelsen, O. W. (2018). Commentary: Usability and the Primacy of Practice. Human-Computer Interaction, 33(2), 182-185. https://doi.org/10.1080/07370024.2017.1321991

Dowsley, R., Lacerda, F. & Nascimento, A. C. A. (2018). Commitment and Oblivious Transfer in the Bounded Storage Model with Errors. IEEE Transactions on Information Theory, 64(8), 5970-5984. https://doi.org/10.1109/TIT.2018.2796128

Damgård, I., Luo, J., Oechsner, S., Scholl, P. & Simkin, M. (2018). Compact Zero-Knowledge Proofs of Small Hamming Weight. I M. Abdalla & R. Dahab (red.), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Bind 10770, s. 530-560). Springer VS. https://doi.org/10.1007/978-3-319-76581-5_18

Karbyshev, A., Svendsen, K., Askarov, A. & Birkedal, L. (2018). Compositional Non-interference for Concurrent Programs via Separation and Framing. I L. Bauer & R. Küsters (red.), Principles of Security and Trust - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Bind 10804, s. 53-78). Springer VS. https://doi.org/10.1007/978-3-319-89722-6_3

Hansen, K. A. & Lund, T. B. (2018). Computational Complexity of Proper Equilibrium. I É. Tardos, E. Elkind & R. Vohra (red.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (s. 113-130). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219199

Caspersen, M. E., Iversen, O. S., Nielsen, M., Hjorth, H. A. & Musaeus, L. H. (2018). Computational Thinking — hvorfor, hvad og hvordan? Efter opdrag fra Villum Fondens bestyrelse.

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P.-Y. (2018, jun. 19). Computer-aided proofs for multiparty computation with active security. arxiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. I Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Bind 2018, s. 119-131). Artikel 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Arge, L., Shin, Y. & Tsirogiannis, C. (2018). Computing Floods Caused by Non-Uniform Sea-Level Rise. I R. Pagh & S. Venkatasubramanian (red.), 2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018 (s. 97-108). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975055.9

Tsirogiannis, C., Staals, F. & Pellissier, V. (2018). Computing the expected value and variance of geometric measures. ACM Journal of Experimental Algorithmics, 23(1), 2.4:1-2.4:32. Artikel 2.4. https://doi.org/10.1145/3228331

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). I T. Peyrin & S. Galbraith (red.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Bind 11274, s. 86-117). Springer VS. https://doi.org/10.1007/978-3-030-03332-3_4

Tomlein, M. (2018). Context-Aware Integrability and Maintainability of Cyber-Physical Ecosystems: Tactics and Tools. Aarhus Universitet.

Faonio, A., Nielsen, J. B., Simkin, M. & Venturi, D. (2018). Continuously Non-malleable Codes with Split-State Refresh. I B. Preneel & F. Vercauteren (red.), Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (Bind 10892, s. 121-139). Springer VS. https://doi.org/10.1007/978-3-319-93387-0_7

Damgård, I., Kazana, T., Obremski, M., Raj, V. & Siniscalchi, L. (2018). Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. I A. Beimel & S. Dziembowski (red.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings (Bind 11240, s. 225-254). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_9

Larsen, K. G., Weinstein, O. & Yu, H. (2018). Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. I M. Henzinger, D. Kempe & I. Diakonikolas (red.), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (s. 978-989). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188790

Christensen, H. B. (2018). Crunch: Automated Assessment of Microservice Architecture Assignments with Formative Feedback. I C. E. Cuesta, J. Perez & D. Garlan (red.), Software Architecture - 12th European Conference on Software Architecture, ECSA 2018, Proceedings: 12th European Conference on Software Architecture, ECSA 2018 (Bind 11048, s. 175-190). Springer. https://doi.org/10.1007/978-3-030-00761-4_12

Viser resultater 1551 til 1600 ud af 6063

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series