Alexander Fedorov
Graduate School
Alistarh Group
5 Publications
2023 | Conference Poster | IST-REx-ID: 12736 | 
Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512
[Published Version]
View
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 14485 |
Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35
[Published Version]
View
| Files available
| DOI
2023 | Conference Paper | IST-REx-ID: 14260 |
Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_8
[Published Version]
View
| Files available
| DOI
2023 | Research Data Reference | IST-REx-ID: 14995 |
Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo. https://doi.org/10.5281/ZENODO.7877757
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 13262 |
Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082
[Published Version]
View
| Files available
| DOI
| arXiv
5 Publications
2023 | Conference Poster | IST-REx-ID: 12736 |
Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512
[Published Version]
View
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 14485 |
Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35
[Published Version]
View
| Files available
| DOI
2023 | Conference Paper | IST-REx-ID: 14260 |
Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_8
[Published Version]
View
| Files available
| DOI
2023 | Research Data Reference | IST-REx-ID: 14995 |
Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo. https://doi.org/10.5281/ZENODO.7877757
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 13262 |
Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082
[Published Version]
View
| Files available
| DOI
| arXiv