Aarhus Universitets segl

Publikationer

Søg publikationer fra Institut for Datalogi

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

Sortér efter: Dato | Forfatter | Titel

Fandina, O. N., Høgsgaard, M. M. & Larsen, K. G. (2023). The Fast Johnson-Lindenstrauss Transform Is Even Faster. I A. Krause, E. Brunskill, K. Cho, B. Engelhardt, S. Sabato & J. Scarlett (red.), Proceedings of ICML 2023 (Bind 202, s. 9689-9715). MLResearch Press.
Ernst, E. (2004). The Expression Problem, Scandinavian Style. I MASPEGHI 2004 (ISRN I3S/RR-2004-15-FR udg.). Laboratoire I3S, Sophia Antipolis.
Torgersen, M. & Odersky, M. (red.) (2004). The Expression Problem Revisited - Four New Solutions using Generics. I Proceedings of the 18th European Conference on Object-Oriented Programming (ECOOP'04) (3086 i Lecture Notes in Computer Science udg., s. 123-146). Springer.
Hansen, K. M., Kristensen, L. M., Eskildsen, T., Nielsen, K.-D., Thorup, R. E., Fridthjof, J., Merrild, U. & Eskildsen, J. (2004). The Ex Hoc Infrastructure - Enhancing Traffic Safety through LIfe WArning Systems. I H. Lahrmann, P. H. Jespersen, A. Landex, O. A. Nielsen & T. Hels (red.), Proceedings of Trafikdage 2004 (s. 15-24). Aalborg Universitetsforlag. http://www.trafikdage.dk/papers/soeg/Paper.asp/?PaperID=1044
Hansen, K. M. (2006). The Ex hoc Architecture. Softwareprogram
Garg, S., Mukherjee, P., Pandey, O. & Polychroniadou, A. (2016). The Exact Round Complexity of Secure Computation. I M. Fischlin & J.-S. Coron (red.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (s. 448 - 476). Springer VS. https://doi.org/10.1007/978-3-662-49896-5
Madsen, O. L. & Møller-Pedersen, B. (2016). The Essence of Subclassing. Afhandling præsenteret på NOOL 2016, Amsterdam, Holland.
Krebbers, R., Jung, R., Bizjak, A., Jourdan, J.-H., Dreyer, D. & Birkedal, L. (2017). The Essence of Higher-Order Concurrent Separation Logic. I H. Yang (red.), Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings (s. 696-723). Springer VS. https://doi.org/10.1007/978-3-662-54434-1_26
Sieczkowski, F., Stepanenko, S., Sterling, J. & Birkedal, L. (2024). The Essence of Generalized Algebraic Data Types. Proceedings of the ACM on Programming Languages , 8(POPL), 695-723. https://doi.org/10.1145/3632866
Danvy, O., Malmkjær, K. & Palsberg, J. (1995). The essence of eta-expansion in partial evaluation. Higher-Order and Symbolic Computation, 8(3), 209-227. https://doi.org/10.1007/BF01019004
Fritsch, J., Dalsgård, P. & Dindler, C. (2006). The Energy Table: Augmenting the Exhibition Space at The Danish Electricity Museum. I Proceedings of Scandinavian Student Interaction Design Conference (SIDER) 2006
Brodal, G. S., Brodnik, A. & Davoodi, P. (2013). The encoding complexity of two dimensional range minimum data structures. I H. L. Bodlaender & G. F. Italiano (red.), Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 229-240). Springer VS. https://doi.org/10.1007/978-3-642-40450-4_20
Kaaresoja, T., Anttila, E. & Hoggan, E. (2011). The effect of tactile feedback latency in touchscreen interaction. I World Haptics Conference (WHC), 2011 IEEE (s. 65-70)
Bataillon, T., Mailund, T., Thorlacius, S., Steingrimsson, E., Rafnar, T., Halldorsson, M., Calian, V. & Schierup, M. H. (2006). The effective size of the Icelandic population and the prospects for LD mapping: inference from unphased microsatellite markers. European Journal of Human Genetics, 14, 1044–1053. https://doi.org/10.1038/sj.ejhg.5201669
Aarhus, R., Ballegaard, S. A. & Hansen, T. R. (2009). The eDiary: Bridging home and hospital through healthcare technology. I E. Balka, L. Ciolofi, C. Simone, H. Tellioglu & I. Wagner (red.), Proceedings of the 11th European Conferenceon Computer Supported Cooperative Work (s. 63-83). Springer. https://doi.org/10.1007/978-1-84882-854-4_4
Klarlund, N., Møller, A. & Schwartzbach, M. I. (2002). The DSD Schema Language. Automated Software Engineering, 9(3), 285-319. https://doi.org/10.1023/A:1016376608070
Hansen, K. M. & Thomsen, M. (1999). The "Domain Model Concealer" and "Application Moderator" patterns: Addressing architechtural uncertainty in interactive systems. I Technology of Object-Oriented Languages and Systems, 1999. TOOLS 31. Proceedings (s. 177-190). IEEE Computer Society Press. https://doi.org/10.1109/TOOLS.1999.796481
Emiris, I. Z., Mourrain, B. & Tsigaridas, E. (2010). The DMM Bound: Multivariate (Aggregrate) Separation Bounds. International Symposium on Symbolic and Algebraic Computation, 243-250. https://doi.org/10.1145/1837934.1837981
Halasz, F., Schwartz, M., Grønbæk, K. (red.) & Trigg, R. H. (red.) (1994). The Dexter hypertext reference model. Association for Computing Machinery. Communications, 37(2), 30-39. https://doi.org/10.1145/175235.175237
Møller, A. & Schwartzbach, M. I. (2005). The Design Space of Type Checkers for XML Transformation Languages. I Database Theory - ICDT 2005: 10th International Conference, Edinburgh, UK, January 5-7, 2005. Proceedings (s. 17-36). Springer. https://doi.org/10.1007/978-3-540-30570-5_2
Schulz, H.-J., Hadlak, S. & Schumann, H. (2011). The Design Space of Implicit Hierarchy Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics, 17(4), 393-411. https://doi.org/10.1109/TVCG.2010.79
Fogtmann, M. H. & Kinch, S. (2011). The design researcher in quandary: the conflicting roles of being both a designer and a design researcher. I Procedings of the Second Conference on Creativity and Innovation in Design (s. 193-196)
Vermeulen, J., Luyten, K., Coninx, K. & Marquardt, N. (2014). The Design of Slow-motion Feedback. -, 267-270. https://doi.org/10.1145/2598510.2598604
Jensen, K. (1985). The Design of a Program Package for an Introductory Petri Net Course. I G. Rozenberg, H. Genrich & G. Roucairol (red.), Advances in Petri Nets 1984 (Bind 188, s. 259-266). Springer. https://doi.org/10.1007/3-540-15204-0_15
Bødker, S. & Buur, J. (2002). The Design Collaboratorium - a place for usability design. ACM Transactions on Computer-Human Interaction, 9(2), 152-169. https://doi.org/10.1145/513665.513670
Boring, S., Greenberg, S., Vermeulen, J., Dostal, J. & Marquardt, N. (2014). The Dark Patterns of Proxemic Sensing. Computer, 47(8), 56-60. https://doi.org/10.1109/MC.2014.223
Vermeulen, J., Lim, B. Y., Avdic, M., Wang, D. & Abdul, A. (2019). The Curious Case of Providing Intelligibility for Smart Speakers. Abstract fra The 2019 ACM CHI Conference on Human Factors in Computing Systems (CHI'19), Glasgow, Storbritannien.
Gambs, S., Ranellucci, S. & Tapp, A. (2015). The crypto-democracy and the trustworthy (position paper). I Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance: 9th International Workshop, DPM 2014, 7th International Workshop, SETOP 2014, and 3rd International Workshop, QASA 2014, Wroclaw, Poland, September 10-11, 2014. Revised Selected Papers (Bind 8872, s. 58-76). Springer VS. https://doi.org/10.1007/978-3-319-17016-9_5
Gambs, S., Ranellucci, S. & Tapp, A. (2014). The Crypto-democracy and the Trustworthy. Afhandling præsenteret på Data Privacy Management, Wroclaw, Polen. http://arxiv.org/pdf/1409.2432v1.pdf
Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2003). The Cost of Cache-Oblivious Searching. I Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C. (Bind Session 6, s. 271-282). IEEE Computer Society Press.
Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. https://doi.org/10.1007/s00453-010-9394-0
Engelfriet, J. & Skyum, S. (1982). The copying power of one-state tree transducers. Journal of Computer and System Sciences, 25(3), 418-435. https://doi.org/10.1016/0022-0000(82)90019-8
Lyngsø, R. B. & Pedersen, C. N. S. (2002). The Consensus String Problem and the Complexity of Comparing Hidden Markov Models. Journal of Computer and System Sciences, 65(3), 545-569.
Buss, J. F., Frandsen, G. S. & Shallit, J. O. (1999). The Computational Complexity of Some Problems of Linear Algebra. Journal of Computer and System Sciences, 58(3), 572-596. https://doi.org/10.1006/jcss.1998.1608
Buss, J. F., Frandsen, G. S. & Shallit, J. O. (1997). The computational complexity of some problems of linear algebra. I R. Reischuk & M. Morvan (red.), STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings (s. 451-462). Springer. https://doi.org/10.1007/BFb0023480
Miltersen, P. B. (2005). The Computational Complexity of One-Dimensional Sandpiles. I S. B. Cooper, B. Löwe & L. Torenvliet (red.), New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings (s. 342-350). Springer. https://doi.org/10.1007/11494645_42
Olsen, M. (2008). The Computational Complexity of Link Building. Lecture Notes in Computer Science, 5092, 119-129.
Miltersen, P. B., Gurvich, V. & Andersson, D. (2008). The Complexity of Solving Stochastic Games on Graphs. Department of Computer Science, Aarhus University. http://www.daimi.au.dk/~bromille/Papers/mean.pdf