Научные руководители
 |
Аксенов Виталий ЕвгеньевичPhD, науки aksenov@itmo.ru Структурное подразделение: институт прикладных компьютерных наук Должность: доцент (квалификационная категория "ординарный доцент") Профиль: 05.13.18 - Математическое моделирование, численные методы и комплексы программ 05.13.10 - Управление в социальных и экономических системах 05.13.11 - Математическое и программное обеспечение вычислительных машин, комплексов и компьютерных сетей 05.13.17 - Теоретические основы информатики 2.3.5. - Математическое и программное обеспечение вычислительных систем, комплексов и компьютерных сетей 2.3.8. - Информатика и информационные процессы 1.2.2. - Математическое моделирование, численные методы и комплексы программ 1.2.3. - Теоретическая информатика, кибернетика 2.3.4. - Управление в организационных системах Область интересов: Решение задачи гранулярности; олимпиадное программирование, виртуальные машины, многопоточный код. Рабочий язык: Английский, Русский |
Публикации руководителя
| Выходные данные | Год | Индексирование в БД |
| 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 | 2024 | Scopus |
| 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 | 2023 | Scopus, Web of Science |
| 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 | 2023 | Scopus, Web of Science |
| 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 | Scopus, Web of Science, Белый список |
| 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 | 2023 | Scopus, Web of Science |
| Фокин Г., Григорьев В.В., Аксенов В.Е. Технология сетевого позиционирования 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 | 2022 | Scopus, Web of Science |
| 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 | 2021 | Scopus |
| 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 | 2021 | Scopus, Web of Science |
| 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 | 2021 | Scopus, Web of Science |
| Aksenov V.E., Alistarh D., Korhonen J. Relaxed Scheduling for Scalable Belief Propagation//Advances in Neural Information Processing Systems, 2020, pp. 1-12 | 2020 | Scopus, Web of Science |
| 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 | 2020 | Scopus |
| 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 | 2020 | Scopus, Web of Science |
| 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 | 2019 | Scopus, Web of Science |
| 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 | 2019 | Scopus, Web of Science |
| 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 | 2019 | Scopus, Web of Science |
| Aksenov V., Kuznetsov P., Shalyto A.A. Parallel combining: Benefits of explicit synchronization//Leibniz International Proceedings in Informatics, LIPIcs, 2019, pp. 11 | 2019 | Scopus |
| 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 | 2018 | Scopus, Web of Science |
| 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 | 2018 | Scopus, Web of Science |
| 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 | Web of Science |
| 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 | 2017 | Scopus, Web of Science |
| 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 | 2017 | Scopus, Web of Science |
| 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 | 2016 | Scopus |
| Aksenov V.E., Kokhas K.P. Chip Removal. Urban Renewal Revisited//Journal of Mathematical Sciences, 2015, Vol. 209, No. 6, pp. 809-825 | 2015 | Scopus |
| Аксенов В.Е., Кохась К.П. Удаление чипов. Urban Renewal revisited // Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН -2015. - Т. 432. - С. 5-29 | 2015 | ВАК |
| Аксенов В.Е., Кохась К.П. Удаление чипов при подсчете пфаффианов // Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН -2015. - Т. 436. - С. 5-33 | 2015 | ВАК |
| Аксенов В.Е., Кохась К.П. Разбиения на домино и определители // Записки научных семинаров Санкт-Петербургского отделения Математического института им. В.А.Стеклова РАН -2014. - Т. 421. - № 22. - С. 5-18 | 2014 | ВАК, РИНЦ |
| Aksenov V., Kokhas K. Domino Tilings and Determinants//Journal of Mathematical Sciences, 2014, Vol. 200, No. 6, pp. 647-653 | 2014 | Scopus |