Nikita Koval

Graduate School

11 Publications

Mark all

[11]
2023 | Published | Conference Paper | IST-REx-ID: 12735 | OA
Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2023 | Published | Journal Article | IST-REx-ID: 13179 | OA
Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230
[Published Version] View | Files available | DOI
 
[9]
2023 | Published | Conference Paper | IST-REx-ID: 14260 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:156-169. doi:10.1007/978-3-031-37706-8_8
[Published Version] View | Files available | DOI
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:10.5281/ZENODO.7877757
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:10.5281/ZENODO.5733408
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[6]
2022 | Published | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2022:353-367. doi:10.1145/3503221.3508432
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2020 | Published | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15
[Published Version] View | Files available | DOI | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 7635
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503
View | DOI
 
[3]
2019 | Published | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
View | DOI | WoS
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: 25th Anniversary of Euro-Par. Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


11 Publications

Mark all

[11]
2023 | Published | Conference Paper | IST-REx-ID: 12735 | OA
Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2023 | Published | Journal Article | IST-REx-ID: 13179 | OA
Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230
[Published Version] View | Files available | DOI
 
[9]
2023 | Published | Conference Paper | IST-REx-ID: 14260 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:156-169. doi:10.1007/978-3-031-37706-8_8
[Published Version] View | Files available | DOI
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:10.5281/ZENODO.7877757
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:10.5281/ZENODO.5733408
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[6]
2022 | Published | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2022:353-367. doi:10.1145/3503221.3508432
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2020 | Published | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15
[Published Version] View | Files available | DOI | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 7635
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503
View | DOI
 
[3]
2019 | Published | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
View | DOI | WoS
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: 25th Anniversary of Euro-Par. Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed