Publikationer

Søg publikationer fra Institut for Datalogi

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

Sortér efter: Dato | Forfatter | Titel

Grønbæk, K. (2023). Har kunstig intelligens gjort os bange for vores egen skygge? I sciencereport.dk

Grønbæk, J. E., Sánchez Esquivel, J., Leiva, G., Velloso, E., Gellersen, H. & Pfeuffer, K. (2024). Blended Whiteboard: Physicality and Reconfigurability in Remote Mixed Reality Collaboration. I CHI'24: Proceedings of the 2024 CHI Conference on Human Factors in Computing Systems Artikel 798 Association for Computing Machinery. https://doi.org/10.1145/3613904.3642293

Griggio, C. F., Nouwens, M. & Klokmose, C. N. (2022). Caught in the Network: The Impact of WhatsApp's 2021 Privacy Policy Update on Users' Messaging App Ecosystems. I CHI '22: Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems Artikel 104 Association for Computing Machinery. https://doi.org/10.1145/3491102.3502032

Griggio, C. F., Gorman, B. M. & Tigwell, G. W. (2024). Party Face Congratulations! Exploring Design Ideas to Help Sighted Users with Emoji Accessibility when Messaging with Screen Reader Users. Proceedings of the ACM on Human-Computer Interaction, 8(CSCW1), Artikel 175. https://doi.org/10.1145/3641014

Gregersen, S. O., Thomsen, S. E. & Askarov, A. (2019). A Dependently Typed Library for Static Information-Flow Control in IDRIS. I F. Nielson & D. Sands (red.), Principles of Security and Trust: 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (s. 51-75). Springer. https://doi.org/10.1007/978-3-030-17138-4_3

Gregersen, S. O., Bay, J., Timany, A. & Birkedal, L. (2021). Mechanized logical relations for termination-insensitive noninterference. Proceedings of the ACM on Programming Languages , 5(POPL), Artikel 10. https://doi.org/10.1145/3434291

Gregersen, S. O. (2023). Higher-Order Separation Logic for Distributed Systems and Security. Århus Universitet.

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. Proceedings of the ACM on Programming Languages , 8(POPL), Artikel 26. https://doi.org/10.1145/3632868

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Almost-Sure Termination by Guarded Refinement. Proceedings of the ACM on Programming Languages , 8(ICFP), 203-233. Artikel 243. https://doi.org/10.1145/3674632

Green Larsen, K., Mitzenmacher, M. & Tsourakakis, C. (2020). Clustering with a faulty oracle. I Y. Huang, I. King, T.-Y. Liu & M. van Steen (red.), WWW '20: Proceedings of The Web Conference 2020 (s. 2831-2834). Association for Computing Machinery. https://doi.org/10.1145/3366423.3380045

Greenberg, S., Boring, S., Vermeulen, J. & Dostal, J. (2014). Dark Patterns in Proxemic Interactions: A Critical Perspective. -, 523-532. https://doi.org/10.1145/2598510.2598541

Greenbaum, J. & Kyng, M. (1995). Design challenge - creating a mosaic out of chaos. 195-196. Afhandling præsenteret på Proceedings of the Conference on Human Factors in Computing Systems. Part 2 (of 2), Denver, CO, USA. https://doi.org/10.1145/223355.223510

Green, M., Hall-Andersen, M. N., Hennenfent, E., Kaptchuk, G., Perez, B. & Van Laer, G. (2023). Efficient Proofs of Software Exploitability for Real-world Processors. Proceedings on Privacy Enhancing Technologies, 2023(1), 627-640. https://doi.org/10.56553/popets-2023-0036

Gratzer, D., Sterling, J. & Birkedal, L. (2019). Implementing a modal dependent type theory. Proceedings of the ACM on Programming Languages , 3(ICFP), 1-29. Artikel 107. https://doi.org/10.1145/3341711

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2020). Multimodal Dependent Type Theory. I Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (s. 492-506). Artikel 3394736 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394736

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2021). Multimodal Dependent Type Theory. Logical Methods in Computer Science, 17(3), Artikel 11. https://doi.org/10.46298/lmcs-17(3:11)2021

