Aarhus University Seal

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

Stisen, A. & Verdezoto, N. (2017). Clinical and Non-clinical Handovers: Designing for Critical Moments. In CSCW 2017 - Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing (pp. 2166-2178). Association for Computing Machinery. https://doi.org/10.1145/2998181.2998333
Petersen, M. G., Rasmussen, M. K. & Krogh, P. G. (2017). Collective Interaction: A Designerly Visual Analysis of Seven Research Prototypes. In Proceedings of the 29th Australian Computer-Human Interaction Conference: Human-Nature, OzCHI 2017 (pp. 68-76). Association for Computing Machinery. https://doi.org/10.1145/3152771.3152779
Bødker, S. & Lyle, P. (2017). Community end-user development: Patterns, platforms, possibilities and problems. In K. J.V. , S. I.A.C., D. A. A., P. A. & B. A. (Eds.), IS-EUD 2017 6th international symposium on end-user (pp. 76-81). Technische Universiteit Eindhoven. https://pure.tue.nl/ws/files/69763287/IS_EUD2017_extended_abstracts.pdf#page=77
Guo, Q., An, B., Bošanský, B. & Kiekintveld, C. (2017). Comparing strategic secrecy and Stackelberg commitment in security games. In S. C. (Ed.), 26th International Joint Conference on Artificial Intelligence, IJCAI 2017 (pp. 3691-3699). International Joint Conferences on Artificial Intelligence.
Bosanský, B., Brânzei, S., Hansen, K. A., Lund, T. B. & Miltersen, P. B. (2017). Computation of Stackelberg Equilibria of Finite Sequential Games. A C M Transactions on Economics and Computation, 5(4), 23:1-23:24. Article 23. https://doi.org/10.1145/3133242
Staals, F. & Tsirogiannis, C. (2017). Computing the Expected Value and Variance of Geometric Measures. In S. Fekete & V. Ramachandran (Eds.), 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017 (pp. 232 - 246). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.19
Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017). Confidential benchmarking based on multiparty computation. In J. Grossklags & B. Preneel (Eds.), Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Vol. 9603 LNCS, pp. 169-187). Springer VS. https://doi.org/10.1007/978-3-662-54970-4_10
Hazay, C., Polychroniadou, A. & Venkitasubramaniam, M. (2017). Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: PKC 2017 (Vol. 10175, pp. 428-460 ). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_15
Müller, J., Oulasvirta, A. & Murray-Smith, R. (2017). Control theoretic models of pointing. ACM Transactions on Computer-Human Interaction, 24(4), Article 27. https://doi.org/10.1145/3121431
Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017). Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery.
Eenberg, K., Larsen, K. G. & Yu, H. (2017). DecreaseKeys are expensive for external memory priority queues. In STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Vol. Part F128415, pp. 1081-1093). Association for Computing Machinery. https://doi.org/10.1145/3055399.3055437
Georgiadis, L., Hansen, T. D., Italiano, G. F., Krinninger, S. & Parotsidis, N. (2017). Decremental Data Structures for Connectivity and Dominators in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Vol. 80, pp. 42:1-42:15). Article 42 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2017.42
Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 3-20). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991
Müller, J. (2017). Dynamics of pointing with pointer acceleration. In R. Bernhaupt, G. Dalvi, A. Joshi, D. K. Balkrishan, J. O'Neill & M. Winckler (Eds.), Human-Computer Interaction - INTERACT 2017 - 16th IFIP TC 13 International Conference, Proceedings (Vol. 10515 LNCS, pp. 475-495). Springer VS. https://doi.org/10.1007/978-3-319-67687-6_33
Bannon, L. J. (2017). Elucidating frames of reference for HCI. In S. D. J. Barbosa & K. Breitman (Eds.), Conversations Around Semiotic Engineering (pp. 5-11). Springer. https://doi.org/10.1007/978-3-319-56291-9_2
Nielsen, K., Daugbjerg, P. S. & Sillasen, M. (2017). Engineering - en uddybende kommentar til en kommentar fra Kolmos og Grunwald. MONA - Matematik- og Naturfagsdidaktik, 2017(03), 95-97.
Nielsen, K., Sillasen, M. K. & Daugbjerg, P. S. (2017). Engineering - svaret på naturfagenes udfordringer? MONA: Matematik og Naturfagsdidaktik, 2017-2, 64. https://tidsskrift.dk/mona/article/view/36656
Chondrogiannis, T., Bouros, P., Gamper, J. & Leser, U. (2017). Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. 414-425. Paper presented at International Conference on Extending Database Technology, Venice, Italy. https://doi.org/10.5441/002/edbt.2017.37
Rasmussen, M. K., Rasmussen, M. K., Verdezoto, N., Brewer, R. S., Nielsen, L. L. & Bouvin, N. O. (2017). Exploring the Flexibility of Everyday Practices for Shifting Energy Consumption through ClockCast. In Proceedings of the 29th Australian Computer-Human Interaction Conference: Human-Nature, OzCHI 2017 (pp. 396-306). Association for Computing Machinery. https://doi.org/10.1145/3152771.3152803
Feuchtner, T. & Müller, J. (2017). Extending the Body for Interaction with Reality. In G. Mark & S. Fussell (Eds.), CHI 2017 - Proceedings of the 2017 ACM SIGCHI Conference on Human Factors in Computing Systems: Explore, Innovate, Inspire (pp. 5145-5157). Association for Computing Machinery. https://doi.org/10.1145/3025453.3025689
Arge, L., Rav, M., Svendsen, S. C. & Truelsen, J. (2017). External Memory Pipelining Made Easy With TPIE. In Proceedings - 2017 IEEE International Conference on Big Data, Big Data 2017 (pp. 319-324). IEEE. https://doi.org/10.1109/BigData.2017.8257940
Chechik, S., Hansen, T. D., Italiano, G. F., Loitzenbauer, V. & Parotsidis, N. (2017). Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1900-1918). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.124
Biniaz, A., Bose, P., van Duijn, I., Maheshwari, A. & Smid, M. (2017). Faster algorithms for the minimum red-blue-purple spanning graph problem. Journal of Graph Algorithms and Applications, 21(4), 527-546. https://doi.org/10.7155/jgaa.00427
Larsen, K. G. & Williams, R. (2017). Faster Online Matrix-Vector Multiplication. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (Vol. PRDA17, pp. 2182-2189). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782
Orlandi, C. (2017). Faster Zero-Knowledge Protocols and Applications: Invited Talk Abstract. In P. Farshim & E. Simion (Eds.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Vol. 10543, pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-319-69284-5_1
Sacharidis, D., Bouros, P. & Chondrogiannis, T. (2017). Finding The Most Preferred Path. In E. Hoel, S. Newsam, S. Ravada , R. Tamassia & G. Trajcevski (Eds.), GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems Article 5 Association for Computing Machinery. https://doi.org/10.1145/3139958.3140029
Rav, M., Lowe, A. & Agarwal, P. K. (2017). Flood Risk Analysis on Terrains. In E. Hoel , S. Newsam, S. Ravada, R. Tamassia & G. Trajcevski (Eds.), GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (pp. 36:1-36:10). Article 36 Association for Computing Machinery. https://doi.org/10.1145/3139958.3139985
Mezzetti, G. (2017). Foreword to the thematic track: Quality aspects in verification and validation. Proceedings - 2016 10th International Conference on the Quality of Information and Communications Technology, QUATIC 2016, Article 7814536. https://doi.org/10.1109/QUATIC.2016.039
Pedersen, M. V. & Askarov, A. (2017). From Trash to Treasure: Timing-Sensitive Garbage Collection. In 2017 IEEE Symposium on Security and Privacy, SP 2017 - Proceedings (pp. 693-709). Article 7958605 IEEE Computer Society Press. https://doi.org/10.1109/SP.2017.64
Faonio, A. & Nielsen, J. B. (2017). Fully Leakage-Resilient Codes. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10174, pp. 333-358). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_14
Merritt, T. R., Nielsen, C. L., Jakobsen, F. L. & Grønbæk, J. E. (2017). GlowPhones: Designing for Proxemics Play with Low-Resolution Displays in Location-based Games. In Proceedings of the Annual Symposium on Computer-Human Interaction in Play: CHI PLAY '17 (pp. 69-81). Association for Computing Machinery. https://doi.org/10.1145/3116595.3116598
Fender, A., Lindlbauer, D., Herholz, P., Alexa, M. & Müller, J. (2017). HeatSpace: Automatic Placement of Displays by Empirical Analysis of User Behavior. In UIST 2017 - Proceedings of the 30th Annual ACM Symposium on User Interface Software and Technology (pp. 611-621). Association for Computing Machinery. https://doi.org/10.1145/3126594.3126621
Hansen, T. D., Kaplan, H., Tarjan, R. E. & Zwick, U. (2017). Hollow heaps. ACM Transactions on Algorithms, 13(3), 42:0-42:27. Article 42. https://doi.org/10.1145/3093240
Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S. & Wilkinson, B. T. (2017). How to Morph Planar Graph Drawings. S I A M Journal on Computing, 46(2), 824-852. https://doi.org/10.1137/16M1069171
Bringmann, K., Hansen, T. D. & Krinninger, S. (2017). Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Vol. 80, pp. 124:1-124:16). Article 124 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2017.124
Aggarwal, D., Kazana, T. & Obremski, M. (2017). Inception Makes Non-malleable Codes Stronger. In Y. Kalai & L. Reyzin (Eds.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Vol. 10678, pp. 319-343). Springer VS. https://doi.org/10.1007/978-3-319-70503-3_10