default search action
Vitaly Aksenov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Ravil Galiev
, Michael F. Spear
The Next 700 Benchmarking Frameworks for Concurrent Data Structures. ApPLIED@PODC 2024: 1-9 - [c24]Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid:
Toward Self-Adjusting k-Ary Search Tree Networks. ESA 2024: 52:1-52:15 - [c23]Zakhar Iakovlev
Trigram-Based Persistent IDE Indices with Quick Startup. IDE@ICSE 2024: 81-90 - [c22]Ilya Kokorin, Victor Yudov, Vitaly Aksenov
Wait-free Trees with Asymptotically-Efficient Range Queries. IPDPS 2024: 169-179 - [c21]Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Stefan Schmid, Vitaly Aksenov
Toward Self-Adjusting $k$-Ary Search Tree Networks. IPDPS (Workshops) 2024: 1209-1211 - [c20]Vitaly Aksenov
Memory Bounds for Concurrent Bounded Queues. PPoPP 2024: 188-199 - [c19]Mohammad Khalaji
Practical Hardware Transactional vEB Trees. PPoPP 2024: 215-228 - [i24]Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
In the Search of Optimal Tree Networks: Hardness and Heuristics. CoRR abs/2403.03724 (2024) - [i23]Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov, Vyacheslav Lukianov, Nikita Zinoviev, Dmitry Ivanov, Vitaly Aksenov:
Trigram-Based Persistent IDE Indices with Quick Startup. CoRR abs/2403.03751 (2024) - [i22]Enrico Lopedoto, Maksim Shekhunov, Vitaly Aksenov, Kizito Salako, Tillman Weyde:
Derivative-based regularization for regression. CoRR abs/2405.00555 (2024) - [i21]Matthew Rodriguez, Vitaly Aksenov, Michael F. Spear:
Skip Hash: A Fast Ordered Map Via Software Transactional Memory. CoRR abs/2410.07466 (2024) - 2023
- [j4]Vitaly Aksenov
The splay-list: a distribution-adaptive concurrent skip-list. Distributed Comput. 36(3): 395-418 (2023) - [c18]Vitaly Aksenov
Parallel-Batched Interpolation Search Tree. PaCT 2023: 109-125 - [c17]Vitaly Aksenov
Unexpected Scaling in Path Copying Trees. PPoPP 2023: 438-440 - [c16]Vitaly Aksenov
Self-adjusting Linear Networks with Ladder Demand Graph. SIROCCO 2023: 132-148 - [c15]Vitaly Aksenov
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. DISC 2023: 35:1-35:7 - [i20]Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov:
Toward Self-Adjusting k-ary Search Tree Networks. CoRR abs/2302.13113 (2023) - [i19]Vitaly Aksenov, Dmitry Ivanov, Ravil Galiev:
Benchmark Framework with Skewed Workloads. CoRR abs/2305.10872 (2023) - [i18]Ilya Kokorin, Vitaly Aksenov, Alena Martsenyuk:
Parallel-batched Interpolation Search Tree. CoRR abs/2306.13785 (2023) - [i17]Ilya Kokorin, Dan Alistarh, Vitaly Aksenov:
Wait-free Trees with Asymptotically-Efficient Range Queries. CoRR abs/2310.05293 (2023) - [i16]Alexander Slastin, Dan Alistarh, Vitaly Aksenov:
Efficient Self-Adjusting Search Trees via Lazy Updates. CoRR abs/2310.05298 (2023) - [i15]Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
On the Complexity of the Virtual Network Embedding in Specific Tree Topologies. CoRR abs/2311.05474 (2023) - 2022
- [c14]Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. INFOCOM 2022: 1089-1098 - [i14]Anton Paramonov, Iosif Salem
Self-Adjusting Linear Networks with Ladder Demand Graph. CoRR abs/2207.03948 (2022) - [i13]Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov:
Unexpected Scaling in Path Copying Trees. CoRR abs/2212.00521 (2022) - 2021
- [c13]Vitaly Aksenov
Execution of NVRAM Programs with Persistent Stack. PaCT 2021: 117-131 - [c12]Vitaly Aksenov
Optimal Concurrency for List-Based Sets. PaCT 2021: 386-401 - [c11]Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov
Toward Self-Adjusting Networks for the Matching Model. SPAA 2021: 429-431 - [i12]Vitaly Aksenov, Nikita Koval, Petr Kuznetsov:
Memory-Optimality for Non-Blocking Containers. CoRR abs/2104.15003 (2021) - [i11]Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky:
Execution of NVRAM Programs with Persistent Stack. CoRR abs/2105.11932 (2021) - [i10]Vitaly Aksenov:
Overview of Bachelors Theses 2021. CoRR abs/2107.12332 (2021) - [i9]Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk:
Parallel Batched Interpolation Search Tree. CoRR abs/2110.05540 (2021) - [i8]Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov:
Peformance Prediction for Coarse-Grained Locking: MCS Case. CoRR abs/2110.05545 (2021) - 2020
- [j3]Vitaly Aksenov, Petr Kuznetsov:
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. SIGACT News 51(4): 82-84 (2020) - [j2]Vitaly Aksenov, Alexey Fyodorov:
Review of the Hydra Conference on Concurrent and Distributed Computing Hydra 2020. SIGACT News 51(4): 85-88 (2020) - [c10]Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen:
Scalable Belief Propagation via Relaxed Scheduling. NeurIPS 2020 - [c9]Nikita Koval, Vitaly Aksenov
Restricted memory-friendly lock-free bounded queues. PPoPP 2020: 433-434 - [c8]Vitaly Aksenov
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. DISC 2020: 3:1-3:18 - [i7]Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen:
Relaxed Scheduling for Scalable Belief Propagation. CoRR abs/2002.11505 (2020) - [i6]Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami:
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. CoRR abs/2008.01009 (2020)
2010 – 2019
- 2019
- [j1]Sergey Aganezov, Ilya Zban, Vitaly Aksenov
Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinform. 20-S(20): 641 (2019) - [c7]Umut A. Acar, Vitaly Aksenov
Provably and practically efficient granularity control. PPoPP 2019: 214-228 - [i5]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Performance Prediction for Coarse-Grained Locking. CoRR abs/1904.11323 (2019) - [i4]Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh:
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. CoRR abs/1910.12308 (2019) - 2018
- [b1]Vitaly Aksenov:
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). ITMO University, Saint Petersburg, Russia, 2018 - [c6]Vitaly Aksenov
On Helping and Stacks. NETYS 2018: 107-121 - [c5]Vitaly Aksenov
Parallel Combining: Benefits of Explicit Synchronization. OPODIS 2018: 11:1-11:16 - [c4]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC 2018: 411-413 - [c3]Umut A. Acar, Vitaly Aksenov
Performance challenges in modular parallel programs. PPoPP 2018: 381-382 - 2017
- [c2]Vitaly Aksenov
A Concurrency-Optimal Binary Search Tree. Euro-Par 2017: 580-593 - [c1]Umut A. Acar, Vitaly Aksenov
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA 2017: 275-277 - [i3]Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi:
A Concurrency-Optimal Binary Search Tree. CoRR abs/1702.04441 (2017) - [i2]Vitaly Aksenov, Petr Kuznetsov:
Flat Parallelization. CoRR abs/1705.02851 (2017) - [i1]Vitaly Aksenov, Petr Kuznetsov:
Parallel Combining: Making Use of Free Cycles. CoRR abs/1710.07588 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: