Vitaly Aksenov

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 51

Top Topics

Belief Propagation

Top Venues

Publications

Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Stefan Schmid, Vitaly Aksenov
Toward Self-Adjusting $k$-Ary Search Tree Networks. IPDPS (Workshops) (2024)
Ravil Galiev, Michael F. Spear, Vitaly Aksenov
The Next 700 Benchmarking Frameworks for Concurrent Data Structures. ApPLIED@PODC (2024)
Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov
Practical Hardware Transactional vEB Trees. PPoPP (2024)
Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov
Memory Bounds for Concurrent Bounded Queues. PPoPP (2024)
Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov, Vyacheslav Lukianov, Nikita Zinoviev, Dmitry Ivanov, Vitaly Aksenov
Trigram-Based Persistent IDE Indices with Quick Startup. CoRR (2024)
Ilya Kokorin, Victor Yudov, Vitaly Aksenov, Dan Alistarh
Wait-free Trees with Asymptotically-Efficient Range Queries. IPDPS (2024)
Enrico Lopedoto, Maksim Shekhunov, Vitaly Aksenov, Kizito Salako, Tillman Weyde
Derivative-based regularization for regression. CoRR (2024)
Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
In the Search of Optimal Tree Networks: Hardness and Heuristics. CoRR (2024)
Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
On the Complexity of the Virtual Network Embedding in Specific Tree Topologies. CoRR (2023)
Alexander Slastin, Dan Alistarh, Vitaly Aksenov
Efficient Self-Adjusting Search Trees via Lazy Updates. CoRR (2023)
Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin
Unexpected Scaling in Path Copying Trees. PPoPP (2023)
Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid
Self-adjusting Linear Networks with Ladder Demand Graph. SIROCCO (2023)
Ilya Kokorin, Dan Alistarh, Vitaly Aksenov
Wait-free Trees with Asymptotically-Efficient Range Queries. CoRR (2023)
Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
Parallel-Batched Interpolation Search Tree. PaCT (2023)
Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov
Toward Self-Adjusting k-ary Search Tree Networks. CoRR (2023)
Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. DISC (2023)
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
The splay-list: a distribution-adaptive concurrent skip-list. Distributed Comput. 36 (3) (2023)
Ilya Kokorin, Vitaly Aksenov, Alena Martsenyuk
Parallel-batched Interpolation Search Tree. CoRR (2023)
Vitaly Aksenov, Dmitry Ivanov, Ravil Galiev
Benchmark Framework with Skewed Workloads. CoRR (2023)
Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov
Unexpected Scaling in Path Copying Trees. CoRR (2022)
Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. INFOCOM (2022)
Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov
Self-Adjusting Linear Networks with Ladder Demand Graph. CoRR (2022)
Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
Parallel Batched Interpolation Search Tree. CoRR (2021)
Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky
Execution of NVRAM Programs with Persistent Stack. CoRR (2021)
Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov
Peformance Prediction for Coarse-Grained Locking: MCS Case. CoRR (2021)
Ali Ramezani-Kebrya, Fartash Faghri, Ilia Markov, Vitaly Aksenov, Dan Alistarh, Daniel M. Roy
NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization. CoRR (2021)
Vitaly Aksenov, Nikita Koval, Petr Kuznetsov
Memory-Optimality for Non-Blocking Containers. CoRR (2021)
Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky
Execution of NVRAM Programs with Persistent Stack. PaCT (2021)
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi
Optimal Concurrency for List-Based Sets. PaCT (2021)
Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
Toward Self-Adjusting Networks for the Matching Model. SPAA (2021)
Vitaly Aksenov
Overview of Bachelors Theses 2021. CoRR (2021)
Vitaly Aksenov, Petr Kuznetsov
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. SIGACT News 51 (4) (2020)
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. DISC (2020)
Vitaly Aksenov, Alexey Fyodorov
Review of the Hydra Conference on Concurrent and Distributed Computing Hydra 2020. SIGACT News 51 (4) (2020)
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
Scalable Belief Propagation via Relaxed Scheduling. NeurIPS (2020)
Nikita Koval, Vitaly Aksenov
Restricted memory-friendly lock-free bounded queues. PPoPP (2020)
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
Relaxed Scheduling for Scalable Belief Propagation. CoRR (2020)
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. CoRR (2020)
Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. CoRR (2019)
Sergey Aganezov, Ilya Zban, Vitaly Aksenov, Nikita Alexeev, Michael C. Schatz
Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinform. (20) (2019)
Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
Performance Prediction for Coarse-Grained Locking. CoRR (2019)
Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey
Provably and practically efficient granularity control. PPoPP (2019)
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
Parallel Combining: Benefits of Explicit Synchronization. OPODIS (2018)
Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC (2018)
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
On Helping and Stacks. NETYS (2018)
Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey
Performance challenges in modular parallel programs. PPOPP (2018)
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
A Concurrency-Optimal Binary Search Tree. CoRR (2017)
Vitaly Aksenov, Petr Kuznetsov
Parallel Combining: Making Use of Free Cycles. CoRR (2017)
Umut A. Acar, Vitaly Aksenov, Sam Westrick
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA (2017)
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
A Concurrency-Optimal Binary Search Tree. Euro-Par (2017)
Vitaly Aksenov, Petr Kuznetsov
Flat Parallelization. CoRR (2017)