Vitaly Aksenov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
22
Venues
12
Active years
2017–2025
Best venue rank
A*
Where they publish
Papers
22 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | GECCO | In the Search of Optimal Tree Networks: Hardness and Heuristics. | Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid |
| 2025 | ICDCS | Skip Hash: A Fast Ordered Map Via Software Transactional Memory. | Matthew Rodriguez, Vitaly Aksenov, Michael F. Spear |
| 2025 | IJCNN | Data Driven Derivative-based Regularization for Regression. | Enrico Lopedoto, Kizito Salako, Maksim Shekhunov, Vitaly Aksenov, Tillman Weyde |
| 2025 | PACT | Efficient OLAP Support of Hierarchical Data Almost in Real-Time. | Vitaly Aksenov, Ilya Kokorin, Nikolai Stoiko |
| 2025 | PODC | Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. | Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov |
| 2024 | ESA | Toward Self-Adjusting k-Ary Search Tree Networks. | Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid |
| 2024 | PPoPP | Memory Bounds for Concurrent Bounded Queues. | Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov |
| 2024 | PPoPP | Practical Hardware Transactional vEB Trees. | Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov |
| 2023 | PACT | Parallel-Batched Interpolation Search Tree. | Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk |
| 2023 | PPoPP | Unexpected Scaling in Path Copying Trees. | Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin |
| 2023 | SIROCCO | Self-adjusting Linear Networks with Ladder Demand Graph. | Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid |
| 2022 | INFOCOM | Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. | Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid |
| 2021 | PACT | Execution of NVRAM Programs with Persistent Stack. | Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky |
| 2021 | PACT | Optimal Concurrency for List-Based Sets. | Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi |
| 2021 | SPAA | Toward Self-Adjusting Networks for the Matching Model. | Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid |
| 2020 | PPoPP | Restricted memory-friendly lock-free bounded queues. | Nikita Koval, Vitaly Aksenov |
| 2019 | PPoPP | Provably and practically efficient granularity control. | Umut A. Acar, Vitaly Aksenov, Arthur Charguraud, Mike Rainey |
| 2018 | OPODIS | Parallel Combining: Benefits of Explicit Synchronization. | Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto |
| 2018 | PODC | Brief Announcement: Performance Prediction for Coarse-Grained Locking. | Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov |
| 2018 | PPoPP | Performance challenges in modular parallel programs. | Umut A. Acar, Vitaly Aksenov, Arthur Charguraud, Mike Rainey |
| 2017 | EuroPar | A Concurrency-Optimal Binary Search Tree. | Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi |
| 2017 | SPAA | Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. | Umut A. Acar, Vitaly Aksenov, Sam Westrick |