City Research Online

Martynov, P., Buzdalov, M., Pankratov, S. , Aksenov, V. ORCID: 0000-0001-9134-5490 & Schmid, S.view all authors (2025). In the Search of Optimal Tree Networks: Hardness and Heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO '25: Genetic and Evolutionary Computation Conference, 14-18 Jul 2025, Malaga, Spain. doi: 10.1145/3712256.3726425

Rodriguez, M., Aksenov, V. ORCID: 0000-0001-9134-5490 & Spear, M. (2025). Skip Hash: A Fast Ordered Map Via Software Transactional Memory. Paper presented at the IEEE ICDCS 2025 45th IEEE International Conference on Distributed Computing Systems, 20-23 Jul 2025, Glasgow, London.

Lopedoto, E., Salako, K. ORCID: 0000-0003-0394-7833, Shekhunov, M. , Aksenov, V. ORCID: 0000-0001-9134-5490 & Weyde, T. ORCID: 0000-0001-8028-9905view all authors (2025). Data Driven Derivative-based Regularization for Regression. Paper presented at the International Joint Conference on Neural Networks 2025, 30 Jun - 05 Jul 2025, Rome, Italy.

Anoprenko, M., Kuznetsov, P. & Aksenov, V. ORCID: 0000-0001-9134-5490 (2025). Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC '25: ACM Symposium on Principles of Distributed Computing, 16-20 Jun 2025, Huatulco, Mexico. doi: 10.1145/3732772.3733539

Feder, E., Paramonov, A., Mavrin, P. , Salem, I., Aksenov, V. ORCID: 0000-0001-9134-5490 & Schmid, S.view all authors (2024). Toward Self-Adjusting k-Ary Search Tree Networks. In: 32nd Annual European Symposium on Algorithms (ESA 2024). 32nd Annual European Symposium on Algorithms (ESA 2024), 2-4 Sep 2024, London, UK. doi: 10.4230/LIPIcs.ESA.2024.52

Kokorin, I., Yudov, V., Aksenov, V. ORCID: 0000-0001-9134-5490 & Alistarh, D.view all authors (2024). Wait-free Trees with Asymptotically-Efficient Range Queries. In: 2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 27-31 May 2024, San Francisco, CA, USA. doi: 10.1109/ipdps57955.2024.00023

Aksenov, V. ORCID: 0000-0001-9134-5490, Anoprenko, M., Fedorov, A. & Spear, M.view all authors (2023). Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. In: Leibniz International Proceedings in Informatics. International Symposium on Distributed Computing (DISC), 10-12 Oct 2023, L'Aquila, Italy. doi: 10.4230/LIPIcs.DISC.2023.35

Aksenov, V. ORCID: 0000-0001-9134-5490, Kokorin, I. & Martsenyuk, A. (2023). Parallel-Batched Interpolation Search Tree. In: Lecture Notes in Computer Science. 17th International Conference, PaCT 2023, 21-25 Aug 2023, Astana, Kazakhstan. doi: 10.1007/978-3-031-41673-6_9

Ramezani-Kebrya, A., Faghri, F., Markov, I. , Aksenov, V. ORCID: 0000-0001-9134-5490, Alistarh, D. & Roy, D. M.view all authors (2021). Nuqsgd: Provably communication-efficient data-parallel sgd via nonuniform quantization. Journal of Machine Learning Research, 22, article number 114.