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

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. 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 I (s. 271-302). Springer. https://doi.org/10.1007/978-3-031-30545-0_10
Cheng, P. (2023). On Geometric Range Searching and Its Variants. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.
Afshani, P., Cheng, P., Basu Roy, A. & Wei, Z. (2023). On Range Summary Queries. I K. Etessami, U. Feige & G. Puppis (red.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (s. 7:1-7:17). Artikel 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2023.7
Chakraborty, S., Kayal, C., Mittal, R., Paraashar, M., Sanyal, S. & Saurabh, N. (2023). On the Composition of Randomized Query Complexity and Approximate Degree. I N. Megow & A. Smith (red.), Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Artikel 63 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63
Boudgoust, K., Jeudy, C., Roux-Langlois, A. & Wen, W. (2023). On the Hardness of Module Learning with Errors with Short Distributions. Journal of Cryptology, 36(1), Artikel 1. https://doi.org/10.1007/s00145-022-09441-3
Badrinarayanan, S., Miao, P., Mukherjee, P. & Ravi, D. (2023). On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. I G. N. Rothblum & H. Wee (red.), Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II (Bind 14370, s. 124-155). Springer, Cham. https://doi.org/10.1007/978-3-031-48618-0_5
Hall-Andersen, M. N. & Nielsen, J. B. (2023). On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. 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. 438-469). Springer. https://doi.org/10.1007/978-3-031-30617-4_15, https://doi.org/10.1007/978-3-031-30617-415
Hu, E., Grønbæk, J. E., Houck, A. & Heo, S. (2023). OpenMic: Utilizing Proxemic Metaphors for Conversational Floor Transitions in Multiparty Video Meetings. I A. Schmidt, K. Väänänen, T. Goyal, P. O. Kristensson, A. Peters, S. Mueller, J. R. Williamson & M. L. Wilson (red.), CHI'23: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems Artikel 793 Association for Computing Machinery. https://doi.org/10.1145/3544548.3581013
Srinivasan, S. & Tripathi, U. (2023). Optimal Explicit Small-Depth Formulas for the Coin Problem. I B. Saha & R. A. Servedio (red.), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing (s. 881-894). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585238
Tunç, H. C., Abdulla, P. A., Chakraborty, S., Krishna, S., Mathur, U. & Pavlogiannis, A. (2023). Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proceedings of the ACM on Programming Languages , 7(PLDI), 761–785. Artikel 137. https://doi.org/10.1145/3591251
Mai, T., Munteanu, A., Musco, C., Rao, A. B., Schwiegelshohn, C. & Woodruff, D. P. (2023). Optimal Sketching Bounds for Sparse Linear Regression. I Proceedings of The 26th International Conference on Artificial Intelligence and Statistics (s. 11288-11316). PMLR. https://proceedings.mlr.press/v206/mai23a.html
Caragiannis, I. & Rathi, N. (2023). Optimizing over Serial Dictatorships. I A. Deligkas & A. Filos-Ratsikas (red.), Algorithmic Game Theory: 16th International Symposium, SAGT 2023, Egham, UK, September 4–7, 2023, Proceedings (s. 329-346). Springer. https://doi.org/10.1007/978-3-031-43254-5_19
Caragiannis, I. & Schwartzbach, N. I. (2023). Outsourcing Adjudication to Strategic Jurors. I E. Elkind (red.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (s. 2546-2553). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/283
Pfeuffer, K., Obernolte, J., Dietz, F., Mäkelä, V., Sidenmark, L., Manakhov, P., Pakanen, M. & Alt, F. (2023). PalmGazer: Unimanual Eye-hand Menus in Augmented Reality. I T. Huang, M. Sra & F. Argelaguet (red.), SUI '23: Proceedings of the 2023 ACM Symposium on Spatial User Interaction (s. 1–12). Artikel 11 Association for Computing Machinery. https://doi.org/10.1145/3607822.3614523
Johns, C. A., Evangelista Belo, J. M., Pfeuffer, K. & Klokmose, C. N. (2023). Pareto Optimal Layouts for Adaptive Mixed Reality. I CHI 2023 - Extended Abstracts of the 2023 CHI Conference on Human Factors in Computing Systems Artikel 223 Association for Computing Machinery. https://doi.org/10.1145/3544549.3585732
Grønbæk, J. E., Pfeuffer, K., Velloso, E., Astrup, M., Pedersen, M. I., Kjær, M., Leiva, G. & Gellersen, H. (2023). Partially Blended Realities: Aligning Dissimilar Spaces for Distributed Mixed Reality Meetings. I A. Schmidt, K. Väänänen, T. Goyal, P. O. Kristensson, A. Peters, S. Mueller, J. R. Williamson & M. L. Wilson (red.), CHI '23: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems Artikel 456 Association for Computing Machinery. https://doi.org/10.1145/3544548.3581515
Damgård, I., Escudero, D. & Polychroniadou, A. (2023). Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. I K.-M. Chung (red.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (s. 7:1--7:21). Artikel 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.7
Airiau, S., Aziz, H., Caragiannis, I., Kruger, J., Lang, J. & Peters, D. (2023). Portioning using ordinal preferences: Fairness and efficiency. Artificial Intelligence, 314, Artikel 103809. https://doi.org/10.1016/j.artint.2022.103809
Bourneuf, R., Folwarczný, L., Hubáček, P., Rosen, A. & Schwartzbach, N. I. (2023). PPP-Completeness and Extremal Combinatorics. I Y. T. Kalai (red.), 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) (s. 1-20). Artikel 22 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2023.22
Alpos, O., Cachin, C., Kamp, S. H. & Nielsen, J. B. (2023). Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast. I J. Bonneau & S. M. Weinberg (red.), 5th Conference on Advances in Financial Technologies, AFT 2023 Artikel 31 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.31
Sølvsten, S. & van de Pol, J. (2023). Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. I É. André & J. Sun (red.), Automated technology for verification and analysis: Part II (s. 72-92). Springer. https://doi.org/10.1007/978-3-031-45332-8_4
Vanegas, H., Cabarcas, D. & Aranha, D. F. (2023). Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation. I A. Aly & M. Tibouchi (red.), Progress in Cryptology – LATINCRYPT 2023: 8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3–6, 2023, Proceedings (s. 67-86). Springer. https://doi.org/10.1007/978-3-031-44469-2_4
Madsen, M. & Pol, J. V. D. (2023). Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. I K. Ali & G. Salvaneschi (red.), 37th European Conference on Object-Oriented Programming (ECOOP 2023) Artikel 18 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.18
Baum, C., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Orsini, E., Roy, L. D. & Scholl, P. (2023). Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. I H. Handschuh & A. Lysyanskaya (red.), Advances in Cryptology: CRYPTO 2023 (s. 581-615). Springer. https://doi.org/10.1007/978-3-031-38554-4_19
Munch-Hansen, A. (2023). Quattro Formaggi: Zero-Knowledge from VOLE. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.
Braun, L., Pancholi, M. R., Rachuri, R. & Simkin, M. (2023). Ramen: Souper Fast Three-Party Computation for RAM Programs. I CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (s. 3284-3297). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623115
Tommasel, A. & Assent, I. (2023). Recommendation fairness and where to find it: An empirical study on fairness of user recommender systems. I J. He, T. Palpanas, X. Hu, A. Cuzzocrea, D. Dou, D. Slezak, W. Wang, A. Gruca, J. C.-W. Lin & R. Agrawal (red.), IEEE International Conference on Big Data, BigData 2023, Sorrento, Italy, December 15-18, 2023 (s. 4195-4204). IEEE. https://doi.org/10.1109/BIGDATA59044.2023.10386616
Bødker, S., Fox, S., Lalone, N., Marathe, M. & Soden, R. (2023). (Re)Connecting History to the Theory and Praxis of HCI. ACM Transactions on Computer-Human Interaction, 30(2), Artikel 16. https://doi.org/10.1145/3589804
Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A. & Venturi, D. (2023). Registered (Inner-Product) Functional Encryption. I J. Guo & R. Steinfeld (red.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part V (s. 98-133). Springer. https://doi.org/10.1007/978-981-99-8733-7_4
Caragiannis, I. & Narang, S. (2023). Repeatedly Matching Items to Agents Fairly and Efficiently. I A. Deligkas & A. Filos-Ratsikas (red.), Algorithmic Game Theory: 16th International Symposium, SAGT 2023, Egham, UK, September 4–7, 2023, Proceedings (s. 347-364). Springer. https://doi.org/10.1007/978-3-031-43254-5_20
Caragiannis, I. & Narang, S. (2023). Repeatedly Matching Items to Agents Fairly and Efficiently. I AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (s. 2670-2672). Association for Computing Machinery.
Madsen, M., Starup, J. L. & Lutze, M. (2023). Restrictable Variants: A Simple and Practical Alternative to Extensible Variants. I K. Ali & G. Salvaneschi (red.), 37th European Conference on Object-Oriented Programming, ECOOP 2023 (s. 17:1-17:27). Artikel 17 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.17
Tommasel, A., Pablos Sarabia, R. & Assent, I. (2023). Re2Dan: Retrieval of Medical Documents for e-Health in Danish. I Proceedings of the 17th ACM Conference on Recommender Systems, RecSys 2023 (s. 1208-1211). Association for Computing Machinery. https://doi.org/10.1145/3604915.3610655
Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A. & Srinivasan, S. (2023). Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Computational Complexity, 32(1), Artikel 3. https://doi.org/10.1007/s00037-023-00236-x
Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. I K.-M. Chung (red.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (s. 13:1--13:21). Artikel 13 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.13
Braun, L., Damgård, I. B. & Orlandi, C. (2023). Secure Multiparty Computation from Threshold Encryption Based on Class Groups. I H. Handschuh & A. Lysyanskaya (red.), Advances in Cryptology: CRYPTO 2023 (s. 613-645). Springer. https://doi.org/10.1007/978-3-031-38557-5_20
Abram, D., Waters, B. & Zhandry, M. (2023). Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. I H. Handschuh & A. Lysyanskaya (red.), Advances in Cryptology: CRYPTO 2023, Proceedings (Bind Part I, s. 489-514). Springer. https://doi.org/10.1007/978-3-031-38557-5_16
Quercia, A., Morrison, A., Scharr, H. & Assent, I. (2023). SGD Biased towards Early Important Samples for Efficient Training. I G. Chen, L. Khan, X. Gao, M. Qiu, W. Pedrycz & X. Wu (red.), IEEE International Conference on Data Mining, ICDM 2023, Shanghai, China, December 1-4, 2023 (s. 1289-1294). IEEE. https://doi.org/10.1109/ICDM58522.2023.00163
Boudgoust, K. & Scholl, P. (2023). Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. I J. Guo & R. Steinfeld (red.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part I (s. 371-404). Springer. https://doi.org/10.1007/978-981-99-8721-4_12
Schwartzbach, N. I. (2023). Smart Contracts and Rationality. [Ph.d.-afhandling, Aarhus Universitet]. Aarhus Universitet.
Baum, C., Dittmer, S., Scholl, P. & Wang, X. (2023). Sok: vector OLE-based zero-knowledge protocols. Designs, Codes and Cryptography, 91(11), 3527-3561. https://doi.org/10.1007/s10623-023-01292-8