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

Afshani, P., Iacono, J., Jayapaul, V., Karsin, B. & Sitchinava , N. (2022). Locality-of-Reference Optimality of Cache-Oblivious Algorithms. In 3rd Symposium on Algorithmic Principles of Computer Systems, (APOCS) (pp. 31 - 45). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977059.3

Reiter, K., Pfeuffer, K., Esteves, A., Mittermeier, T. & Alt, F. (2022). Look & Turn: One-handed and Expressive Menu Interaction by Gaze and Arm Turns in VR. In S. N. Spencer (Ed.), Proceedings - ETRA 2022: ACM Symposium on Eye Tracking Research and Applications Article 66 Association for Computing Machinery. https://doi.org/10.1145/3517031.3529233

Abram, D., Nof, A., Orlandi, C., Scholl, P. & Shlomovits, O. (2022). Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. In 2022 IEEE Symposium on Security and Privacy (SP) (pp. 2554-2572). IEEE. https://doi.org/10.1109/SP46214.2022.9833559

Abram, D. & Scholl, P. (2022). Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 221-251). Springer. https://doi.org/10.1007/978-3-030-97121-2_9

Grandoni, F., Schwiegelshohn, C., Solomon, S. & Uzrad, A. (2022). Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. In Symposium on Simplicity in Algorithms (SOSA) (pp. 12-23). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611977066.2

Matakos, A., Aslay, C., Galbrun, E. & Gionis, A. (2022). Maximizing the Diversity of Exposure in a Social Network. IEEE Transactions on Knowledge and Data Engineering, 34(9), 4357-4370. https://doi.org/10.1109/TKDE.2020.3038711

Vindum, S. F., Frumin, D. & Birkedal, L. (2022). Mechanized Verification of a Fine-Grained Concurrent Queue from Meta s Folly Library. In A. Popescu & S. Zdancewic (Eds.), CPP 2022 : Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2022 (pp. 100-115). Association for Computing Machinery. https://doi.org/10.1145/3497775.3503689

Espitau, T., Fouque, P.-A., Gérard, F., Rossi, M., Takahashi, A., Tibouchi, M., Wallet, A. & Yu, Y. (2022). MITAKA: A Simpler, Parallelizable, Maskable Variant of Falcon. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (Vol. 3, pp. 222-253). Springer. https://doi.org/10.1007/978-3-031-07082-2_9

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

Pauli, A. B., Derczynski, L. & Assent, I. (2022). Modelling Persuasion through Misuse of Rhetorical Appeals. In NLP4PI 2022 - 2nd Workshop on NLP for Positive Impact, Proceedings of the Workshop (pp. 89-100). Association for Computational Linguistics. https://pure.itu.dk/ws/portalfiles/portal/90392646/wokrshop_social_impact.pdf

Nieto, A., Gondelman, L., Reynaud, A., Timany, A. & Birkedal, L. (2022). Modular verification of op-based CRDTs in separation logic. Proceedings of the ACM on Programming Languages , 6(OOPSLA2), 1788-1816. Article 188. https://doi.org/10.1145/3563351

Sørensen, M. L. S. K., Bertelsen, A. B., Nordmark Hoffmann, N., Petersen, M. G. & Hoggan, E. (2022). MoLux: Negotiating Control with a Shape-Changing Lamp at Home. In Participative Computing for Sustainable Futures : Adjunct Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI'22) Article 38 Association for Computing Machinery. https://doi.org/10.1145/3546155.3547271

Guimaraes, A., Borin, E. & Aranha, D. F. (2022). MOSFHET: Optimized Software for FHE over the Torus. Abstract from 5th Homomorphic Encryption Standards Meeting, Geneva, Switzerland.

Braun, L., Demmler, D., Schneider, T. & Tkachenko, O. (2022). MOTION – A Framework for Mixed-Protocol Multi-Party Computation. ACM Transactions on Privacy and Security, 25(2), Article 8. https://doi.org/10.1145/3490390

Baum, C., Braun, L., Munch-Hansen, A. & Scholl, P. (2022). MozZ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z2k. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 329-358). Springer. https://doi.org/10.1007/978-3-031-15985-5_12

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. In D. Dachman-Soled (Ed.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

Dahl, J. F., Gregersen, S. B., Andersen, U., Schulz, H.-J., Madsen, J., Sode, L. & Corredig, M. (2022). Multiple techniques to characterize high protein anisotropic structures. Abstract from 5th Food Structure and Functionality Symposium, Cork, Ireland.

Dahl, J. F., Gregersen, S. B., Andersen, U., Schulz, H.-J., Madsen, J., Sode, L. & Corredig, M. (2022). New methodological approaches to study anisotropic structures in foods. Abstract from 36th EFFoST International Conference, Dublin.

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 687-710). Springer. https://doi.org/10.1007/978-3-031-14791-3_30

Daniel, G. (2022). Normalization for Multimodal Type Theory. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022 Article 2 Association for Computing Machinery. https://doi.org/10.1145/3531130.3532398

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 220-243). Springer. https://doi.org/10.1007/978-3-031-14791-3_10

Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022). On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.2

Esteves, A., Bouquet, E., Pfeuffer, K. & Alt, F. (2022). One-handed Input for Mobile Devices via Motion Matching and Orbits Controls. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 6(2), 1-24. Article 51. https://doi.org/10.1145/3534624

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

Afshani, P. & Cheng, P. (2022). On Semialgebraic Range Reporting. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.3

