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

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 Conference on Computer-Human Interaction : OZCHI'17 (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.), Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems (pp. 5145-5157). Association for Computing Machinery. Proceedings of CHI'17 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 2017 IEEE International Conference on Big Data (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 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1900-1918). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.124

Larsen, K. G. & Williams, R. (2017). Faster Online Matrix-Vector Multiplication. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (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. Lecture Notes in Computer Science, Vol.. 10543 https://doi.org/10.1007/978-3-319-69284-5_1

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

Sacharidis, D., Bouros, P. & Chondrogiannis, T. (2017). Finding The Most Preferred Path. In E. Hoel, S. Newsam, S. Ravada , R. Tamassia & G. Trajcevski (Eds.), SIGSPATIAL'17 Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems [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.), Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (pp. 36:1-36:10). [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, [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). [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 (Vol. 10174, pp. 333-358). Springer VS. Lecture Notes in Computer Science, Vol.. 10174 https://doi.org/10.1007/978-3-662-54365-8_14

Faonio, A., Nielsen, J. B. & Venturi, D. (2017). Fully Leakage-resilient Signatures Revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model. Theoretical Computer Science, 660(C), 23-56. https://doi.org/10.1016/j.tcs.2016.11.016

Berglin, E. (2017). Geometric covers, graph orientations, counter games. Aarhus Universitet.

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. Proceedings of CHI'17, No. 2017 https://doi.org/10.1145/3116595.3116598

Rotger Griful, S., Jacobsen, R. H., Brewer, R. S. & Rasmussen, M. K. (2017). Green Lift: Exploring the Demand Response Potential of Elevators in Danish Buildings. Energy Research & Social Science, 32, 55-64. https://doi.org/10.1016/j.erss.2017.04.011

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. UIST '17 https://doi.org/10.1145/3126594.3126621

Grønbæk, K. (2017). Hils den digitale tvilling velkommen. Magasinet Finans, [Debat]. https://finans.dk/debat/ECE9685685/hils-den-digitale-tvilling-velkommen/?ctxref=ext

Hansen, T. D., Kaplan, H., Tarjan, R. E. & Zwick, U. (2017). Hollow heaps. ACM Transactions on Algorithms, 13(3), 42:0-42:27. [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

Rav, M., Arge, L., Raza, S. & Revsbæk, M. (2017). I/O-Efficient Event Based Depression Flood Risk. In S. Fekete & V. Ramachandran (Eds.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 259-269). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768

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). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics, No. 80 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. Lecture Notes in Computer Science, Vol.. 10678 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). [3] Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics, Vol.. 87 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, Uppsala, Sweden, April 22-29, 2017, Proceedings (Vol. 10202, pp. 99-115). Springer VS. Lecture Notes in Computer Science, Vol.. 10202 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), [3]. https://doi.org/10.1145/3046673

Mathisen, A., Nielsen, M. & Grønbæk, K. (2017). Integrating Guided Clustering in Visual Analytics to Support Domain Expert Reasoning Processes. 1. Poster session presented at 19th EG/VGTC Conference on Visualization (EuroVis) 2017, Barcelona, Spain. https://diglib.eg.org/bitstream/handle/10.2312/eurp20171164/eurovis2017-posters0123-file1.pdf?sequence=2&isAllowed=y

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. Lecture Notes in Computer Science, Vol.. 10438 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

Nielsen, T. K., Benito, B., Svenning, J-C., Sandel, B. S., McKerracher, L. J., Riede, F. & Kjærgaard, P. C. (2017). Investigating Neanderthal dispersal above 55°N in Europe during the Last Interglacial Complex. Quaternary International, 431(Part B), 88-103. https://doi.org/10.1016/j.quaint.2015.10.039

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. Lecture Notes in Computer Science, Vol.. 10681 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. Lecture Notes in Computer Science, Vol.. 10624 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, Hong Kong, China, December 3-7, 2017, Proceedings, Part I (Vol. 10624, pp. 629-659). Springer VS. Lecture Notes in Computer Science, Vol.. 10624 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. ISS '17 https://doi.org/10.1145/3132272.3134117

Ernst, E., Møller, A., Schwarz, M. & Strocco, F. (2017). Message safety in Dart. Science of Computer Programming, 133/1(1), 51-73. https://doi.org/10.1016/j.scico.2016.06.006

Skov, L. (2017). Methods for analyzing genetic variation in modern and archaic humans.

Lehmann, A. (2017). Modelling Emission of Pollutants from transportation using mobile sensing data: Advancing modelling of street level pollution and climate forcing gas emissions. Aarhus Universitet.

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. [7536203]. https://doi.org/10.1109/TVCG.2016.2598619

Giacomelli, I. (2017). New Applications of Secret-Sharing in Cryptography. Aarhus Universitet.

Faonio, A. & Nielsen, J. B. (2017). Non-malleable Codes with Split-State Refresh. In S. Fehr (Ed.), Public-Key Cryptography -- PKC 2017 (pp. 279-309). Springer VS. Lecture Notes in Computer Science, Vol.. 10174 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. D A I M I P B, No. 599 https://doi.org/10.7146/dpb.v43i599.26410

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). [32] Schloss Dagstuhl--Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics, Vol.. 92 https://doi.org/10.4230/LIPIcs.ISAAC.2017.32

Polychroniadou, A. (2017). On the Communication and Round Complexity of Secure Computation. Department of Computer Science, University of Aarhus.

Dowsley, R. & Nascimento, A. C. A. (2017). On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability. IEEE Transactions on Information Theory, 63(10), 6819-6826. [8000673]. https://doi.org/10.1109/TIT.2017.2735423

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. Lecture Notes in Computer Science, Vol.. 10175 https://doi.org/10.1007/978-3-662-54388-7_13

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 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 633-638). [8104096] https://doi.org/10.1109/FOCS.2017.64

Displaying results 401 to 450 out of 4565

Comments on content:

Marianne Dammand Iversen

Revised 03.06.2020

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University