5 Publications

Mark all

[5]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 423–424.
View | DOI
 
[3]
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
View | DOI
 
[2]
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI
 
[1]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

5 Publications

Mark all

[5]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 423–424.
View | DOI
 
[3]
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
View | DOI
 
[2]
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI
 
[1]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications