Аксенов Виталий Евгеньевич

Статья

Feder E., Paramonov A., Mavrin P., Salem I., Schmid S., Aksenov V. Toward Self-Adjusting k-Ary Search Tree Networks. 2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 2024. pp. 1209-1211.

Статья

Kokorin I., Yudov V., Aksenov V., Alistarh D. Wait-free Trees with Asymptotically-Efficient Range Queries. 2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 2024. pp. 169-179.

Статья

Feder E., Paramonov A., Mavrin P., Salem I., Aksenov V., Schmid S. Toward Self-Adjusting k-Ary Search Tree Networks. Leibniz International Proceedings in Informatics, LIPIcs. 2024. Vol. 308. pp. 52.

Статья

Iakovlev Z., Chulkov A., Golikov N., Lukianov V., Zinoviev N., Ivanov D., Aksenov V. Trigram-Based Persistent IDE Indices with Quick Startup. IDE '24: Proceedings of the 1st ACM/IEEE Workshop on Integrated Development Environments. 2024. pp. 81-90.

Статья

Khalaji M., Brown T., Daudjee K., Aksenov V. Practical Hardware Transactional vEB Trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. 2024. pp. 215-228.

Статья

Galiev R., Spear M., Aksenov V. The Next 700 Benchmarking Frameworks for Concurrent Data Structures. Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed Systems, ApPLIED 2024. 2024. pp. 1-9.

Статья

Aksenov V., Paramonov A., Salem I., Schmid S. Self-adjusting Linear Networks with Ladder Demand Graph. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2023. Vol. 13892. pp. 132-148.

Статья

Aksenov V., Alistarh D., Drozdova A., Mohtashami A. The splay-list: a distribution-adaptive concurrent skip-list. Distributed Computing. 2023. Vol. 36. No. 3. pp. 395-418.

Учебник, учебное пособие

Региональная студенческая математическая олимпиада Санкт-Петербурга 2023

Статья

Aksenov V., Anoprenko M., Fedorov A., Spear M. Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. Leibniz International Proceedings in Informatics, LIPIcs. 2023. Vol. 281. pp. 35.

Статья

Aksenov V., Brown T., Fedorov A., Kokorin I. Unexpected Scaling in Path Copying Trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. 2023. pp. 438-440.

Статья

Фокин Г., Григорьев В.В., Аксенов В.Е. Технология сетевого позиционирования LTE Часть 2. Форматы оценок координат. Первая миля. 2022. № 7(107). С. 60-71.

Учебник, учебное пособие

Региональная студенческая математическая олимпиада Санкт-Петербурга 2022

Статья

Feder E., Rathod I., Shyamsukha P., Sama R., Aksenov V., Salem I., Schmid S. Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. 41st IEEE Conference on Computer Communications, INFOCOM 2022. 2022. pp. 1089-1098.

Статья

Aksenov V., Gramoli V., Kuznetsov P., Shang D., Ravi S. Optimal Concurrency for List-Based Sets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2021. Vol. 12942. pp. 386-401.

Статья

Aksenov V., Ben-Baruch O., Hendler D., Kokorin I., Rusanovsky M. Execution of NVRAM Programs with Persistent Stack. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2021. Vol. 12942. pp. 117-131.

Статья

Feder E., Rathod I., Shyamsukha P., Sama R., Aksenov V., Salem I., Schmid S. Brief Announcement: Toward Self-Adjusting Networks for the Matching Model. Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2021. pp. 429-431.

Статья

Koval N., Aksenov V. Restricted memory-friendly lock-free bounded queues. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. 2020. pp. 433-434.

Статья

Aksenov V., Alistarh D., Drozdova A., Mohtashami A. The Splay-List: A Distribution-Adaptive Concurrent Skip-List. Leibniz International Proceedings in Informatics, LIPIcs. 2020. Vol. 179. pp. 3:1-3:18.

Статья

Aksenov V.E., Alistarh D., Korhonen J. Relaxed Scheduling for Scalable Belief Propagation. Advances in Neural Information Processing Systems. 2020. pp. 1-12.

Статья

Aganezov S., Zban I., Aksenov V., Alexeev N.V., Schatz M.C. Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics. 2019. Vol. 20. pp. 641.

Статья

Aksenov V.E., Kuznetsov P., Shalyto A.A. On Helping and Stacks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2019. Vol. 11028. pp. 107-121.

Статья

Aksenov V., Kuznetsov P., Shalyto A.A. Parallel combining: Benefits of explicit synchronization. Leibniz International Proceedings in Informatics, LIPIcs. 2019. pp. 11.

Статья

Acar U.A., Aksenov V., Chargueraud A., Rainey M. Provably and practically efficient granularity control. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. 2019. pp. 214-228.

Статья

Acar U.A., Aksenov V.E., Chargueraud A., Rainey M. Performance challenges in modular parallel programs. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. 2018. pp. 381-382.

Статья

Acar U.A., Aksenov V., Chargueraud A., Rainey M. Performance challenges in modular parallel programs. ACM SIGPLAN Notices. 2018. Vol. 53. No. 1. pp. 381-382.

Учебник, учебное пособие

Региональная студенческая математическая олимпиада Санкт-Петербурга 2018 г.

Статья

Aksenov V.E., Alistarh D., Kuznetsov P. Brief Announcement: Performance Prediction for Coarse-Grained Locking. 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018. 2018. pp. 411-413.

Тезисы

Science in a Competitive Format

Тезисы

Восстановление геномных последовательностей особей по чтениям метагенома

Статья

Aksenov V.E., Gramoli V., Kuznetsov P., Malova A., Ravi S. A Concurrency-Optimal Binary Search Tree. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. Vol. 10417. pp. 580-593.

Статья

Acar U.A., Aksenov V.E., Westrick S. Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2017. Vol. Part F129316. pp. 275-277.

Статья

Aksenov V.E., Kokhas K.P. Calculation of Pfaffians by a Chip Removal. Journal of Mathematical Sciences. 2016. Vol. 215. No. 6. pp. 631-648.

Тезисы

Режим неизвестности при решении задачи гранулярности методом оракула

Статья

Aksenov V.E., Kokhas K.P. Chip Removal. Urban Renewal Revisited. Journal of Mathematical Sciences. 2015. Vol. 209. No. 6. pp. 809-825.

Статья

Аксенов В.Е., Кохась К.П. Удаление чипов. Urban Renewal revisited. Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН. 2015. Т. 432. С. 5-29.

Статья

Аксенов В.Е., Кохась К.П. Удаление чипов при подсчете пфаффианов. Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН. 2015. Т. 436. С. 5-33.

Статья

Aksenov V., Kokhas K. Domino Tilings and Determinants. Journal of Mathematical Sciences. 2014. Vol. 200. No. 6. pp. 647-653.

Статья

Аксенов В.Е., Кохась К.П. Разбиения на домино и определители. Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН. 2014. Т. 421. № 22. С. 5-18.

Тезисы

СВЯЗЬ МЕЖДУ КОМБИНАТОРНЫМИ ОБЪЕКТАМИ И ИХ АЛГЕБРАИЧЕСКИМИ ХАРАКТЕРИСТИКАМИ

Тезисы

Автоматизация генерации случайных тестов для олимпиадных задач по программированию

Тезисы

Автоматизация генерации случайных тестов для олимпиадных задач по программрованию