Simkin, M., Siniscalchi, L. & Yakoubov, S. (2022). On Sufficient Oracles for Secure Computation with Identifiable Abort. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 494-515). Springer. https://doi.org/10.1007/978-3-031-14791-3_22

Berthelsen, M. L. T. & Hansen, K. A. (2022). On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. Theory of Computing Systems, 66(3), 519-545. https://doi.org/10.1007/s00224-022-10080-1

Van Bergerem, S., Grohe, M. & Ritzert, M. (2022). On the Parameterized Complexity of Learning First-Order Logic. In PODS 2022 - Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 337-346). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524151

Limaye, N., Srinivasan, S. & Tavenas, S. (2022). On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. In S. Lovett (Ed.), 37th Computational Complexity Conference, CCC 2022 Article 32 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2022.32

Logins, A., Li, Y. & Karras, P. (2022). On the Robustness of Diffusion in a Network under Node Attacks. IEEE Transactions on Knowledge and Data Engineering, 34(12), 5884-5895. https://doi.org/10.1109/TKDE.2021.3071081

Zhong, Z., Jiang, Y. & Mottin, D. (2022). On the Robustness of Post-hoc GNN Explainers to Label Noise. Paper presented at Learning on Graphs Conference 2022.

Curticapean, R., Limaye, N. & Srinivasan, S. (2022). On the VNP-Hardness of Some Monomial Symmetric Polynomials. In A. Dawar & V. Guruswami (Eds.), 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.16

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Bilstrup, K.-E. K., Kaspersen, M. H., Sørensen, M.-L. S. K. & Petersen, M. G. (2022). Opportunities and Challenges of Teaching Machine Learning as a Design Material with the micro:bit. In Participative Computing for Sustainable Futures : Adjunct Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) (pp. 1-6). Article 45 Association for Computing Machinery. https://doi.org/10.1145/3547522.3547689

Bartal, Y., Fandina, O. N. & Larsen, K. G. (2022). Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.13

Larsen, K. G. & Ritzert, M. (2022). Optimal Weak to Strong Learning. arxiv.org. https://doi.org/10.48550/arXiv.2206.01563

Jørgensen, J. R. (2022). Parallel Algorithms for Clustering, Subspace Clustering, and Projected Clustering on the GPU. Århus Universitet.

Schwartzbach, N. I. (2022). Payment Schemes from Limited Information with Applications in Distributed Computing. In EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (pp. 129-149) https://doi.org/10.1145/3490486.3538342

Alves, P., Nayara Ortiz, J. & Aranha, D. F. (2022). Performance of hierarchical transforms in homomorphic encryption: A case study on logistic regression inference. Abstract from 1st Annual FHE.org Conference on Fully Homomorphic Encryption, Trondheim, Norway.

Liu-Zhang, C.-D., Matt, C., Maurer, U., Rito, G. & Thomsen, S. E. (2022). Practical Provably Secure Flooding for Blockchains. In S. Agrawal & D. Lin (Eds.), Advances in Cryptology – ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, 2022, Proceedings: ASIACRYPT 2022 (pp. 774–805). Springer. https://doi.org/10.1007/978-3-031-22963-3_26

Brodal, G. S. (2022). Priority Queues with Decreasing Keys. In P. Fraigniaud & Y. Uno (Eds.), 11th International Conference on Fun with Algorithms, FUN 2022 (pp. 8:1-8:19). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2022.8

Aggarwal, D., Obremski, M., Ribeiro, J., Simkin, M. & Siniscalchi, L. (2022). Privacy Amplification with Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Transactions on Information Theory, 68(8), 5475-5495. https://doi.org/10.1109/TIT.2022.3167404

Bidlingmaier, M. E. (2022). Probabilistic Programming and Multiverse Models of Type Theory. Århus Universitet.

Lunding, M. S., Leiva, G., Grønbæk, J. E. & Petersen, M. G. (2022). ProjectAR: Rapid Prototyping of Projection Mapping with Mobile Augmented Reality. Poster session presented at Adjunct Proceedings of the 2022 Nordic Human-Computer Interaction Conference. https://doi.org/10.1145/3547522.3547679

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2022). Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 764-781). Springer. https://doi.org/10.1007/978-3-031-07085-3_26

Strydonck, T. V., Georges, A. L., Guéneau, A., Trieu, A., Timany, A., Piessens, F., Birkedal, L. & Devriese, D. (2022). Proving full-system security properties under multiple attacker models on capability machines. In Proceedings - 2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 (pp. 80-95). IEEE. https://doi.org/10.1109/CSF54842.2022.9919645

Baum, C., David, B. & Dowsley, R. (2022). (Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. In C. Ge & F. Guo (Eds.), Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings (pp. 249-272). Springer. https://doi.org/10.1007/978-3-031-20917-8_17

Jacobs, K., Devriese, D. & Timany, A. (2022). Purity of an ST monad: Full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages , 6(OOPSLA1), Article 82. https://doi.org/10.1145/3527326

Ganardi, M., Majumdar, R., Pavlogiannis, A., Schütze, L. & Zetzsche, G. (2022). Reachability in Bidirected Pushdown VASS. In M. Bojanczyk, E. Merelli & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Article 124 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.124

Tchernavskij, P., Webb, A. M., Gemeinhardt, H. & Mackay, W. E. (2022). Readymades & Repertoires: Artifact-Mediated Improvisation in Tabletop Role-Playing Games. In C&C '22: Creativity and Cognition (pp. 298-311). Association for Computing Machinery. https://doi.org/10.1145/3527927.3532798

Displaying results 651 to 700 out of 5709

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University