Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977554.ch173 

Arroyo-Urea, S., Watson, J., &; García-Nafría, J. (2023). Molecular Cloning Using In Vivo DNA Assembly. In G. Scarlett (Ed.), DNA Manipulation and Analysis (Vol. 2633, pp. 33–44). New York, NY, United States: Springer Nature.https://doi.org/10.1007/978-1-0716-3004-4_3 

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2023). Fast and scalable channels in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada: Association for Computing Machinery.https://doi.org/10.1145/3572848.3577481 

Aksenov, V., Brown, T. A., Fedorov, A., &; Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery.https://doi.org/10.1145/3572848.3577512 

Henzinger, M. H., Neumann, S., Räcke, H., &; Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2023.36