11 Publications

Mark all

[11]
2023 | Conference Paper | IST-REx-ID: 12735 | OA
N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2023 | Journal Article | IST-REx-ID: 13179 | OA
N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery , 2023.
[Published Version] View | Files available | DOI
 
[9]
2023 | Conference Paper | IST-REx-ID: 14260 | OA
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 156–169.
[Published Version] View | Files available | DOI
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “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, Seoul, Republic of Korea, 2022, pp. 353–367.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers.” Zenodo, 2022.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 7635
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
View | DOI
 
[3]
2019 | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI | WoS
 
[2]
2019 | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in 25th Anniversary of Euro-Par, Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI | WoS
 
[1]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

11 Publications

Mark all

[11]
2023 | Conference Paper | IST-REx-ID: 12735 | OA
N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2023 | Journal Article | IST-REx-ID: 13179 | OA
N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery , 2023.
[Published Version] View | Files available | DOI
 
[9]
2023 | Conference Paper | IST-REx-ID: 14260 | OA
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 156–169.
[Published Version] View | Files available | DOI
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “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, Seoul, Republic of Korea, 2022, pp. 353–367.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers.” Zenodo, 2022.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 7635
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
View | DOI
 
[3]
2019 | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI | WoS
 
[2]
2019 | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in 25th Anniversary of Euro-Par, Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI | WoS
 
[1]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications