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

Bringmann, K., Grønlund, A. & Larsen, K. G. (2017). A Dichotomy for Regular Expression Membership Testing. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 307-318). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2017.36

Bouros, P. & Mamoulis, N. (2017). A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins. Proceedings of the VLDB Endowment, 10(11), 1346-1357. https://doi.org/10.14778/3137628.3137644

David, B. M. (2017). A Framework For Efficient Homomorphic Universally Composable Commitments. Aarhus, Denmark: Department of Computer Science, University of Aarhus.

Mathisen, A., Krogh Sørensen, S., Stisen, A., Blunck, H. & Grønbæk, K. (2017). A Study on the Impact of Indoor Positioning Performance on Activity Recognition Applications. In MobiQuitous 2017 – 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (pp. 58-67). ACM New York, NY, USA : Association for Computing Machinery. https://doi.org/10.1145/3144457.3144501

Andreasen, E., Gong, L., Møller, A., Pradel, M., Selakovic, M., Sen, K. & Staicu, C-A. (2017). A Survey of Dynamic Analysis and Test Generation for JavaScript. A C M Computing Surveys, 50(5), 66:1-66:36. https://doi.org/10.1145/3106739

Tomlein, M. & Grønbæk, K. (2017). A Visual Programming Approach Based on Domain Ontologies for Configuring Industrial IoT Installations. In Proceedings of the 7th International Conference on the Internet of Things [9] New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/3131542.3131552

Raskin, M. (2017). A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model. In I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 (Vol. 80, pp. 88:1--88:12). [88] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, Vol.. 80 https://doi.org/10.4230/LIPIcs.ICALP.2017.88

Krogh-Jespersen, M., Svendsen, K. & Birkedal, L. (2017). A relational model of types-and-effects in higher-order concurrent separation logic. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages: POPL 2017 (pp. 218-231). New York, NY, USA : Association for Computing Machinery. https://doi.org/10.1145/3009837.3009877

Berglin, E. & Brodal, G. S. (2017). A simple greedy algorithm for dynamic graph orientation. In Y. Okamoto & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (pp. 12:1-12:12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, No. 92 https://doi.org/10.4230/LIPIcs.ISAAC.2017.12

Dowsley, R., Michalas, A., Nagel, M. & Paladi, N. (2017). A survey on design and implementation of protected searchable data in the cloud. Computer Science Review, 26(Supplement C), 17 - 30. https://doi.org/10.1016/j.cosrev.2017.08.001

Fuchsbauer, G., Gay, R., Kowalczyk, L. & Orlandi, C. (2017). Access Control Encryption for Equality, Comparison, and More. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (Vol. 10175, pp. 88-118). Springer, Berlin, Heidelberg: Springer VS. Lecture Notes in Computer Science, Vol.. 10175 https://doi.org/10.1007/978-3-662-54388-7_4

Jafargholi, Z., Scafuro, A. & Wichs, D. (2017). Adaptively Indistinguishable Garbled Circuits. In Y. Kalai & L. Reyzin (Eds.), Theory of Cryptography (Vol. 10678, pp. 40-71). Cham: Springer VS. Lecture Notes in Computer Science, Vol.. 10678 https://doi.org/10.1007/978-3-319-70503-3

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I (Vol. 10210). Springer, Cham: Springer VS. Lecture Notes in Computer Science, Vol.. 10210 https://doi.org/10.1007/978-3-319-56620-7

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part II (Vol. 10211). Springer, Cham: Springer VS. Lecture Notes in Computer Science, Vol.. 10211 https://doi.org/10.1007/978-3-319-56614-6

Coron, J-S. & Nielsen, J. B. (Eds.) (2017). Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part III (Vol. 10212). Springer, Cham: Springer VS. Lecture Notes in Computer Science, Vol.. 10212 https://doi.org/10.1007/978-3-319-56617-7

Cramer, R., Damgård, I., Xing, C. & Yuan, C. (2017). Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack. In J-S. Coron & J. Buus Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Vol. 10210, pp. 479-500). Springer VS. Lecture Notes in Computer Science, Vol.. 10210 https://doi.org/10.1007/978-3-319-56620-7_17

Trifiletti, R. (2017). Amortizing Maliciously Secure Two-party Computation. Department of Computer Science, Aarhus University.

Fauzi, P., Lipmaa, H., Siim, J. & Zajac, M. (2017). An Efficient Pairing-Based Shuffle Argument. In T. Takagi & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (pp. 97-127). Springer VS. Lecture Notes in Computer Science, Vol.. 10625 https://doi.org/10.1007/978-3-319-70697-9_4

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. ACM International conference on Tangible, Embedded and Embodied Interaction (TEI), No. TEI 2017 https://doi.org/10.1145/3024969.3024983

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2017). An efficient algorithm for the 1D total visibility-index problem. In S. Fekete & V. Ramachandran (Eds.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.18

Spencer, B., Benedikt, M., Møller, A. & Breugel, F. V. (2017). ArtForm: A Tool for Exploring the Codebase of Form-based Websites. In K. Sen & T. Bultan (Eds.), ISSTA 2017 - Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 380-383). New York, NY, USA: Association for Computing Machinery. ISSTA 2017 https://doi.org/10.1145/3092703.3098226

Sonne, T. (2017). Assistive Technologies to Empower Children with ADHD: Conceptual Framework and Technological Solutions. Aarhus: Aarhus Universitet.

