Publikationer

Søg publikationer fra Institut for Datalogi

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

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Efficient pseudorandom correlation generators from ring-lpn. I D. Micciancio & T. Ristenpart (red.), Advances in Cryptology - CRYPTO 2020 (s. 387-416). Springer. https://doi.org/10.1007/978-3-030-56880-1_14

Møller, A. & Veileborg, O. H. (2020). Eliminating abstraction overhead of Java stream pipelines using ahead-of-time program optimization. Proceedings of the ACM on Programming Languages , 4(OOPSLA), Artikel 168. https://doi.org/10.1145/3428236

Borowski, M., Zagermann, J., Klokmose, C. N., Reiterer, H. & Rädle, R. (2020). Exploring the Benefits and Barriers of Using Computational Notebooks for Collaborative Programming Assignments. I SIGCSE '20: Proceedings of the 51st ACM Technical Symposium on Computer Science Education (s. 468–474). Association for Computing Machinery. https://doi.org/10.1145/3328778.3366887

Han, W. & Schulz, H.-J. (2020). Exploring Vibrotactile Cues for Interactive Guidance in Data Visualization. I Proceedings of the 13th International Symposium on Visual Information Communication and Interaction, VINCI 2020 Artikel 3430042 Association for Computing Machinery. https://doi.org/10.1145/3430036.3430042

Staicu, C. A., Torp, M. T., Schafer, M., Møller, A. & Pradel, M. (2020). Extracting Taint Specifications for JavaScript Libraries. I ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering (s. 198-209). Artikel 3380390 Association for Computing Machinery. https://doi.org/10.1145/3377811.3380390

van Oosterhout, A., Bruns, M. & Hoggan, E. (2020). Facilitating Flexible Force Feedback Design with Feelix. I ICMI 2020 - Proceedings of the 2020 International Conference on Multimodal Interaction (s. 184–193). Association for Computing Machinery. https://doi.org/10.1145/3382507.3418819

Logins, A., U, L. H. & Karras, P. (2020). Fair Cruising. Manuskript afsendt til publicering. I Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2020

Tzavelis, N., Giannakopoulos, I., Johansen, R. Q., Doka, K., Koziris, N. & Karras, P. (2020). Fair Procedures for Fair Stable Marriage Outcomes. I AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (Bind 34, no. 5, s. 7269-7276). AAAI Press. https://doi.org/10.1609/aaai.v34i05.6218

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K. & Pavlogiannis, A. (2020). Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. I D. Van Hung & O. Sokolsky (red.), Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings (s. 253-270). Springer. https://doi.org/10.1007/978-3-030-59152-6_14

Pavlogiannis, A. (2020). Fast, Sound, and Effectively Complete Dynamic Race Prediction. Proceedings of the ACM on Programming Languages , 4(POPL), 1-29. Artikel 17. https://doi.org/10.1145/3371085

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2020). Fast threshold ECDSA with honest majority. I C. Galdi & V. Kolesnikov (red.), Security and Cryptography for Networks (s. 382-400). Springer. https://doi.org/10.1007/978-3-030-57990-6_19

Madsen, M. & Lhoták, O. (2020). Fixpoints for the masses: programming with first-class Datalog constraints. I Proceedings of the ACM on Programming Languages (OOPSLA udg., Bind 4). Association for Computing Machinery. https://doi.org/10.1145/3428193

Christensen, H. B. (2020). Flexible, Reliable, Distributed Software 2nd Edition: Still using Patterns and Agile Development. LeanPub.com. https://leanpub.com/frds/

Thomsen, S. E. & Spitters, B. (2020). Formalizing Nakamoto-Style Proof of Stake.

Barthe, G., Blazy, S., Grégoire, B., Hutin, R., Laporte, V., Pichardie, D. & Trieu, A. (2020). Formal Verification of a Constant-Time Preserving C Compiler. Proceedings of the ACM on Programming Languages , 4(POPL), Artikel 7. https://doi.org/10.1145/3371075

Christensen, H. B. (2020). FRDS.Broker Library: Release 2.0. Softwareprogram, mvnrepository.com. https://bintray.com/henrikbaerbak/maven/broker

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2020). Fully persistent B-trees. Theoretical Computer Science, 841, 10-26. https://doi.org/10.1016/j.tcs.2020.06.027

Stiévenart, Q. & Madsen, M. (2020). Fuzzing channel-based concurrency runtimes using types and effects. I Proceedings of the ACM on Programming Languages (OOPSLA udg., Bind 4). Association for Computing Machinery. https://doi.org/10.1145/3428254

