| NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization A Ramezani-Kebrya, F Faghri, I Markov, V Aksenov, D Alistarh, DM Roy Journal of Machine Learning Research 22 (114), 1-43, 2021 | 33 | 2021 |
| 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 | 21 | 2019 |
| 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 | 17 | 2019 |
| Scalable Belief Propagation via Relaxed Scheduling V Aksenov, D Alistarh, JH Korhonen Advances in Neural Information Processing Systems 33, 2020 | 14* | 2020 |
| A concurrency-optimal binary search tree V Aksenov, V Gramoli, P Kuznetsov, A Malova, S Ravi Euro-Par 2017: Parallel Processing: 23rd International Conference on …, 2017 | 13 | 2017 |
| 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 | 12 | 2017 |
| The Splay-List: A Distribution-Adaptive Concurrent Skip-List V Aksenov, D Alistarh, A Drozdova, A Mohtashami DISC 2020, 3:1-3:18, 2020 | 10 | 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 | 9 | 2018 |
| 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 | 8 | 2019 |
| Parallel Combining: Benefits of Explicit Synchronization V Aksenov, P Kuznetsov, A Shalyto OPODIS 2018, 11:1-11:16, 2018 | 6 | 2018 |
| 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 | 5 | 2022 |
| Synchronization costs in parallel programs and concurrent data structures V Aksenov ITMO University; Paris Diderot University, 2018 | 5 | 2018 |
| 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 | 4 | 2018 |
| Domino tilings and determinants V Aksenov, K Kokhas Journal of Mathematical Sciences 200 (6), 647-653, 2014 | 4* | 2014 |
| Self-adjusting linear networks with ladder demand graph A Paramonov, I Salem, S Schmid, V Aksenov arXiv preprint arXiv:2207.03948, 2022 | 3 | 2022 |
| 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 | 3 | 2021 |
| Wait-free Trees with Asymptotically-Efficient Range Queries I Kokorin, D Alistarh, V Aksenov arXiv preprint arXiv:2310.05293, 2023 | 2 | 2023 |
| Parallel-Batched Interpolation Search Tree V Aksenov, I Kokorin, A Martsenyuk International Conference on Parallel Computing Technologies, 109-125, 2023 | 2 | 2023 |
| Restricted memory-friendly lock-free bounded queues N Koval, V Aksenov Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of …, 2020 | 2 | 2020 |