Gratzer, D. & Birkedal, L. (2022). A Stratified Approach to Löb Induction. I A. P. Felty (red.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 Artikel 23 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2022.23

Gratzer, D., Cavallo, E., Kavvos, G. A., Guatto, A. & Birkedal, L. (2022). Modalities and Parametric Adjoints. ACM Transactions on Computational Logic, 23(3), Artikel 18. https://doi.org/10.1145/3514241

Gratzer, D. (2023). Syntax and semantics of modal type theory. Aarhus University.

Grathwohl, H. B. (2016). Guarded Recursive Type Theory. Department of Computer Science, Aarhus University.

Graham, C., Muthukrishnan, S., Yi, K. & Zhang, Q. (2012). Continuous sampling from distributed streams: Article No.: 10. Association for Computing Machinery. Journal, 59(2). https://doi.org/10.1145/2160158.2160163

Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R. (2015). Approximate Range Emptiness in Constant Time and Optimal Space. I Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (s. 769-775). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2133036&picked=prox

Gordon, S. D., Hazay, C., Katz, J. & Lindell, Y. (2011). Complete Fairness in Secure Two-Party Computation. Association for Computing Machinery. Journal, 58(6), Article no. 24. https://doi.org/10.1145/2049697.2049698

Goodrich, M. T., Sitchinava, N. & Zhang, Q. (2011). Sorting, Searching, and Simulation in the MapReduce Framework. Lecture Notes in Computer Science, 7074, 374-383. https://doi.org/10.1007/978-3-642-25591-5_39

Goodrich, M. T., Sitchinava, N. & Zhang, Q. (2011). Sorting, Searching, and Simulation in the MapReduce Framework. http://arxiv.org/pdf/1101.1902.pdf

Gondelman, L., Gregersen, S. O., Nieto, A., Timany, A. & Birkedal, L. (2021). Distributed causal memory: Modular specification and verification in higher-order distributed separation logic. Proceedings of the ACM on Programming Languages , 5(POPL), Artikel 42. https://doi.org/10.1145/3434323

Gondelman, L., Hinrichsen, J. K., Pereira, M., Timany, A. & Birkedal, L. (2023). Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proceedings of the ACM on Programming Languages , 7(ICFP), 847-877. Artikel 217. https://doi.org/10.1145/3607859

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

Goel, A., Hall-Andersen, M., Hegde, A. & Jain, A. (2022). Secure Multiparty Computation with Free Branching. I O. Dunkelman & S. Dziembowski (red.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (s. 397-426). Springer. https://doi.org/10.1007/978-3-031-06944-4_14

Goel, A., Green, M., Hall-Andersen, M. & Kaptchuk, G. (2022). Stacking Sigmas: A Framework to Compose Σ -Protocols for Disjunctions. I O. Dunkelman & S. Dziembowski (red.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (s. 458-487). Springer. https://doi.org/10.1007/978-3-031-07085-3_16

Goel, A., Green, M., Hall-Andersen, M. N. & Kaptchuk, G. (2022). Efficient Set Membership Proofs using MPC-in-the-Head. Proceedings on Privacy Enhancing Technologies, 2022(2), 304-324. https://doi.org/10.2478/popets-2022-0047

Goel, A., Hall-Andersen, M. N., Kaptchuk, G. & Spooner, N. (2023). Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. I C. Hazay & M. Stam (red.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23–27, 2023, Proceedings, Part II (s. 347-378). Springer. https://doi.org/10.1007/978-3-031-30617-4_12

Godsk, T. (2011). Methods and Software Architecture for Activity Recognition from Position Data: Applied to Cow Activity Recognition. Department of Computer Science, Aarhus University.

Goddard, W., Garner, J. & Jensen, M. M. (2016). Designing for social play in co-located mobile games. I Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2016: ACSW '16 Artikel 68 Association for Computing Machinery. https://doi.org/10.1145/2843043.2843476

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (red.) (2021). Proceedings First Workshop on Applicable Formal Methods. Electronic Proceedings in Theoretical Computer Science https://doi.org/10.4204/EPTCS.349

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (2021). A Manifesto for Applicable Formal Methods. (s. 1-17). CoRR https://arxiv.org/abs/2112.12758

Gleirscher, M., van de Pol, J. & Woodcock, J. (2023). A manifesto for applicable formal methods. Software and Systems Modeling, 22(6), 1737-1749. https://doi.org/10.1007/s10270-023-01124-2

Gkountouna, O., Doka, K., Xue, M., Cao, J. & Karras, P. (2022). One-off Disclosure Control by Heterogeneous Generalization. I 31st USENIX Security Symposium (USENIX Security 22) (s. 3363-3377). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/conference/usenixsecurity22/presentation/gkountouna

Gjerlufsen, T., Klokmose, C. N., Eagan, J., Pillias, C. & Beaudouin-Lafon, M. (2011). Shared Substance: Developing Flexible Multi-Surface Applications. I D. S. Ten, S. Amershi, B. Begole, W. A. Kellogg & M. Tungare (red.), Proceedings of the International Conference on Human Factors in Computing Systems, CHI 2011 (s. 3383-3392). Association for Computing Machinery. https://doi.org/10.1145/1978942.1979446

Gilbert, S., Porat, E., King, V., Saia, J., Pettie, S. & Young, M. (2014). (Near) optimal resource-competitive broadcast with jamming. I G. Blelloch & P. Sanders (red.), Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14 (s. 257-266). Association for Computing Machinery. https://doi.org/10.1145/2612669.2612679

Giarrusso, P. G., Stefanesco, L., Timany, A., Birkedal, L. & Krebbers, R. (2020). Scala step-by-step: Soundness for DOT with step-indexed logical relations in Iris. Proceedings of the ACM on Programming Languages , 4(ICFP), Artikel 114. https://doi.org/10.1145/3408996

Giacomelli, I., Olimid, R. & Ranellucci, S. (2015). Security of Linear Secret-Sharing Schemes Against Mass Surveillance. I M. Reiter & D. Naccache (red.), Cryptology and Network Security : 14th International Conference, CANS 2015, Marrakesh, Morocco, December 10-12, 2015, Proceedings (Bind 9476, s. 43-58). Springer. https://doi.org/10.1007/978-3-319-26823-1

Giacomelli, I., Madsen, J. & Orlandi, C. (2016). ZKBoo: Faster Zero-Knowledge for Boolean Circuits. I Proceedings of the 25th USENIX Security Symposium: (USENIX Security 16) (s. 1069-1083). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/system/files/conference/usenixsecurity16/sec16_paper_giacomelli.pdf

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

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

Ghosh, S. (2019). Secure Computation Based On Oblivious Linear Function Evaluation. Århus Universitet.

Ghosh, S. & Nilges, T. (2019). An algebraic approach to maliciously secure private set intersection. I Y. Ishai & V. Rijmen (red.), Advances in Cryptology – EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (s. 154-185). Springer VS. https://doi.org/10.1007/978-3-030-17659-4_6

Ghosh, S. & Simkin, M. (2019). The Communication Complexity of Threshold Private Set Intersection. I A. Boldyreva & D. Micciancio (red.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Bind II, s. 3-29). Springer. https://doi.org/10.1007/978-3-030-26951-7_1

Georgiev, I., Křivánek, J., Hachisuka, T., Nowrouzezahrai , D. & Jarosz, W. (2013). Joint importance sampling of low-order volumetric scattering. A C M Transactions on Graphics, (6), Artikel 164 . https://doi.org/10.1145/2508363.2508411

Georgiadis, L., Hansen, T. D., Italiano, G. F., Krinninger, S. & Parotsidis, N. (2017). Decremental Data Structures for Connectivity and Dominators 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. 42:1-42:15). Artikel 42 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. https://doi.org/10.4230/LIPIcs.ICALP.2017.42

Viser resultater 1551 til 1600 ud af 2825

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series