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

Vermeulen, J., Luyten, K., Coninx, K. & Marquardt, N. (2014). The Design of Slow-motion Feedback. -, 267-270. https://doi.org/10.1145/2598510.2598604

Kjelstrom, A. H. & Pavlogiannis, A. (2022). The Decidability and Complexity of Interleaved Bidirected Dyck Reachability. Proceedings of the ACM on Programming Languages , 6(POPL), Artikel 12. https://doi.org/10.1145/3498673

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. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. https://doi.org/10.1007/s00453-010-9394-0

Hansen, K. A., Ibsen-Jensen, R. & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems, 55(2), 380-403. https://doi.org/10.1007/s00224-013-9524-6

Hansen, K. A., Miltersen, P. B. & Ibsen-Jensen, R. (2011). The complexity of solving reachability games using value and strategy iteration. Lecture Notes in Computer Science, 6651, 77-90. https://doi.org/10.1007/978-3-642-20712-9_7

Caragiannis, I. & Fehrs, K. (2022). The Complexity of Learning Approval-Based Multiwinner Voting Rules. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 4925-4932. https://doi.org/10.1609/aaai.v36i5.20422

Hansen, T. D. & Ibsen-Jensen, R. (2013). The complexity of interior point methods for solving discounted turn-based stochastic games. I The Nature of Computation, Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings (s. 252-262). Springer VS. https://doi.org/10.1007/978-3-642-39053-1_29

Mathur, U., Pavlogiannis, A. & Viswanathan, M. (2020). The Complexity of Dynamic Data Race Prediction. I Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (s. 713–727). Artikel 3394783 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394783

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S., Östlin, A., Orejas, F. (red.), Spirakis, P. G. (red.) & Leeuwen, J. V. (red.) (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. I Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science udg., Bind 2076/2001, s. 140-151). Springer.

Etessami, K., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014). The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. I R. Lavi (red.), Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (s. 231-243 ). Springer VS. https://doi.org/10.1007/978-3-662-44803-8_20

Ghosh, S. & Simkin, M. (2019). The Communication Complexity of Threshold Private Set Intersection. I A. Boldyreva & D. Micciancio (red.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Bind II, s. 3-29). Springer. https://doi.org/10.1007/978-3-030-26951-7_1

Huang, Z. & Yi, K. (2014). The communication complexity of distributed epsilon-approximations. I D. Shmoys (red.), 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (s. 591-600). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2014.69

