Follow
Vitaly Aksenov
Vitaly Aksenov
City, University of London
Verified email at itmo.ru - Homepage
Title
Cited by
Cited by
Year
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
A Ramezani-Kebrya, F Faghri, I Markov, V Aksenov, D Alistarh, DM Roy
The Journal of Machine Learning Research 22 (1), 5074-5116, 2021
322021
Provably and practically efficient granularity control
UA Acar, V Aksenov, A Charguéraud, M Rainey
Proceedings of the 24th Symposium on Principles and Practice of Parallel …, 2019
212019
SwarmSGD: Scalable Decentralized SGD with Local Updates
G Nadiradze, A Sabour, D Alistarh, A Sharma, I Markov, V Aksenov
arXiv preprint arXiv:1910.12308, 2019
172019
A concurrency-optimal binary search tree
V Aksenov, V Gramoli, P Kuznetsov, A Malova, S Ravi
European Conference on Parallel Processing, 580-593, 2017
132017
Brief announcement: Parallel dynamic tree contraction via self-adjusting computation
UA Acar, V Aksenov, S Westrick
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
112017
The Splay-List: A Distribution-Adaptive Concurrent Skip-List
V Aksenov, D Alistarh, A Drozdova, A Mohtashami
DISC 2020, 3:1-3:18, 2020
102020
Scalable Belief Propagation via Relaxed Scheduling
V Aksenov, D Alistarh, JH Korhonen
Advances in Neural Information Processing Systems 33, 2020
9*2020
Brief Announcement: Performance Prediction for Coarse-Grained Locking
V Aksenov, D Alistarh, P Kuznetsov
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
92018
Optimal Concurrency for List-Based Sets
V Aksenov, V Gramoli, P Kuznetsov, D Shang, S Ravi
Parallel Computing Technologies: 16th International Conference, PaCT 2021 …, 2021
8*2021
Recovering rearranged cancer chromosomes from karyotype graphs
S Aganezov, I Zban, V Aksenov, N Alexeev, MC Schatz
BMC bioinformatics 20 (20), 1-11, 2019
82019
Parallel Combining: Benefits of Explicit Synchronization
V Aksenov, P Kuznetsov, A Shalyto
OPODIS 2018, 11:1-11:16, 2018
62018
Lazy self-adjusting bounded-degree networks for the matching model
E Feder, I Rathod, P Shyamsukha, R Sama, V Aksenov, I Salem, ...
IEEE INFOCOM 2022-IEEE Conference on Computer Communications, 1089-1098, 2022
52022
Synchronization costs in parallel programs and concurrent data structures
V Aksenov
52018
Performance challenges in modular parallel programs
UA Acar, V Aksenov, A Charguéraud, M Rainey
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of …, 2018
42018
Domino tilings and determinants
V Aksenov, K Kokhas
Journal of Mathematical Sciences 200 (6), 647-653, 2014
4*2014
Toward self-adjusting networks for the matching model
E Feder, I Rathod, P Shyamsukha, R Sama, V Aksenov, I Salem, ...
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
32021
Parallel-Batched Interpolation Search Tree
V Aksenov, I Kokorin, A Martsenyuk
International Conference on Parallel Computing Technologies, 109-125, 2023
22023
On helping and stacks
V Aksenov, P Kuznetsov, A Shalyto
International Conference on Networked Systems, 107-121, 2018
22018
Chip removal. Urban Renewal revisited
V Aksenov, K Kokhas
Journal of Mathematical Sciences 209 (6), 809-825, 2015
22015
Self-adjusting linear networks with ladder demand graph
V Aksenov, A Paramonov, I Salem, S Schmid
International Colloquium on Structural Information and Communication …, 2023
12023
The system can't perform the operation now. Try again later.
Articles 1–20