| In search of the fastest concurrent union-find algorithm D Alistarh, A Fedorov, N Koval arXiv preprint arXiv:1911.06347, 2019 | 6 | 2019 |
| Path planning for UAV search using growing area algorithm and clustering A Fedorov Fourth Conference on Software Engineering and Information Management, 20-24, 2019 | 5 | 2019 |
| Testing concurrency on the JVM with lincheck N Koval, M Sokolova, A Fedorov, D Alistarh, D Tsitelov Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of …, 2020 | 4 | 2020 |
| Lincheck: A practical framework for testing concurrent data structures on JVM N Koval, A Fedorov, M Sokolova, D Tsitelov, D Alistarh International Conference on Computer Aided Verification, 156-169, 2023 | 3 | 2023 |
| Unexpected scaling in path copying trees V Aksenov, T Brown, A Fedorov, I Kokorin Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and …, 2023 | 1 | 2023 |
| A scalable concurrent algorithm for dynamic connectivity A Fedorov, N Koval, D Alistarh Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 1 | 2021 |
| Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures V Aksenov, M Anoprenko, A Fedorov, M Spear Leibniz International Proceedings in Informatics 281, 35, 2023 | | 2023 |
| Provably-Efficient and Internally-Deterministic Parallel Union-Find A Fedorov, D Hashemi, G Nadiradze, D Alistarh Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | | 2023 |
| Unexpected Scaling in Path Copying Trees I Kokorin, A Fedorov, T Brown, V Aksenov arXiv preprint arXiv:2212.00521, 2022 | | 2022 |
