- 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.
Contact details
Address
Dr Vitaly Aksenov
City, University of London
Northampton Square
London EC1V 0HB
United Kingdom
Northampton Square
London EC1V 0HB
United Kingdom
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, Sep 2015 – Aug 2018
- MSc, ITMO University, Russian Federation, Sep 2013 – Aug 2015
- BSc, ITMO University, Russian Federation, Sep 2009 – Aug 2013
Employment
- Assistant Professor, ITMO University, Sep 2021 – Jul 2023
- Researcher, ITMO University, Sep 2019 – Aug 2021
- Post-doc, IST Austria, Jan – Aug 2019
Publications
Publications by category
Chapters (4)
- Aksenov, V., Gramoli, V., Kuznetsov, P., Shang, D. and Ravi, S. (2021). Optimal Concurrency for List-Based Sets. Lecture Notes in Computer Science (pp. 386–401). Springer International Publishing. ISBN 978-3-030-86358-6.
- Aksenov, V., Ben-Baruch, O., Hendler, D., Kokorin, I. and Rusanovsky, M. (2021). Execution of NVRAM Programs with Persistent Stack. Lecture Notes in Computer Science (pp. 117–131). Springer International Publishing. ISBN 978-3-030-86358-6.
- Aksenov, V., Kuznetsov, P. and Shalyto, A. (2019). On Helping and Stacks. Networked Systems (pp. 107–121). Springer International Publishing. ISBN 978-3-030-05528-8.
- 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 978-3-319-64202-4.
Conference papers and proceedings (17)
- Aksenov, V., Koval, N., Kuznetsov, P. and Paramonov, A. (2024). 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. (2024). 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., Kokorin, I. and Martsenyuk, A. (2023). Parallel-Batched Interpolation Search Tree. doi:10.1007/978-3-031-41673-6_9
- Aksenov, V., Paramonov, A., Salem, I. and Schmid, S. (2023). Self-adjusting Linear Networks with Ladder Demand Graph. doi:10.1007/978-3-031-32733-9_7
- Aksenov, V., Brown, T., Fedorov, A. and Kokorin, I. (2023). 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
- 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. (2021). Toward Self-Adjusting Networks for the Matching Model. SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures. doi:10.1145/3409964.3461824
- Koval, N. and Aksenov, V. (2020). 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., Drozdova, A. and Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. doi:10.4230/LIPIcs.DISC.2020.3
- Aksenov, V., Alistarh, D. and Korhonen, J.H. (2020). Relaxed scheduling for scalable belief propagation.
- Acar, U.A., Aksenov, V., Charguéraud, A. and Rainey, M. (2019). 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. (2019). Parallel combining: Benefits of explicit synchronization. doi:10.4230/LIPIcs.OPODIS.2018.11
- Aksenov, V., Alistarh, D. and Kuznetsov, P. (2018). 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. (2018). 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., Charguéraud, A. and Rainey, M. (2018). Performance challenges in modular parallel programs. doi:10.1145/3200691.3178516
- Acar, U.A., Aksenov, V. and Westrick, S. (2017). Brief Announcement. SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures. doi:10.1145/3087556.3087595