Melissaris Papanikolaou, N., Ravi, D.
& Yakoubov, S. (2024).
Threshold-Optimal MPC With Friends and Foes. I A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (red.),
Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Bind 2, s. 3-24). Springer.
https://doi.org/10.1007/978-3-031-56235-8_1
Doerner, J.
, Kondi, Y., Lee, E., Shelat, A. & Tyner, L. (2023).
Threshold BBS+ Signatures for Distributed Anonymous Credential Issuance. I
44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023 (s. 773-789). IEEE.
https://doi.org/10.1109/SP46215.2023.10179470
Brewer, R. S., Xu, Y., Lee, G. E., Katchuck, M., Moore, C. A. & Johnson, P. M. (2013).
Three Principles for the Design of Energy Feedback Visualizations.
International Journal On Advances in Intelligent Systems,
6(3 & 4), 188-198.
http://csdl.ics.hawaii.edu/techreports/2013/13-05/13-05.pdf
Hu, E.
, Grønbæk, J. E., Ying, W., Du, R. & Heo, S. (2023).
ThingShare: Ad-Hoc Digital Copies of Physical Objects for Sharing Things in 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 365 Association for Computing Machinery.
https://doi.org/10.1145/3544548.3581148
Damgård, I., Nielsen, J. B., Nielsen, M. & Ranellucci, S. (2017).
The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. I J. Katz & H. Shacham (red.),
Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Bind 10401, s. 167-187). Springer VS.
https://doi.org/10.1007/978-3-319-63688-7_6
Rasmusson, A., Hahn, U., Larsen, J. O.
, Gundersen, H. J. G., Jensen, E. B. V. & Nyengaard, J. R. (2013).
The spatial rotator.
Journal of Microscopy,
250(2), 88-100.
https://doi.org/10.1111/jmi.12022
Tsitsulin, A., Munkhoeva, M.
, Mottin, D., Karras, P., Bronstein, A., Oseledets, I. & Müller, E. (2020).
The Shape of Data: Intrinsic Distance for Data Distributions. Afhandling præsenteret på The International Conference on Learning Representations (ICLR), Ababa, Etiopien.
Nayara Ortiz, J., Ricardo de Araujo, R.
, Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021).
The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings.
Entropy,
23(9), Artikel 1108.
https://doi.org/10.3390/e23091108
Atzeni, P.
, Jensen, C. S. ., Orsi, G.
, Ram, S., Tanca, L. Z. I. & Torlone, R. (2013).
The relational model is dead, SQL is dead, and i don't feel so good myself.
SIGMOD Record,
42(2), 64-68.
https://doi.org/10.1145/2503792.2503808
Fink, D. I., Skowronski, M., Zagermann, J., Reinschluessel, A. V., Reiterer, H.
& Feuchtner, T. (2024).
There Is More to Avatars Than Visuals: Investigating Combinations of Visual and Auditory User Representations for Remote Collaboration in Augmented Reality.
Proceedings of the ACM on Human-Computer Interaction,
8(ISS), 540-568.
https://doi.org/10.1145/3698148
Bui, T. L., Chatterjee, K., Gautam, T.
, Pavlogiannis, A. & Toman, V. (2021).
The reads-from equivalence for the TSO and PSO memory models.
Proceedings of the ACM on Programming Languages ,
5(OOPSLA), Artikel 164.
https://doi.org/10.1145/3485541
Afshani, P., Afrawal, M., Benjamin, D.
, Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012).
The Query Complexity of Finding a Hidden Permutation.
Electronic Colloquium on Computational Complexity, (TR12-087).
http://eccc.hpi-web.de/report/2012/087/
Afshani, P., Agrawal, M., Benjamin, D., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2013).
The Query Complexity of Finding a Hidden Permutation. I A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (red.),
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (s. 1-11). Springer VS.
https://doi.org/10.1007/978-3-642-40273-9_1
Afshani, P., Agrawal, M., Doerr, B., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2019).
The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics,
260, 28-50.
https://doi.org/10.1016/j.dam.2019.01.007
Braverman, V., Cohen-Addad, V., Jiang, S. H.-C., Krauthgamer, R.
, Schwiegelshohn, C., Toftrup, M. B. & Wu, X. (2022).
The Power of Uniform Sampling for Coresets. I
Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (s. 462-473). IEEE.
https://doi.org/10.1109/FOCS54457.2022.00051