Zhang, K., Zhou, J., Tao, D., Karras, P., Li, Q. & Xiong, H. (2020). Geodemographic Influence Maximization. I KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (s. 2764-2774). Association for Computing Machinery. https://doi.org/10.1145/3394486.3403327

Lissandrini, M., Mottin, D., Palpanas, T. & Velegrakis, Y. (2020). Graph-Query Suggestions for Knowledge Graph Exploration. I Y. Huang, I. King, T.-Y. Liu & M. van Steen (red.), WWW '20: Proceedings of The Web Conference 2020 (s. 2549-2555). Association for Computing Machinery. https://doi.org/10.1145/3366423.3380005

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract fra The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract fra 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Aggarwal, D., Obremski, M., Ribeiro, J., Siniscalchi, L. & Visconti, I. (2020). How to extract useful randomness from unreliable sources. I A. Canteaut & Y. Ishai (red.), Advances in Cryptology – EUROCRYPT 2020 (s. 343-372). Springer. https://doi.org/10.1007/978-3-030-45721-1_13

Escudero, D., Ghosh, S., Keller, M., Rachuri, R. & Scholl, P. (2020). Improved primitives for mpc over mixed arithmetic-binary circuits. I D. Micciancio & T. Ristenpart (red.), Advances in Cryptology - CRYPTO 2020 (s. 823-852). Springer. https://doi.org/10.1007/978-3-030-56880-1_29

