Burkhardt, J., Damgård, I., Frederiksen, T. K., Orlandi, C. & Ghosh, S. (2023).
Improved Distributed RSA Key Generation Using the Miller-Rabin Test. I W. Meng, C. D. Jensen, C. Cremers & E. Kirda (red.),
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (s. 2501-2515). Association for Computing Machinery.
https://doi.org/10.1145/3576915.3623163
Cohen-Addad, V.
, Larsen, K. G., Saulpic, D.
, Schwiegelshohn, C. & Sheikh-Omar, O. A. (2022).
Improved Coresets for Euclidean k-Means. I S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho & A. Oh (red.),
Advances in Neural Information Processing Systems 35 - 36th Conference on Neural Information Processing Systems, NeurIPS 2022 Neural Information Processing Systems Foundation.
Bringmann, K.
, Hansen, T. D. & Krinninger, S. (2017).
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio 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. 124:1-124:16). Artikel 124 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ICALP.2017.124
Svendsen, K. & Birkedal, L. (2014).
Impredicative concurrent abstract predicates. I Z. Shao (red.),
Programming Languages and Systems: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (s. 149-168 ). Springer.
https://doi.org/10.1007/978-3-642-54833-8_9
Damgård, I. B., Keller, M., Keller, E., Miles, C. & Smart, N. P. (2012).
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol.
Lecture Notes in Computer Science,
7485, 241-263.
https://doi.org/10.1007/978-3-642-32928-9_14
Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A.
, Branzei, S., Wooldridge, M. & Jennings , N. (2014).
Implementation and Computation of a Value for Generalized Characteristic Function Games.
A C M Transactions on Economics and Computation,
2(4), Artikel 16.
https://doi.org/10.1145/2665007
Sørensen, T. S., Therkildsen, S. V.
, Hansen, O. K., Sørensen, K. & Pedersen, E. M. (2002).
Images in cardiovascular medicine. Total cavo-pulmonary connection: a virtual 3-dimensional fly-through.
Circulation,
105(20), E176-6.
Bender, E., Schaper, N.
, Caspersen, M. E., Margaritis, M. & Hubwieser, P. (2016).
Identifying and formulating teachers' beliefs and motivational orientations for computer science teacher education.
Studies in Higher Education,
41(11), 1958-1973.
https://doi.org/10.1080/03075079.2015.1004233
Saatci, B., Rädle, R., Rintel, S., O'Hara, K.
& Klokmose, C. N. (2019).
Hybrid Meetings in the Modern Workplace: Stories of Success and Failure. 45-61. Afhandling præsenteret på International Conference on Collaboration and Technology, Kyoto, Japan.
Helms, J., Schaefer, R., Luyten, K.
, Vermeulen, J., Abrams, M., Coyette, A. & Vanderdonckt, J. (2009).
Human-Centered Engineering Of Interactive Systems With The User Interface Markup Language. I
Human-Centered Software Engineering - Software Engineering Models, Patterns and Architectures for HCI (s. 139-171)
https://doi.org/10.1007/978-1-84800-907-3_7
Abdrabou, Y., Mecke, L., Rivu, R., Prange, S., Nguyen, Q. D., Voigt, V., Alt, F.
& Pfeuffer, K. (2023).
How Unique do we Move? Understanding the Human Body and Context Factors for User Identification. I M. Stolze, F. Loch, M. Baldauf, F. Alt, C. Schneegass, T. Kosch, T. Hirzle, S. Sadeghian, F. Draxler, K. Bektas, K. Lohan & P. Knierim (red.),
Proceedings of Mensch Und Computer 2023 (s. 127-137). Association for Computing Machinery.
https://doi.org/10.1145/3603555.3603574
Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016).
How to prove knowledge of small secrets. I J. Katz & M. Robshaw (red.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Bind 9816, s. 478-498). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_17
Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2017).
How to Morph Planar Graph Drawings.
S I A M Journal on Computing,
46(2), 824-852.
https://doi.org/10.1137/16M1069171
Fleischhacker, N.
, Larsen, K. G. & Simkin, M. (2023).
How to Compress Encrypted Data. 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. 551-577). Springer.
https://doi.org/10.1007/978-3-031-30545-0_19
Kohlweiss, M.
, Pancholi, M. R. & Takahashi, A. (2023).
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. I G. Rothblum & H. Wee (red.),
Theory of Cryptography: Book Subtitle 21st International Conference, TCC 2023, Taipei, Taiwan, November 29–December 2, 2023, Proceedings, Part III (s. 486–512). Springer.
https://doi.org/10.1007/978-3-031-48621-0_17