Koval, N., Alistarh, D.-A., &; Elizarov, R. (2023). Fast and scalable channels in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada: Association for Computing Machinery.https://doi.org/10.1145/3572848.3577481 

Koval, N., Khalanskiy, D., &; Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery .https://doi.org/10.1145/3591230 

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 

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 

Postnikova, A., Koval, N., Nadiradze, G., &; Alistarh, D.-A. (2022). 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 (pp. 353–367). Seoul, Republic of Korea: Association for Computing Machinery.https://doi.org/10.1145/3503221.3508432 

Postnikova, A., Koval, N., Nadiradze, G., &; Alistarh, D.-A. (2022). Multi-queues can be state-of-the-art priority schedulers. Zenodo.https://doi.org/10.5281/ZENODO.5733408 

Alistarh, D.-A., Fedorov, A., &; Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 

Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., &; Tsitelov, D. (2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (pp. 423–424). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3332466.3374503 

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2019). Lock-free channels for programming via communicating sequential processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (pp. 417–418). Washington, NY, United States: ACM Press.https://doi.org/10.1145/3293883.3297000 

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2019). Scalable FIFO channels for programming via communicating sequential processes. In 25th Anniversary of Euro-Par (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-29400-7_23 

Alistarh, D.-A., Nadiradze, G., &; Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM Press.https://doi.org/10.1145/3323165.3323201