 |
Vitaly AksenovAssistant Professor [cv] [github]Affiliations: ITMO University Former Affiliations: PhD Position, INRIA Paris; Post-doc, IST Austria. Phone: +7-951-662-33-99 E-mail: aksenov [@] itmo [.] ru Research interests: Parallel algorithms, Concurrent data structures, Graph algorithms, Bioinformatics and Combinatorics |
2021 |
|
|
V. Aksenov, V. Gramoli, P. Kuznetsov, D. Shang, S. Ravi. Optimal Concurrency for List-Based Sets. PaCT 2021.
[pdf] V. Aksenov, O. Ben-Baruch, D. Hendler, I. Kokorin, M. Rusanovsky. Execution of NVRAM Programs with Persistent Stack. PaCT 2021. [pdf] E. Feder, I. Rathod, P. Shyamsukha, R. Sama, V. Aksenov, I. Salem, S. Schmid. Brief-Announcement: Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. SPAA 2021. [pdf] A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D. Alistarh, D. M. Roy. NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization. JMLR. [html] |
|
2020 |
|
|
V. Aksenov, D. Alistarh, J. Korhonen. Scalable Belief Propagationvia Relaxed Scheduling. NeurIPS 2020.
[pdf] V. Aksenov, D. Alistarh, A. Drozdova, A. Mohtashami. The Splay-List: A Distribution-Adaptive Concurrent Skip-List. DISC 2020. [pdf] N. Koval, V. Aksenov. Restricted memory-friendly lock-free bounded queues (Poster). PPoPP 2020. [pdf] [poster] |
|
2019 |
|
|
S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M. C. Schatz.
Recovering Rearranged Cancer Chromosomes from Karyotype Graphs. RECOMB-CG 2019.
[pdf] U. Acar, V. Aksenov, A. Chargueraud, M. Rainey. Provably and Practically Efficient Granularity Control. PPoPP 2019. [pdf] |
|
2018 |
|
|
V. Aksenov, P. Kuznetsov, A. Shalyto. Parallel Combining: Benefits of Explicit Synchronization OPODIS 2018.
[pdf] [slides] V. Aksenov, D. Alistarh, P. Kuznetsov. Brief-Announcement: Performance Prediction for Coarse-Grained Locking. PODC 2018. [pdf] [slides] V. Aksenov, P. Kuznetsov, A. Shalyto. On Helping and Stacks. NETYS 2018. [pdf] [slides] U. Acar, V. Aksenov, A. Chargueraud, M. Rainey. Performance Challenges in Modular Parallel Programs (Poster). PPoPP 2018. [pdf] [poster] |
|
2017 |
|
|
V. Aksenov, V. Gramoli, P. Kuznetsov, A. Malova, S. Ravi. A Concurrency-Optimal Binary Search Tree. Euro-Par 2017.
[pdf] [slides] U. Acar, V. Aksenov, S. Westrick. Brief-Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA 2017. [pdf] [full] |
|
2016 |
|
| V. Aksenov, K. Kokhas. Calculation of Pfaffians by a Chip Removal. Journal of Mathematical Sciences, 2016. [pdf] | |
2015 |
|
| V. Aksenov, K. Kokhas. Chip removal. Urban Renewal Revisited. Journal of Mathematical Sciences, 2015. [pdf] | |
2014 |
|
| V. Aksenov, K. Kokhas. Domino Tilings and Determinants. Journal of Mathematical Sciences, 2014. [pdf] |
| Year | Student | Type | Diploma | Supervision |
2022 |
||||
| Evgeniy Feder | Masters | "Dynamic and Static Networks Based on Static Optimality" [pdf] | Stefan Schmid | |
| Ilya Kokorin | Masters | "Development of Concurrent Hierachical Data Structures with Efficient Range Queries" [pdf] | Dan Alistarh | |
| Anton Paramonov | Bachelors | "Self-Adjusting Linear Networks with Ladder Demand Graph" [pdf] | Stefan Schmid | |
| Andrew Tsutsiev | Bachelors | "Finding Optimal Implementations of Concurrent Data Structures" [pdf] | Petr Kuznetsov | |
2021 |
||||
| Alexandra Drozdova | Bachelors | "Self-adjusting Concurrent Data Structures" [pdf] | Dan Alistarh | |
| Oleg Fafurin | Bachelors | "Development of a Streaming Algorithm for the Decomposition of the Graph Metrics to Tree Metrics" [pdf, russian] | Mikhail Kapralov | |
| Roman Smirnov | Bachelors | "Development of Memory-friendly Concurrent Data Structures" [pdf, russian] | Petr Kuznetsov | |
| Daniil Bolotov | Bachelors | "Theoretical Analysis of the Performance of Concurrent Data Structures" [pdf, russian] | Petr Kuznetsov | |
| Alena Martsenyuk, MIPT | Bachelors | "Parallel Batched Interpolation Search Tree" [pdf, russian] | ||
| Vitalii Krasnov, MIPT | Bachelors | "Parallel Batched Self-adjusting Data Structures" [pdf, russian] | ||
| Ildar Zinatulin, MIPT | Bachelors | "Parallel Batched Persistent Binary Search Trees" [pdf, russian] | ||
2020 |
||||
| Evgeny Feder | Bachelors | "Self-adjusting Networks in Matching Model" [pdf] | Stefan Schmid and Iosif Salem | |
| Ilya Kokorin | Bachelors | "The research of basic algorithms and data structures for Non-volatile memory" [pdf, russian] | Danny Hendler, Ohad Ben-Baruch and Matan Rusanovsky |
2017 |
|
| Long session during autumn in Paris. http://neerc.ifmo.ru/trains/paris 1-week session in ETH Zurich. http://neerc.ifmo.ru/trains/zurich |
|
2016 |
|
| 1-week session in Toulouse. http://neerc.ifmo.ru/trains/toulouse/2016 | |
2015 |
|
| 1-week session in Lyon. http://perso.ens-lyon.fr/eric.thierry/WCPS2015 | |
2014 |
|
| 1-week session in Harbin. http://neerc.ifmo.ru/trains/harbin |
2021 |
||
| Program Committee of ICDCS 2021 | ||
| External Program Committee of PPoPP 2022 | ||
2019-2021 |
||
|
Program Committee of Hydra (An Industrial Distributed Computing Confrerence,
http://hydraconf.com) Program Committee of The Summer School on Practice and Theory of Distributed Computing (http://sptdc.ru) | ||
2017 |
||
| Co-organizer of The First Summer School on Practice and Theory of Concurrent Computing (http://neerc.ifmo.ru/sptcc) | ||
2017-... |
||
| Co-head of Jury of The Bioinformatics Contest (http://bioinf.me/contest) | ||
2016 |
||
| Host Scientific Committee of IOI in Kazan | ||
2012-... |
||
| Jury of NERC, qualification for ICPC World Finals (http://neerc.ifmo.ru) |