Bahr, P., Grathwohl, H. B. & Møgelberg, R. E. (2017). The clocks are ticking: No more delays! I 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 Artikel 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. I W. E. Mackay, S. Brewster & S. Brewster (red.), CHI EA '13 CHI '13 Extended Abstracts on Human Factors in Computing Systems (s. 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. I A. Lehmann & S. Wolf (red.), Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (s. 181-196). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_11

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

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. I É. Tardos, E. Elkind & R. Vohra (red.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (s. 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. I M. Gairing & R. Savani (red.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Bind 9928, s. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

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. I Participative Computing for Sustainable Futures : Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) Artikel 51 https://doi.org/10.1145/3546155.3546156

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

Buemann, B., Schierning, B., Toubro, S., Bibby, B. M., Sørensen, T., Dalgaard, L., Pedersen, O. & Astrup, A. (2001). The association between the val/ala-55 polymorphism of the uncoupling protein 2 gene and exercise efficiency. International Journal of Obesity, 25(4), 467-471. https://doi.org/10.1038/sj.ijo.0801564

Petersen, M. G. & Rasmussen, M. K. (2011). The Ambiguity of Shape Changing Interfaces. Afhandling præsenteret på Organic User Interface Workshop, Funchal, Portugal.

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

Aziz, H., Branzei, S., Filos-Ratsikas, A. & Frederiksen, S. K. S. (2015). The Adjusted Winner Procedure: Characterizations and Equilibria. Afhandling præsenteret på International Joint Conference on Artificial Intelligence, Buinos Aires, Argentina.

Garavel, H., ter Beek, M. H. & van de Pol, J. (2020). The 2020 Expert Survey on Formal Methods. I M. H. ter Beek & D. Nickovic (red.), Formal Methods for Industrial Critical Systems - 25th International Conference, FMICS 2020, Proceedings: FMICS 2020, Vienna, Austria, September 2-3, 2020, Proceedings (s. 3-69). Springer. https://doi.org/10.1007/978-3-030-58298-2_1

Jensen, C. S., Jerma, C., Lu, J., Tanin, E. & Zhou, X. (red.) (2013). The 2013 IEEE 29th International Conference on Data Engineering. IEEE Communications Society. https://doi.org/10.1109/ICDE.2013.6544799

Keilty, A. P., Aranha, D. F., Pagnin, E. & Henríquez, F. R. (Accepteret/In press). That's AmorE: Amortized Efficiency for Pairing Delegation. I CRYPTO 2025

Loeschcke, S., Belongie, S. & Benaim, S. (2023). Text-Driven Stylization of Video Objects. I L. Karlinsky, T. Michaeli & K. Nishino (red.), Computer Vision – ECCV 2022 Workshops (s. 594-609). Springer. https://doi.org/10.1007/978-3-031-25069-9_38

Truică, C. O., Apostol, E. S., Darmont, J. & Assent, I. (2021). TextBenDS: a Generic Textual Data Benchmark for Distributed Systems. Information Systems Frontiers, 23(1), 81-100. https://doi.org/10.1007/s10796-020-09999-y

Koti, N., Suresh, A., Rachuri, S. R. & Patra, A. (2022). Tetrad: Actively Secure 4PC for Secure Training and Inference. Afhandling præsenteret på Network and Distributed Systems Security (NDSS) Symposium 2022, San Diego ,Calif., USA. https://doi.org/10.14722/ndss.2022.24058

Reetz, E., Lehmann, A., Kümper, D. & Tönjes, R. (2012). Test Driven Life Cycle Management for Internet of Things based Services: a Semantic Approach. Afhandling præsenteret på International Conference on Advances in System Testing and Validation Lifecycle, Lisbon, Portugal.

Larsen-Ledet, I. & Korsgaard, H. (2019). Territorial Functioning in Collaborative Writing: Fragmented Exchanges and Common Outcomes. Computer Supported Cooperative Work, 28(3-4), 391-433. https://doi.org/10.1007/s10606-019-09359-8

Wang, Q., Kaul, M., Long, C. & Wong, R. (2014). Terrain-Toolkit: A Multi-Functional Tool for Terrain Data. Proceedings of the VLDB Endowment, 7(13), 1645 - 1648. http://www.vldb.org/pvldb/vol7/p1645-wang.pdf

Wang, Q., Kaul, M., Long, C. & Wong, R. C. W. (2014). Terrain-Toolkit: A multi-functional tool for terrain data. Proceedings of the VLDB Endowment, 7(13), 1645-1648. http://www.scopus.com/inward/record.url?scp=84905856022&partnerID=8YFLogxK

Pakanen, M., Polli, A. M., Lee, S., Lindley, J. & Goncalves, J. (2013). Tending a Virtual Garden: Exploring Connectivity between Cities. I UbiComp '13 Adjunct Proceedings of the 2013 ACM conference on Pervasive and ubiquitous computing adjunct publication (s. 761-764 ). Association for Computing Machinery. https://doi.org/10.1145/2494091.2496004

Bøgh, K. S., Chester, S., Sidlauskas, D. & Assent, I. (2017). Template Skycube Algorithms for Heterogeneous Parallelism on Multicore and GPU Architectures. I SIGMOD 2017 - Proceedings of the 2017 ACM International Conference on Management of Data (s. 447-462). Association for Computing Machinery. https://doi.org/10.1145/3035918.3035962

Mueller, F., Petersen, M. G. & Li, Z. (2023). Technology futures: Towards understanding how to design awe-inspiring futures. International Journal of Human Computer Studies, 170, Artikel 102961. https://doi.org/10.1016/j.ijhcs.2022.102961

Torp, M. T. (2021). Techniques and Tools for Supporting Maintenance of Node.js Programs. Århus Universitet.

Møller, A. (2018). Technical Perspective: WebAssembly: A Quiet Revolution of the Web. Communications of the A C M, 61(12), 106-106. https://doi.org/10.1145/3282508

Lewkowicz, M., Bødker, S., Boden, A. & Fedosov, A. (2021). Technical Design and Development of Future Platforms.

Pauli, A. B., Pablos Sarabia, R., Derczynski, L. & Assent, I. (2023). TeamAmpa at SemEval-2023 Task 3: Exploring Multilabel and Multilingual RoBERTa Models for Persuasion and Framing Detection. I A. K. Ojha, A. S. Doğruöz, G. Da San Martino, H. Tayyar Madabushi, R. Kumar & E. Sartori (red.), Proceedings of the 17th International Workshop on Semantic Evaluation (SemEval-2023) (s. 847–855). Association for Computational Linguistics. https://doi.org/10.18653/v1/2023.semeval-1.117

Christensen, H. B. (2022). Teaching Microservice Architecture Using DevOps - An Experience Report. I Software Architecture - 16th European Conference, ECSA 2022, Proceedings (s. 117-130). Springer. https://doi.org/10.1007/978-3-031-16697-6_8

Christensen, H. B., Kirkeby, M. H., Thomsen, B. & Thomsen, L. L. (2025). Teaching Energy-Efficient Software - An Experience Report. ArXiv. https://arxiv.org/abs/2504.19707

Christensen, H. B. (2023). Teaching Distributed Programming - Revisiting the Broker Pattern. I Proceedings of the 5th European Conference on Software Engineering Education, ECSEE 2023 (s. 162-168). Association for Computing Machinery. https://doi.org/10.1145/3593663.3593674

Christensen, H. B. (2016). Teaching DevOps and Cloud Computing using a Cognitive Apprenticeship and Story-Telling Approach. I ITiCSE 2016 - Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education (s. 174-179). Association for Computing Machinery. https://doi.org/10.1145/2899415.2899426

Viser resultater 401 til 450 ud af 2982

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series