Items where City Author is "Aksenov, Vitaly"
Feder, E., Paramonov, A., Mavrin, P. , Salem, I., Aksenov, V. 
ORCID: 0000-0001-9134-5490 & Schmid, S. (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. (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. (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. (2021).
Nuqsgd: Provably communication-efficient data-parallel sgd via nonuniform quantization.
Journal of Machine Learning Research, 22,
article number 114.