Contact details
About
Overview
Vitaly joined the Department of Computer Science at City in 2023 as the Lecturer. Prior to this he was Assistant Professor at ITMO University, Russia, in 2021-2023. He got his PhD in INRIA Paris in 2018 under the guidance of professor Petr Kuznetsov and was a post-doc in IST Austria in 2019 under the professor Dan Alistarh. The rest of the time he was working in ITMO University in different positions.
His main interest lies in the areas of Parallel, Concurrent, and Distributed Computing and Networking with detours to Algorithms and Data Structures, Machine Learning, and Bioinformatics.
Qualifications
- PhD, Paris 7 Diderot and INRIA Paris, France, September 2015 - August 2018
- MSc, ITMO University, Russian Federation, September 2013 - August 2015
- BSc, ITMO University, Russian Federation, September 2009 - August 2013
Employment
- Assistant Professor, ITMO University, Russian Federation, September 2021 - July 2023
- Researcher, ITMO University, Russian Federation, September 2019 - August 2021
- Post-doc, IST Austria, Austria, January - August 2019
Publications
Publications by category
Chapters (2)
- Aksenov, V., Kuznetsov, P. and Shalyto, A. (2019). On Helping and Stacks. Lecture Notes in Computer Science (pp. 107-121). Springer International Publishing. ISBN 9783030055288.
- Aksenov, V., Gramoli, V., Kuznetsov, P., Malova, A. and Ravi, S. (2017). A Concurrency-Optimal Binary Search Tree. Lecture Notes in Computer Science (pp. 580-593). Springer International Publishing. ISBN 9783319642024.
Conference papers and proceedings (29)
- Semenov, G. and Aksenov, V. Semantic Conflict Model for Collaborative Data Structures. EuroSys '26: 21st European Conference on Computer Systems.doi:10.1145/3806077.3806700
- Rodriguez, M., Aksenov, V. and Spear, M. (2025). Skip Hash: A Fast Ordered Map Via Software Transactional Memory. 2025 IEEE 45th International Conference on Distributed Computing Systems (ICDCS) 21-23 July.doi:10.1109/icdcs63083.2025.00097
- Martynov, P., Buzdalov, M., Pankratov, S., Aksenov, V. and Schmid, S. In the Search of Optimal Tree Networks: Hardness and Heuristics. GECCO '25: Genetic and Evolutionary Computation Conference.doi:10.1145/3712256.3726425
- Lopedoto, E., Salako, K., Shekhunov, M., Aksenov, V. and Weyde, T. (2025). Data Driven Derivative-based Regularization for Regression. 2025 International Joint Conference on Neural Networks (IJCNN) 30 June-5 July.doi:10.1109/ijcnn64981.2025.11228067
- Anoprenko, M., Kuznetsov, P. and Aksenov, V. Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. PODC '25: ACM Symposium on Principles of Distributed Computing.doi:10.1145/3732772.3733539
- Feder, E., Paramonov, A., Mavrin, P., Salem, I., Aksenov, V. and Schmid, S. (2024). Toward Self-Adjusting k-Ary Search Tree Networks. 32nd Annual European Symposium on Algorithms (ESA 2024) 2-4 September, London, UK.doi:10.4230/LIPIcs.ESA.2024.52
- Iakovlev, Z., Chulkov, A., Golikov, N., Lukianov, V., Zinoviev, N., Ivanov, D.... Aksenov, V. Trigram-Based Persistent IDE Indices with Quick Startup. .doi:10.1145/3643796.3648460
- Galiev, R., Spear, M. and Aksenov, V. The Next 700 Benchmarking Frameworks for Concurrent Data Structures. ApPLIED'24: 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems.doi:10.1145/3663338.3665827
- Kokorin, I., Yudov, V., Aksenov, V. and Alistarh, D. (2024). Wait-free Trees with Asymptotically-Efficient Range Queries. 2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS) 27-31 May.doi:10.1109/ipdps57955.2024.00023
- Feder, E., Paramonov, A., Mavrin, P., Salem, I., Schmid, S. and Aksenov, V. (2024). Toward Self-Adjusting $k$-Ary Search Tree Networks. 2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) 27-31 May.doi:10.1109/ipdpsw63119.2024.00209
- Aksenov, V., Koval, N., Kuznetsov, P. and Paramonov, A. Memory Bounds for Concurrent Bounded Queues. PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3627535.3638497
- Khalaji, M., Brown, T., Daudjee, K. and Aksenov, V. Practical Hardware Transactional vEB Trees. PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3627535.3638504
- Aksenov, V., Anoprenko, M., Fedorov, A. and Spear, M. (2023). Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. International Symposium on Distributed Computing (DISC) 10-12 October, L'Aquila, Italy.doi:10.4230/LIPIcs.DISC.2023.35
- Aksenov, V., Brown, T., Fedorov, A. and Kokorin, I. Unexpected Scaling in Path Copying Trees. PPoPP '23: The 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3572848.3577512
- Aksenov, V., Kokorin, I. and Martsenyuk, A. Parallel-Batched Interpolation Search Tree. .doi:10.1007/978-3-031-41673-6_9
- Aksenov, V., Paramonov, A., Salem, I. and Schmid, S. Self-adjusting Linear Networks with Ladder Demand Graph. .doi:10.1007/978-3-031-32733-9_7
- Feder, E., Rathod, I., Shyamsukha, P., Sama, R., Aksenov, V., Salem, I.... Schmid, S. (2022). Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. IEEE INFOCOM 2022 - IEEE Conference on Computer Communications 2-5 May.doi:10.1109/infocom48880.2022.9796885
- Feder, E., Rathod, I., Shyamsukha, P., Sama, R., Aksenov, V., Salem, I.... Schmid, S. Toward Self-Adjusting Networks for the Matching Model. SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures.doi:10.1145/3409964.3461824
- Aksenov, V., Ben-Baruch, O., Hendler, D., Kokorin, I. and Rusanovsky, M. Execution of NVRAM Programs with Persistent Stack. .doi:10.1007/978-3-030-86359-3_9
- Aksenov, V., Gramoli, V., Kuznetsov, P., Shang, D. and Ravi, S. Optimal Concurrency for List-Based Sets. .doi:10.1007/978-3-030-86359-3_29
- Aksenov, V., Alistarh, D., Drozdova, A. and Mohtashami, A. The splay-list: A distribution-adaptive concurrent skip-list. .doi:10.4230/LIPIcs.DISC.2020.3
- Koval, N. and Aksenov, V. Restricted memory-friendly lock-free bounded queues. PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3332466.3374508
- Aksenov, V., Alistarh, D. and Korhonen, J.H. Relaxed scheduling for scalable belief propagation. .
- Acar, U.A., Aksenov, V., Charguéraud, A. and Rainey, M. Provably and practically efficient granularity control. PPoPP '19: 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3293883.3295725
- Aksenov, V., Kuznetsov, P. and Shalyto, A. Parallel combining: Benefits of explicit synchronization. .doi:10.4230/LIPIcs.OPODIS.2018.11
- Aksenov, V., Alistarh, D. and Kuznetsov, P. Brief Announcement. PODC '18: ACM Symposium on Principles of Distributed Computing.doi:10.1145/3212734.3212785
- Acar, U.A., Aksenov, V., Charguéraud, A. and Rainey, M. Performance challenges in modular parallel programs. .doi:10.1145/3200691.3178516
- Acar, U.A., Aksenov, V., Charguéraud, A. and Rainey, M. Performance challenges in modular parallel programs. PPoPP '18: 23nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.doi:10.1145/3178487.3178516
- Acar, U.A., Aksenov, V. and Westrick, S. Brief Announcement. SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures.doi:10.1145/3087556.3087595
Journal articles (7)
- Skazhenik, T.M., Aksenov, V.E., Malakhov, A.A. and Churbanov, A.V. (2026). Performance evaluation of synchronization algorithms in lightweight thread environments in C++. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 26(1), pp. 125-134. doi:10.17586/2226-1494-2026-26-1-125-134
- Aksenov, V., Alistarh, D., Drozdova, A. and Mohtashami, A. (2023). The splay-list: a distribution-adaptive concurrent skip-list. Distributed Computing, 36(3), pp. 395-418. doi:10.1007/s00446-022-00441-x
- Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D. and Roy, D.M. (2021). Nuqsgd: Provably communication-efficient data-parallel sgd via nonuniform quantization. Journal of Machine Learning Research, 22
- Aganezov, S., Zban, I., Aksenov, V., Alexeev, N. and Schatz, M.C. (2019). Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics, 20(S20). doi:10.1186/s12859-019-3208-4
- Aksenov, V.E. and Kokhas, K.P. (2016). Calculation of Pfaffians by a Chip Removal. Journal of Mathematical Sciences, 215(6), pp. 631-648. doi:10.1007/s10958-016-2870-6
- Aksenov, V. and Kokhas, K. (2015). Chip Removal. Urban Renewal Revisited. Journal of Mathematical Sciences, 209(6), pp. 809-825. doi:10.1007/s10958-015-2528-9
- Aksenov, V. and Kokhas, K. (2014). Domino Tilings and Determinants. Journal of Mathematical Sciences, 200(6), pp. 647-653. doi:10.1007/s10958-014-1954-4