Vitaly Aksenov

64 papers A* 4A 6B 15Journal 32Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Compression is all you need: Modeling Mathematics. CoRR Vitaly Aksenov, Eve Bodnia, Michael H. Freedman, Michael Mulligan
2026	—	`conf`	Semantic Conflict Model for Collaborative Data Structures. PaPoC@EuroSys Georgii Semenov, Vitaly Aksenov
2026	J	`jnl`	Semantic Conflict Model for Collaborative Data Structures. CoRR Georgii Semenov, Vitaly Aksenov
2025	J	`jnl`	Basic Lock Algorithms in Lightweight Thread Environments. CoRR Taras Skazhenik, Nikolai Korobenikov, Andrei Churbanov, Anton Malakhov, Vitaly Aksenov
2025	A*	`conf`	Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. PODC Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov
2025	B	`conf`	Data Driven Derivative-based Regularization for Regression. IJCNN Enrico Lopedoto, Kizito Salako, Maksim Shekhunov, Vitaly Aksenov, Tillman Weyde
2025	B	`conf`	Efficient OLAP Support of Hierarchical Data Almost in Real-Time. PaCT Vitaly Aksenov, Ilya Kokorin, Nikolai Stoiko
2025	A	`conf`	In the Search of Optimal Tree Networks: Hardness and Heuristics. GECCO Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
2025	J	`jnl`	Model-based Testing of Practical Distributed Systems in Actor Model. CoRR Ilya Kokorin, Evgeny Chernatskiy, Vitaly Aksenov
2025	A	`conf`	Skip Hash: A Fast Ordered Map Via Software Transactional Memory. ICDCS Matthew Rodriguez, Vitaly Aksenov, Michael F. Spear
2024	J	`jnl`	Derivative-based regularization for regression. CoRR Enrico Lopedoto, Maksim Shekhunov, Vitaly Aksenov, Kizito Salako, Tillman Weyde
2024	J	`jnl`	In the Search of Optimal Tree Networks: Hardness and Heuristics. CoRR Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
2024	B	`conf`	Memory Bounds for Concurrent Bounded Queues. PPoPP Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov
2024	B	`conf`	Practical Hardware Transactional vEB Trees. PPoPP Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov
2024	J	`jnl`	Skip Hash: A Fast Ordered Map Via Software Transactional Memory. CoRR Matthew Rodriguez, Vitaly Aksenov, Michael F. Spear
2024	—	`conf`	The Next 700 Benchmarking Frameworks for Concurrent Data Structures. ApPLIED@PODC Ravil Galiev, Michael F. Spear, Vitaly Aksenov
2024	—	`conf`	Toward Self-Adjusting $k$-Ary Search Tree Networks. IPDPS (Workshops) Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Stefan Schmid, Vitaly Aksenov
2024	A	`conf`	Toward Self-Adjusting k-Ary Search Tree Networks. ESA Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid
2024	—	`conf`	Trigram-Based Persistent IDE Indices with Quick Startup. IDE@ICSE Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov, Vyacheslav Lukianov, Nikita Zinoviev, Dmitry Ivanov, Vitaly Aksenov
2024	J	`jnl`	Trigram-Based Persistent IDE Indices with Quick Startup. CoRR Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov, Vyacheslav Lukianov, Nikita Zinoviev, Dmitry Ivanov, Vitaly Aksenov
2024	A	`conf`	Wait-free Trees with Asymptotically-Efficient Range Queries. IPDPS Ilya Kokorin, Victor Yudov, Vitaly Aksenov, Dan Alistarh
2023	J	`jnl`	Benchmark Framework with Skewed Workloads. CoRR Vitaly Aksenov, Dmitry Ivanov, Ravil Galiev
2023	A	`conf`	Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. DISC Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear
2023	J	`jnl`	Efficient Self-Adjusting Search Trees via Lazy Updates. CoRR Alexander Slastin, Dan Alistarh, Vitaly Aksenov
2023	J	`jnl`	On the Complexity of the Virtual Network Embedding in Specific Tree Topologies. CoRR Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
2023	B	`conf`	Parallel-Batched Interpolation Search Tree. PaCT Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
2023	J	`jnl`	Parallel-batched Interpolation Search Tree. CoRR Ilya Kokorin, Vitaly Aksenov, Alena Martsenyuk
2023	B	`conf`	Self-adjusting Linear Networks with Ladder Demand Graph. SIROCCO Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid
2023	J	`jnl`	The splay-list: a distribution-adaptive concurrent skip-list. Distributed Comput. Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
2023	J	`jnl`	Toward Self-Adjusting k-ary Search Tree Networks. CoRR Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov
2023	B	`conf`	Unexpected Scaling in Path Copying Trees. PPoPP Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin
2023	J	`jnl`	Wait-free Trees with Asymptotically-Efficient Range Queries. CoRR Ilya Kokorin, Dan Alistarh, Vitaly Aksenov
2022	A*	`conf`	Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. INFOCOM Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
2022	J	`jnl`	Self-Adjusting Linear Networks with Ladder Demand Graph. CoRR Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov
2022	J	`jnl`	Unexpected Scaling in Path Copying Trees. CoRR Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov
2021	B	`conf`	Execution of NVRAM Programs with Persistent Stack. PaCT Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky
2021	J	`jnl`	Execution of NVRAM Programs with Persistent Stack. CoRR Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky
2021	J	`jnl`	Memory-Optimality for Non-Blocking Containers. CoRR Vitaly Aksenov, Nikita Koval, Petr Kuznetsov
2021	B	`conf`	Optimal Concurrency for List-Based Sets. PaCT Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi
2021	J	`jnl`	Overview of Bachelors Theses 2021. CoRR Vitaly Aksenov
2021	J	`jnl`	Parallel Batched Interpolation Search Tree. CoRR Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
2021	J	`jnl`	Peformance Prediction for Coarse-Grained Locking: MCS Case. CoRR Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov
2021	B	`conf`	Toward Self-Adjusting Networks for the Matching Model. SPAA Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
2020	J	`jnl`	Relaxed Scheduling for Scalable Belief Propagation. CoRR Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
2020	B	`conf`	Restricted memory-friendly lock-free bounded queues. PPoPP Nikita Koval, Vitaly Aksenov
2020	J	`jnl`	Review of the Hydra Conference on Concurrent and Distributed Computing Hydra 2020. SIGACT News Vitaly Aksenov, Alexey Fyodorov
2020	J	`jnl`	Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. SIGACT News Vitaly Aksenov, Petr Kuznetsov
2020	A*	`conf`	Scalable Belief Propagation via Relaxed Scheduling. NeurIPS Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
2020	A	`conf`	The Splay-List: A Distribution-Adaptive Concurrent Skip-List. DISC Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
2020	J	`jnl`	The Splay-List: A Distribution-Adaptive Concurrent Skip-List. CoRR Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
2019	J	`jnl`	Performance Prediction for Coarse-Grained Locking. CoRR Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
2019	J	`jnl`	PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. CoRR Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh
2019	B	`conf`	Provably and practically efficient granularity control. PPoPP Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey
2019	J	`jnl`	Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinform. Sergey Aganezov, Ilya Zban, Vitaly Aksenov, Nikita Alexeev, Michael C. Schatz
2018	A*	`conf`	Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
2018	—	`conf`	On Helping and Stacks. NETYS Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
2018	B	`conf`	Parallel Combining: Benefits of Explicit Synchronization. OPODIS Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
2018	B	`conf`	Performance challenges in modular parallel programs. PPoPP Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey
2018	—	`—`	Synchronization Costs in Parallel Programs and Concurrent Data Structures. (Coûts de Synchronization dans les Programmes Parallèles et les Structures de Donnèes Simultanées). Vitaly Aksenov
2017	—	`conf`	A Concurrency-Optimal Binary Search Tree. Euro-Par Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
2017	J	`jnl`	A Concurrency-Optimal Binary Search Tree. CoRR Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
2017	B	`conf`	Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA Umut A. Acar, Vitaly Aksenov, Sam Westrick
2017	J	`jnl`	Flat Parallelization. CoRR Vitaly Aksenov, Petr Kuznetsov
2017	J	`jnl`	Parallel Combining: Making Use of Free Cycles. CoRR Vitaly Aksenov, Petr Kuznetsov