Aarhus Universitets segl

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

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. Afhandling præsenteret på Learning on Graphs Conference 2022.
Curticapean, R., Limaye, N. & Srinivasan, S. (2022). On the VNP-Hardness of Some Monomial Symmetric Polynomials. I A. Dawar & V. Guruswami (red.), 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 Artikel 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. I G. Hanaoka, J. Shikata & Y. Watanabe (red.), 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 (s. 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. I Participative Computing for Sustainable Futures : Adjunct Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) (s. 1-6). Artikel 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. I X. Goaoc & M. Kerber (red.), 38th International Symposium on Computational Geometry, SoCG 2022 Artikel 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.13
Schwartzbach, N. I. (2022). Payment Schemes from Limited Information with Applications in Distributed Computing. I EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (s. 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 fra 1st Annual FHE.org Conference on Fully Homomorphic Encryption, Trondheim, Norge.
Liu-Zhang, C.-D., Matt, C., Maurer, U., Rito, G. & Thomsen, S. E. (2022). Practical Provably Secure Flooding for Blockchains. I S. Agrawal & D. Lin (red.), Advances in Cryptology – ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, 2022, Proceedings: ASIACRYPT 2022 (s. 774–805). Springer. https://doi.org/10.1007/978-3-031-22963-3_26
Brodal, G. S. (2022). Priority Queues with Decreasing Keys. I P. Fraigniaud & Y. Uno (red.), 11th International Conference on Fun with Algorithms, FUN 2022 (s. 8:1-8:19). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2022.8
Bidlingmaier, M. E. (2022). Probabilistic Programming and Multiverse Models of Type Theory. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus 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 præsenteret på 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. 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. 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. I Proceedings - 2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 (s. 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. I C. Ge & F. Guo (red.), Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings (s. 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), Artikel 82. https://doi.org/10.1145/3527326
Ganardi, M., Majumdar, R., Pavlogiannis, A., Schütze, L. & Zetzsche, G. (2022). Reachability in Bidirected Pushdown VASS. I M. Bojanczyk, E. Merelli & D. P. Woodruff (red.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Artikel 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. I C&C '22: Creativity and Cognition (s. 298-311). Association for Computing Machinery. https://doi.org/10.1145/3527927.3532798
Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022). Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. I M. Feldman, H. Fu & I. Talgam-Cohen (red.), Web and Internet Economics : 17th International Conference, WINE 2021 (s. 131-148). Springer. https://doi.org/10.1007/978-3-030-94676-0_8
Ciampi, M., Ravi, D., Siniscalchi, L. & Waldner, H. (2022). Round-Optimal Multi-party Computation with Identifiable Abort. I O. Dunkelman & S. Dziembowski (red.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (s. 335-364). Springer. https://doi.org/10.1007/978-3-031-06944-4_12
Seisenberger, M., ter Beek, M. H., Fan, X., Ferrari, A., Haxthausen, A. E., James, P., Lawrence, A., Luttik, B., van de Pol, J. & Wimmer, S. (2022). Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway. I T. Margaria & B. Steffen (red.), Leveraging Applications of Formal Methods, Verification and Validation. Practice - 11th International Symposium, ISoLA 2022, Proceedings (s. 246-268). Springer. https://doi.org/10.1007/978-3-031-19762-8_20
Hohma Ellen.Hohma@Tum.De, E., Frey, C. M. M., Beer, A. & Seidl, T. (2022). SCAR - Spectral Clustering Accelerated and Robustified. Proceedings of the VLDB Endowment, 15(11), 3031-3044. https://doi.org/10.14778/3551793.3551850
Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (s. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24
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
Kingo Mogensen, T. & Aranha, D. F. (2022). Security analysis of the passwordless MitID digital identity system. Abstract fra 27th Nordic Conference on Secure IT Systems (NordSec 2022), Reykjavik, Island.
Chakraborty, S., Kayal, C. & Paraashar, M. (2022). Separations Between Combinatorial Measures for Transitive Functions. I M. Bojanczyk, E. Merelli & D. P. Woodruff (red.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Artikel 36 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.36
Tavenas, S., Limaye, N. & Srinivasan, S. (2022). Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. I S. Leonardi & A. Gupta (red.), STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (s. 416-425). Association for Computing Machinery. https://doi.org/10.1145/3519935.3520044
Sterling, J. & Harper, R. (2022). Sheaf Semantics of Termination-Insensitive Noninterference. I A. P. Felty (red.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 Artikel 5 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2022.5
Ciaperoni, M., Gionis, A., Katsamanis, A. & Karras, P. (2022). SIEVE: A Space-Efficient Algorithm for Viterbi Decoding. I Proceedings of the 2022 International Conference on Management of Data (s. 1136-1145). Association for Computing Machinery. https://doi.org/10.1145/3514221.3526170
Skitsas, K., Papageorgiou, I. G., Talebi, M. S., Kantere, V., Katehakis, M. N. & Karras, P. (2022). SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs. Proceedings of the VLDB Endowment, 16(1), 90-98. https://doi.org/10.14778/3561261.3561269
Chatterjee, K., Svoboda, J., Žikelić, Đ., Pavlogiannis, A. & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E, 106(3), Artikel 034321. https://doi.org/10.1103/PhysRevE.106.034321
Boudgoust, K., Gachon, E. & Pellet-Mary, A. (2022). Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. I Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (s. 480-509). Springer. https://doi.org/10.1007/978-3-031-15979-4_17
Hermanns, J. F. (2022). Spectral Graph Correspondences. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.
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
Hogräfer, M., Angelini, M., Santucci, G. & Schulz, H.-J. (2022). Steering-by-Example for Progressive Visual Analytics. ACM Transactions on Intelligent Systems and Technology, 13(6), 1–26. Artikel 96. https://doi.org/10.1145/3531229
Limaye, N., Srinivasan, S. & Tavenas, S. (2022). Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. I Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021 (s. 804-814). IEEE Computer Society. https://doi.org/10.1109/FOCS52979.2021.00083
Rakotonirina, I., Ambrona, M., Aguirre, A. & Barthe, G. (2022). Symbolic Synthesis of Indifferentiability Attacks. I ASIA CCS 2022 - Proceedings of the 2022 ACM Asia Conference on Computer and Communications Security (s. 667-681). Association for Computing Machinery. https://doi.org/10.1145/3488932.3497759
Christensen, H. B. (2022). Teaching Microservice Architecture Using DevOps - An Experience Report. I Software Architecture - 16th European Conference, ECSA 2022, Proceedings (s. 117-130). Springer. https://doi.org/10.1007/978-3-031-16697-6_8
Koti, N., Suresh, A., Rachuri, S. R. & Patra, A. (2022). Tetrad: Actively Secure 4PC for Secure Training and Inference. Afhandling præsenteret på Network and Distributed Systems Security (NDSS) Symposium 2022, San Diego ,Calif., USA. https://doi.org/10.14722/ndss.2022.24058
Bilstrup, K.-E. K., Kaspersen, M. H., Larsen, M. F., Bouvin, N. O. & Petersen, M. G. (2022). The Best of Both Worlds: Designing a Tiered Hybrid Interface for Teaching Machine Learning in K-9 Education. I Participative Computing for Sustainable Futures : Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) Artikel 51 https://doi.org/10.1145/3546155.3546156
Caragiannis, I. & Fehrs, K. (2022). The Complexity of Learning Approval-Based Multiwinner Voting Rules. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 4925-4932. https://doi.org/10.1609/aaai.v36i5.20422
Caragiannis, I., Shah, N. & Voudouris, A. A. (2022). The metric distortion of multiwinner voting. Artificial Intelligence, 313, Artikel 103802. https://doi.org/10.1016/j.artint.2022.103802