Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

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. Afhandling præsenteret på International Conference on Extending Database Technology, Venice, Italien. 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. I Proceedings of the 29th Australian Computer-Human Interaction Conference: Human-Nature, OzCHI 2017 (s. 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. I G. Mark & S. Fussell (red.), CHI 2017 - Proceedings of the 2017 ACM SIGCHI Conference on Human Factors in Computing Systems: Explore, Innovate, Inspire (s. 5145-5157). Association for Computing Machinery. https://doi.org/10.1145/3025453.3025689

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. I 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (s. 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. I P. N. Klein (red.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (Bind PRDA17, s. 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. I P. Farshim & E. Simion (red.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Bind 10543, s. 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. I E. Hoel, S. Newsam, S. Ravada , R. Tamassia & G. Trajcevski (red.), GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems Artikel 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. I E. Hoel , S. Newsam, S. Ravada, R. Tamassia & G. Trajcevski (red.), GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (s. 36:1-36:10). Artikel 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, Artikel 7814536. https://doi.org/10.1109/QUATIC.2016.039

Pedersen, M. V. & Askarov, A. (2017). From Trash to Treasure: Timing-Sensitive Garbage Collection. I 2017 IEEE Symposium on Security and Privacy, SP 2017 - Proceedings (s. 693-709). Artikel 7958605 IEEE Computer Society Press. https://doi.org/10.1109/SP.2017.64

Faonio, A. & Nielsen, J. B. (2017). Fully Leakage-Resilient Codes. I S. Fehr (red.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Bind 10174, s. 333-358). Springer VS. 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. I Proceedings of the Annual Symposium on Computer-Human Interaction in Play: CHI PLAY '17 (s. 69-81). Association for Computing Machinery. 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. I UIST 2017 - Proceedings of the 30th Annual ACM Symposium on User Interface Software and Technology (s. 611-621). Association for Computing Machinery. https://doi.org/10.1145/3126594.3126621

Pedersen, T. B., Madsen, O. L., Alstrup, S., Togsverd, T., Bardram, J., Bechmann, A., Glæsel, J. & Grønbæk, K. (2017). Hele Danmark som digital super-region? Akademiet for de Tekniske Videnskaber (ATV). https://atv.dk/sites/atv.dk/files/media/document/Notat_ATV_Debatoplaeg_fra_ATV%27s_Digitale_Vismaend_-_Danmark_som_digital_vaekstregion_final_web2_September_2017.pdf

Grønbæk, K. (2017). Hils den digitale tvilling velkommen. Magasinet Finans, Artikel 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. Artikel 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. I I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (red.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Bind 80, s. 124:1-124:16). Artikel 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. I Y. Kalai & L. Reyzin (red.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Bind 10678, s. 319-343). Springer VS. https://doi.org/10.1007/978-3-319-70503-3_10

Kristensen, E. K. & Møller, A. (2017). Inference and Evolution of TypeScript Declaration Files. I M. Huisman & J. Rubin (red.), 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 (Bind 10202, s. 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), Artikel 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 præsenteret på 19th EG/VGTC Conference on Visualization (EuroVis) 2017, Barcelona, Spanien. 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. I D. Benslimane, E. Damiani, W. I. Grosky, A. Hameurlain, A. Sheth & R. R. Wagner (red.), Database and Expert Systems Applications - 28th International Conference, DEXA 2017, Proceedings (Bind 10438 LNCS, s. 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. I A. D. Gordon & G. Castagna (red.), Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 (s. 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. I S. Fekete & V. Ramachandran (red.), 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017 (Bind PRAL17, s. 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. I J. A. Nielsen (red.), Litteraturstudium til arbejdet med en national naturvidenskabsstrategi (s. 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. I J. Shikata (red.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (Bind 10681, s. 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. I T. Takagi & T. Peyrin (red.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Bind 10624, s. 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. I T. Takagi & T. Peyrin (red.), Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (Bind 10624, s. 629-659). Springer VS. https://doi.org/10.1007/978-3-319-70694-8_22

Bødker, S. (2017). Meaning and Ubiquitous Technologies. I S. Diniz Junqueira Barbosa & K. Breitman (red.), Conversations Around Semiotic Engineering (s. 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. I Proceedings of the 2017 ACM International Conference on Interactive Surfaces and Spaces, ISS 2017 (s. 106-115). Association for Computing Machinery. 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.

Rijke, E., Shulman, M. & Spitters, B. (2017, jun. 27). Modalities in homotopy type theory. https://arxiv.org/abs/1706.07526

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.

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. I S. Fehr (red.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (s. 279-309). Springer VS. https://doi.org/10.1007/978-3-662-54365-8_12

Bury, M. & Schwiegelshohn, C. (2017). On finding the Jaccard center. I A. Muscholl, P. Indyk, F. Kuhn & I. Chatzigiannakis (red.), 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 Artikel 23 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2017.23

Østerby, O. (2017). On Saulyev's Methods. I DAIMI Report Series (Bind 599, s. 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. I S. Fehr (red.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Bind 10175, s. 369-395). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_13

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. Artikel 8000673. https://doi.org/10.1109/TIT.2017.2735423

Freksen, C. B. & Larsen, K. G. (2017). On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. I O. Yoshio & T. Tokuyama (red.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (s. 32:1-32:12). Artikel 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. I Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (s. 633-638). Artikel 8104096 https://doi.org/10.1109/FOCS.2017.64

Viser resultater 1601 til 1650 ud af 3061

Forrige

Næste

Revideret 10.10.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series