City Research Online

Items where City Author is "Aksenov, Vitaly"

Up a level
Group by: Type | No Grouping
Number of items: 3.

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

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

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.

This list was generated on Fri Dec 13 02:34:09 2024 UTC.