Jafargholi, Z., Kamath, C., Klein, K., Komargodski, I., Pietrzak, K. & Wichs, D. (2017). Be Adaptive, Avoid Overcommitting. In J. Katz & H. Shacham (Eds.), Advances in Cryptology -- CRYPTO 2017 (Vol. 10401, pp. 133-163). Cham: Springer VS. Lecture Notes in Computer Science, Vol.. 10401 https://doi.org/10.1007/978-3-319-63688-7_5

Krarup Hansen, T., Winther Jensen, J., Grønbæk, K. & Obel, C. M. (2017). Big data i sundhed rammer de svageste. Politiken, kroniken, 7-8.

Barnagaud, J-Y., Kissling, W. D., Tsirogiannis, C., Fisikopoulos, V., Villeger, S., Sekercioglu, C. H. & Svenning, J-C. (2017). Biogeographical, environmental and anthropogenic determinants of global patterns in bird taxonomic and trait turnover. Global Ecology and Biogeography, 26(10), 1190-1200. https://doi.org/10.1111/geb.12629

Damgård, I., Faust, S., Mukherjee, P. & Venturi, D. (2017). Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. Journal of Cryptology, 30(1), 152-190. https://doi.org/10.1007/s00145-015-9218-0

Lee, B., Deng, Q., Hoggan, E. & Oulasvirta, A. (2017). Boxer: a multimodal collision technique for virtual objects. In E. Lank & A. Vinciarelli (Eds.), Proceedings of the 19th ACM International Conference on Multimodal Interaction (pp. 252-260). Association for Computing Machinery. https://doi.org/10.1145/3136755.3136761

Haulrik, N., Petersen, R. M. & Merritt, T. (2017). CADLens: Haptic feedback for navigating in 3D environments. In DIS 2017 Companion - Proceedings of the 2017 ACM Conference on Designing Interactive Systems (pp. 127-131). Association for Computing Machinery. https://doi.org/10.1145/3064857.3079132

Brodal, G. S. & Mampentzidis, K. (2017). Cache oblivious algorithms for computing the triplet distance between trees. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 21:1--21:14). [21] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, Vol.. 87 https://doi.org/10.4230/LIPIcs.ESA.2017.21

Sonne, T., Merritt, T. R., Marshall, P., Lomholt, J. J., Müller, J. & Grønbæk, K. (2017). Calming Children When Drawing Blood Using Breath-based Biofeedback. In DIS 2017 - Proceedings of the 2017 Conference on Designing Interactive Systems (pp. 725-737). Association for Computing Machinery. https://doi.org/10.1145/3064663.3064742

Dinsdale-Young, T., da Rocha Pinto, P., Andersen, K. J. A. & Birkedal, L. (2017). Caper: Automatic Verification for Fine-Grained Concurrency. In H. Yang (Ed.), Programming Languages and Systems: 26th European Symposium on Programming, ESOP 2017 (Vol. 10201, pp. 420-447). Berlin, Heidelberg: Springer VS. Lecture Notes in Computer Science, Vol.. 10201 https://doi.org/10.1007/978-3-662-54434-1_16

Tomlein, M., Booveraghavan, S., Agarwal, Y. & Dey, A. (2017). CharIoT: an end-user programming environment for the IoT. Poster session presented at International Conference on the Internet of Things, Linz, Austria. https://doi.org/10.1145/3131542.3140261

Mathisen, A. & Grønbæk, K. (2017). Clear Visual Separation of Temporal Event Sequences. In 2017 IEEE Visualization in Data Science (VDS) IEEE. https://doi.org/10.1109/VDS.2017.8573439

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). New York, NY: Association for Computing Machinery. https://doi.org/10.1145/2998181.2998333

Lacerda, F., Renes, J. M. & Scholz, V. B. (2017). Coherent-state constellations and polar codes for thermal Gaussian channels. Physical Review A, 95(6), [062343]. https://doi.org/10.1103/PhysRevA.95.062343

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 Conference on Computer-Human Interaction: OZCHI'17 (pp. 68-76). Brisbane: 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. IS-EUD 2017

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. Proceedings of the International Joint Conference on Artificial Intelligence, No. 2017

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. [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.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (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. Lecture Notes in Computer Science, Vol.. 9603 https://doi.org/10.1007/978-3-662-54970-4_10

Christensen, H. B. (2017). Configuration Management: Preprint of Chapter 33 in "Flexible, Reliable Software" 2nd Edition.

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS ’17 (pp. 1-15). San Diego, CA: Internet Society. https://doi.org/10.14722/ndss.2017.23075

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 (Vol. 10175, pp. 428-460 ). Berlin, Heidelberg: Springer VS. Lecture Notes in Computer Science, No. 10175 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), [27]. https://doi.org/10.1145/3121431

Bødker, S., Grønbaek, K. & Kyng, M. (2017). Cooperative design: Techniques and experiences from the scandinavian scene. In Participatory Design: Principles and Practices (eBook ed., pp. 157-175). CRC Press. https://doi.org/10.1201/9780203744338

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.

Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In DUPLO: Unifying Cut-and-Choose for Garbled Circuits (pp. 3-20). New York, NY, USA : Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991

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). New York, NY: 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). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics, No. 80 https://doi.org/10.4230/LIPIcs.ICALP.2017.42

Displaying results 301 to 350 out of 4525

Comments on content:

Marianne Dammand Iversen

Revised 13.09.2019

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University