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

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
Afshani, P. & Wei, Z. (2017). Independent range sampling, revisited. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 3:1--3:14). Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.3
Kristensen, E. K. & Møller, A. (2017). Inference and Evolution of TypeScript Declaration Files. In M. Huisman & J. Rubin (Eds.), Fundamental Approaches to Software Engineering - 20th International Conference, FASE 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 20th International Conference, FASE 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings (Vol. 10202, pp. 99-115). Springer VS. https://doi.org/10.1007/978-3-662-54494-5_6
Madalgo, P. A., Barbay, J. & Chan, T. M. (2017). Instance-optimal geometric algorithms. Journal of the ACM, 64(1), Article 3. https://doi.org/10.1145/3046673
Kristensen, J., Mai, S. T., Assent, I., Jacobsen, J., Vo, B. & Le, A. (2017). Interactive exploration of subspace clusters for high dimensional data. In D. Benslimane, E. Damiani, W. I. Grosky, A. Hameurlain, A. Sheth & R. R. Wagner (Eds.), Database and Expert Systems Applications - 28th International Conference, DEXA 2017, Proceedings (Vol. 10438 LNCS, pp. 327-342). Springer VS. https://doi.org/10.1007/978-3-319-64468-4_25
Krebbers, R., Timany, A. & Birkedal, L. (2017). Interactive proofs in higher-order concurrent separation logic. In A. D. Gordon & G. Castagna (Eds.), Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 (pp. 205-217). Association for Computing Machinery. https://doi.org/10.1145/3009837.3009855
Rav, M., Arge, L., Raza, S. & Revsbæk, M. (2017). I/O-Efficient Event Based Depression Flood Risk. In S. Fekete & V. Ramachandran (Eds.), 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017 (Vol. PRAL17, pp. 259-269). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768
Nielsen, B. L. & Nielsen, K. (2017). Kompetenceudvikling for undervisere/pædagogisk personale. In J. A. Nielsen (Ed.), Litteraturstudium til arbejdet med en national naturvidenskabsstrategi (pp. 50-72). Institut for Naturfagenes Didaktik, Københavns Universitet. https://astra.dk/sites/default/files/Naturvidenskabsstrategi_Litteraturstudium_Rapport.pdf
Cramer, R., Damgård, I., Döttling, N., Giacomelli, I. & Xing, C. (2017). Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. In J. Shikata (Ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Vol. 10681, pp. 1-25). Springer VS. https://doi.org/10.1007/978-3-319-72089-0_1
Hazay, C., Scholl, P. & Soria-Vazquez, E. (2017). Low cost constant round MPC combining BMR and oblivious transfer. 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 (Vol. 10624, pp. 598-628). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_21
Ghosh, S., Nielsen, J. B. & Nilges, T. (2017). Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. 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 (Vol. 10624, pp. 629-659). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_22
Bødker, S. (2017). Meaning and Ubiquitous Technologies. In S. Diniz Junqueira Barbosa & K. Breitman (Eds.), Conversations Around Semiotic Engineering (pp. 13-20). Springer VS. https://doi.org/10.1007/978-3-319-56291-9_3
Fender, A. R., Benko, H. & Wilson, A. (2017). MeetAlive: Room-Scale Omni-Directional Display System for Multi-User Content and Control Sharing. In Proceedings of the 2017 ACM International Conference on Interactive Surfaces and Spaces, ISS 2017 (pp. 106-115). Association for Computing Machinery. https://doi.org/10.1145/3132272.3134117
Van Goethem, A., Staals, F., Löffler, M., Dykes, J. & Speckmann, B. (2017). Multi-Granular Trend Detection for Time-Series Analysis. IEEE Transactions on Visualization and Computer Graphics, 23(1), 661-670. Article 7536203. https://doi.org/10.1109/TVCG.2016.2598619
Faonio, A. & Nielsen, J. B. (2017). Non-malleable Codes with Split-State Refresh. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (pp. 279-309). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_12
Østerby, O. (2017). On Saulyev's Methods. In DAIMI Report Series (Vol. 599, pp. 1-11). Aarhus Universitet. https://doi.org/10.7146/dpb.v43i599.26410
Polychroniadou, A. (2017). On the Communication and Round Complexity of Secure Computation. Department of Computer Science, University of Aarhus.
Nielsen, J. B. & Ranellucci, S. (2017). On the computational overhead of MPC with dishonest majority. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10175, pp. 369-395). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_13
Freksen, C. B. & Larsen, K. G. (2017). On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. In O. Yoshio & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (pp. 32:1-32:12). Article 32 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2017.32
Houben, S., Marquardt, N., Vermeulen, J. K., Klokmose, C. N., Schöning, J., Reiterer, H. & Holz, C. (2017). Opportunities and challenges for cross-device interactions in the wild. interactions, 24(5), 58-63. https://doi.org/10.1145/3121348
Larsen, K. G. & Nelson, J. (2017). Optimality of the Johnson-Lindenstrauss Lemma. In Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (pp. 633-638). Article 8104096 https://doi.org/10.1109/FOCS.2017.64
Afshani, P. & Van Duijn, I. (2017). Permuting and batched geometric lower bounds in the I/O model. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 2:1-2:13). Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.2
Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D. & Zaverucha, G. (2017). Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1825-1842). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133997
Adamsen, C. Q., Møller, A. & Tip, F. (2017). Practical Initialization Race Detection for JavaScript Web Applications. Proceedings of the ACM on Programming Languages , 1(OOPSLA), 66:1-66:22. Article 66. https://doi.org/10.1145/3133890
Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Predictable arguments of knowledge. 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. 121-150). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_6
Du, X., Ooi, B. C., Özsu, M. T., Cui, B., Chen, L., Jensen, C. S. & Shahabi, C. (2017). Preface. Lecture Notes in Computer Science, 10367 LNCS, V-VI. https://doi.org/10.1007/978-3-319-63564-4
Hallgren, P. A., Orlandi, C. & Sabelfeld, A. (2017). PrivatePool: Privacy-Preserving Ridesharing. In Proceedings - IEEE 30th Computer Security Foundations Symposium, CSF 2017 (pp. 276-291). Article 8049726 IEEE Press. https://doi.org/10.1109/CSF.2017.24
Rasmussen, T. A. & Merritt, T. R. (2017). Projectables. In S. M.A., R. A., J. P. & L. P. (Eds.), CAADRIA 2017 - 22nd International Conference on Computer-Aided Architectural Design Research in Asia: Protocols, Flows and Glitches (pp. 757-766). The Association for Computer-Aided Architectural Design Research in Asia (CAADRIA).
Karbyshev, A., Bjørner, N., Itzhaky, S., Rinetzky, N. & Shoham, S. (2017). Property-directed inference of universal invariants or proving their absence. Journal of the ACM, 64(1), 7:1-7:33. Article 7. https://doi.org/10.1145/3022187
Grønbæk, J. E., Korsgaard, H., Petersen, M. G., Henriksen Birk, M. & Krogh, P. G. (2017). Proxemic Transitions: Designing Shape-Changing Furniture for Informal Meetings. In CHI 2017 - Proceedings of the 2017 ACM SIGCHI Conference on Human Factors in Computing Systems: Explore, Innovate, Inspire (pp. 7029-7041) https://doi.org/10.1145/3025453.3025487
Midtgaard, J. & Møller, A. (2017). QuickChecking static analysis properties. Software Testing, Verification and Reliability, 27(6), Article e1640. https://doi.org/10.1002/stvr.1640
Brueggemann, M. J., Strohmayer, A., Marshall, M., Birbeck, N. & Thomas, V. (2017). Reflexive Practices for the Future of Design Education: An Exercise in Ethno-Empathy. Information Design Journal, 20(sup1), S1260-S1269. https://doi.org/10.1080/14606925.2017.1352655
Degano, P., Ferrari, G.-L. & Mezzetti, G. (2017). Regular and context-free nominal traces. Acta Informatica, 54(4), 399-433. https://doi.org/10.1007/s00236-016-0261-6
Obremski, M. & Skorski, M. (2017). Renyi Entropy Estimation Revisited. In J. D. P. Rolim, K. Jansen, D. P. Williamson & S. S. Vempala (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017 (Vol. 81, pp. 20:1-20:15). Article 20 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20
Adamsen, C. Q., Møller, A., Karim, R., Sridharan, M., Tip, F. & Sen, K. (2017). Repairing Event Race Errors by Controlling Nondeterminism. In Proceedings - 2017 IEEE/ACM 39th International Conference on Software Engineering, ICSE 2017 (pp. 289-299). Article 7985670 IEEE Press. https://doi.org/10.1109/ICSE.2017.34
Cascudo, I., Damgård, I., Farràs, O. & Ranellucci, S. (2017). Resource-Efficient OT Combiners with Active Security. In Y. Kalai & L. Reyzin (Eds.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Vol. 10678, pp. 461-486). Springer VS. https://doi.org/10.1007/978-3-319-70503-3_15
Haagh, H., Ji, Y., Li, C., Orlandi, C. & Song, Y. (2017). Revealing Encryption for Partial Ordering. In M. O’Neill (Ed.), Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings (pp. 3-22). Springer VS. https://doi.org/10.1007/978-3-319-71045-7_1
Nielsen, K. & Horst, S. (2017). Sammen om naturvidenskabsstrategien. MONA: Matematik og Naturfagsdidaktik, 2017(03), 61-71. https://tidsskrift.dk/mona/article/download/96861/145618