Campanelli, M., Fiore, D., Greco, N., Kolonelos, D. & Nizzardo, L. (2020). Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. I S. Moriai & H. Wang (red.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (s. 3-35). Springer. https://doi.org/10.1007/978-3-030-64834-3_1

Sciannamblo, M., Teli, M., Lyle, P. J. & Csíkszentmihályi, C. (2020). Infrastructuring the commons today, when STS meets ICT. Journal of Peer Production, (14).

Baum, C., David, B. & Dowsley, R. (2020). Insured MPC: Efficient Secure Computation with Financial Penalties. I J. Bonneau & N. Heninger (red.), Financial Cryptography and Data Security: FC 2020 (s. 404-420). Springer. https://doi.org/10.1007/978-3-030-51280-4_22

Avdic, M. & Vermeulen, J. (2020). Intelligibility Issues Faced by Smart Speaker Enthusiasts in Understanding What Their Devices Do and Why. I N. Ahmadpour, T. Leong, B. Ploderer, C. Parker, S. Webber, D. Munoz, L. Loke & M. Tomitsch (red.), Proceedings of the 32nd Australian Computer-Human Interaction Conference, OzCHI 2020 (s. 314-328). Association for Computing Machinery. https://doi.org/10.1145/3441000.3441068

Assent, I., Domeniconi, C., Gionis, A. & Hüllermeier, E. (2020). Introduction to the special issue of the ECML PKDD 2020 journal track. Data Mining and Knowledge Discovery, 34(5), 1235-1236. https://doi.org/10.1007/s10618-020-00713-9

Assent, I., Domeniconi, C., Gionis, A. & Hüllermeier, E. (2020). Introduction to the special issue of the ECML PKDD 2020 journal track. Machine Learning, 109(9-10), 1697-1698. https://doi.org/10.1007/s10994-020-05907-2

Jetter, H.-C., Rädle, R., Feuchtner, T., Anthes, C., Friedl, J. & Klokmose, C. N. (2020). “In VR, everything is possible!”: Sketching and Simulating Spatially-Aware Interactive Spaces in Virtual Reality. I CHI '20: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems Artikel 523 Association for Computing Machinery. https://doi.org/10.1145/3313831.3376652

Larsen-Ledet, I. & Borowski, M. (2020). "It Looks Like You Don't Agree": Idiosyncratic Needs and Practices in Collaborative Writing. I N. Ahmadpour, T. Leong, B. Ploderer, C. Parker, S. Webber, D. Munoz, L. Loke & M. Tomitsch (red.), OzCHI '20: 32nd Australian Conference on Human-Computer Interaction (s. 339-354). Association for Computing Machinery. https://doi.org/10.1145/3441000.3441032

Grønbæk, J. E., Rasmussen, M. K., Halskov, K. & Petersen, M. G. (2020). KirigamiTable: Designing for Proxemic Transitions with a Shape-Changing Tabletop. I CHI 2020 - Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems Artikel 3376834 Association for Computing Machinery. https://doi.org/10.1145/3313831.3376834

Lissandrini, M., Pedersen, T. B., Hose, K. & Mottin, D. (2020). Knowledge Graph Exploration: Where Are We and Where Are We Going? S I G W E B Newsletter, (Summer), Artikel 4. https://doi.org/10.1145/3409481.3409485

Gomez, A. R. & Gellersen, H. (2020). KryptonEyed: Playing with Gaze without Looking. I G. N. Yannakakis, A. Liapis, K. Penny, V. Volz, F. Khosmood & P. Lopes (red.), Proceedings of the 15th International Conference on the Foundations of Digital Games, FDG 2020 Artikel 52 Association for Computing Machinery. https://doi.org/10.1145/3402942.3403017

Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M. & Yarom, Y. (2020). LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage. I CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (s. 225-242). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417268

Abel, A., Cockx, J., Devriese, D., Timany, A. & Wadler, P. (2020). Leibniz equality is isomorphic to Martin-Löf identity, parametrically. Journal of Functional Programming, 30, Artikel e17. https://doi.org/10.1017/S0956796820000155

Hjorth, A., Head, B., Head, B. & Wilensky, U. (2020). Levelspace: A netlogo extension for multi-level agent-based modeling. JASSS, 23(1), Artikel 4. https://doi.org/10.18564/jasss.4130

Silva, G., Lyle, P. J. & Silva, C. (2020). Local Perspectives for Sharing Economy Design on a Remote Tourist Island. I Proceedings of the 32nd Australian Computer-Human Interaction Conference, OzCHI 2020 (s. 368-378). Association for Computing Machinery. https://doi.org/10.1145/3441000.3441058

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. https://doi.org/10.1007/s00145-020-09355-y

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. I A. Canteaut & Y. Ishai (red.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (s. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. I R. Pass & K. Pietrzak (red.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (s. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Larsen, K. G., Malkin, T., Weinstein, O. & Yeo, K. (2020). Lower Bounds for Oblivious Near-Neighbor Search. I S. Chawla (red.), SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (s. 1116-1134). Society for Industrial and Applied Mathematics. https://doi.org/10.5555/3381089.3381157

Blundo, C., Cimato, S. & Siniscalchi, L. (2020). Managing Constraints in Role Based Access Control. IEEE Access, 8, 140497-140511. Artikel 9146129. https://doi.org/10.1109/ACCESS.2020.3011310

Grønlund, A., Kamma, L. & Larsen, K. G. (2020). Margins are Insufficient for Explaining Gradient Boosting. I H. Larochelle, MA. Ranzato, R. Hadsell, M.-F. Balcan & H.-T. Lin (red.), Advances in Neural Information Processing Systems 33 (NeurIPS 2020) (Bind 2020-December) https://proceedings.neurips.cc/paper/2020/hash/146f7dd4c91bc9d80cf4458ad6d6cd1b-Abstract.html

Deuber, D., Döttling, N., Magri, B., Malavolta, G. & Thyagarajan, S. A. K. (2020). Minting Mechanism for Proof of Stake Blockchains. I M. Conti, J. Zhou, E. Casalicchio & A. Spognardi (red.), Applied Cryptography and Network Security (s. 315-334). Springer. https://doi.org/10.1007/978-3-030-57808-4_16

Birkedal, L., Clouston, R., Mannaa, B., Ejlers Møgelberg, R., Pitts, A. M. & Spitters, B. (2020). Modal dependent type theory and dependent right adjoints. Mathematical Structures in Computer Science, 30(2), 118-138. https://doi.org/10.1017/S0960129519000197

Rijke, E., Shulman, M. & Spitters, B. (2020). Modalities in homotopy type theory. Logical Methods in Computer Science, 16(1), 2:1-2:79. https://doi.org/10.23638/LMCS-16(1:2)2020

Ramirez Gomez, A. & Gellersen, H. (2020). More than Looking: Using Eye Movements Behind the Eyelids as a New Game Mechanic. I CHI PLAY '20: Proceedings of the Annual Symposium on Computer-Human Interaction in Play (s. 362-373). Association for Computing Machinery. https://doi.org/10.1145/3410404.3414240

Larsen-Ledet, I. (2020). More Than Writing Text: Multiplicity in Collaborative Academic Writing. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.

Viser resultater 1301 til 1350 ud af 6080

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series