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

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), [8]. https://doi.org/10.1145/3490390

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. I A. Popescu & S. Zdancewic (red.), CPP 2022 : Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2022 (s. 100-115). Association for Computing Machinery. CPP 2022 - Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs https://doi.org/10.1145/3497775.3503689

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. I Participative Computing for Sustainable Futures : Adjunct Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI'22) [38] Association for Computing Machinery. ACM International Conference Proceeding Series https://doi.org/10.1145/3546155.3547271

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

Pauli, A. B., Derczynski, L. & Assent, I. (2022). Modelling Persuasion through Misuse of Rhetorical Appeals. I Second Workshop on NLP for Positive Impact - Proceedings of the Workshop (NLP4PI 2022) (s. 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. https://doi.org/10.1145/3563351

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

Boschini, C., Takahashi, A. & Tibouchi, M. (Accepteret/In press). MuSig-L: Lattice-based Multi-Signature with Single-Round Online Phase. I CRYPTO 2022 Springer.

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. I D. Dachman-Soled (red.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 [8] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 230 https://doi.org/10.4230/LIPIcs.ITC.2022.8

Ganesh, C., Khoshakhlagh, H. & Parisella, R. (2022). NIWI and New Notions of Extraction for Algebraic Languages. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks. SCN 2022 (s. 687-710). Springer. Lecture Notes in Computer Science Bind 13409 https://doi.org/10.1007/978-3-031-14791-3_30

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

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks. SCN 2022 (s. 220-243). Springer. Lecture Notes in Computer Science Bind 13409 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. I X. Goaoc & M. Kerber (red.), 38th International Symposium on Computational Geometry, SoCG 2022 [2] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.2

Afshani, P. & Cheng, P. (2022). On Semialgebraic Range Reporting. I X. Goaoc & M. Kerber (red.), 38th International Symposium on Computational Geometry, SoCG 2022 [3] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 224 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. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks. SCN 2022 (s. 494-515). Springer. Lecture Notes in Computer Science Bind 13409 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. I PODS 2022 - Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (s. 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. I S. Lovett (red.), 37th Computational Complexity Conference, CCC 2022 [32] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 234 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

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 [16] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 250 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 13177 LNCS https://doi.org/10.1007/978-3-030-97121-2_8

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. [51]. https://doi.org/10.1145/3534624

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). [45] Association for Computing Machinery. https://doi.org/10.1145/3547522.3547689

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

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 [13] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.13

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

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.

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). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 226 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. 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 ved Adjunct Proceedings of the 2022 Nordic Human-Computer Interaction Conference.

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. Lecture Notes in Computer Science (LNCS) Bind 13276 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

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), [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 [124] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 229 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. ACM International Conference Proceeding Series https://doi.org/10.1145/3527927.3532798

Britz, D., Strutwolf, J. & Østerby, O. (2022). Rectangular electrodes: Simulation of accurate steady state currents and the behaviour of square electrode arrays. Electrochimica Acta, 404, [139750]. https://doi.org/10.1016/j.electacta.2021.139750

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 13112 LNCS https://doi.org/10.1007/978-3-030-94676-0_8

Blundo, C., Cimato, S. & Siniscalchi, L. (2022). Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. Computer Journal, 65(6), 1386-1411. https://doi.org/10.1093/comjnl/bxaa186

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. Lecture Notes in Computer Science (LNCS) Bind 13275 https://doi.org/10.1007/978-3-031-06944-4_12

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

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 13704 LNCS Lecture Notes in Computer Science Bind 13704 https://doi.org/10.1007/978-3-031-19762-8_20

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. SCN 2022 (s. 540-563). Springer. Lecture Notes in Computer Science Bind 13409 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. Lecture Notes in Computer Science (LNCS) Bind 13275 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.

Röddiger, T., Clarke, C., Breitling, P., Schneegans, T., Zhao, H., Gellersen, H. & Beigl, M. (2022). Sensing with Earables: A Systematic Literature Review and Taxonomy of Phenomena. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 6(3), 1-57. [135]. https://doi.org/10.1145/3550314

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 [36] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 229 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. Proceedings of the Annual ACM Symposium on Theory of Computing https://doi.org/10.1145/3519935.3520044

Viser resultater 151 til 200 ud af 2456

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series