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. Paper presented at The International Conference on Learning Representations (ICLR), Ababa, Ethiopia.
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), Article 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
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), Article 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. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.),
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 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. In
Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (pp. 462-473). IEEE.
https://doi.org/10.1109/FOCS54457.2022.00051
Billington, J.
, Christensen, S., Hee, K. V., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M., Aalst, W. M. P. V. D. (Ed.) & Best, E. (Ed.) (2003).
The Petri Net Markup Language: Concepts, Technology, and Tools. In
Ikke angivet (2679 of Lecture Notes in Computer Science ed., pp. 483-505). Springer.