| 2024 | ECOOP | Understanding Concurrency Bugs in Real-World Programs with Kotlin Coroutines. | Bob Brockbernd, Nikita Koval, Arie van Deursen, Burcu Kulahcioglu Ozkan |
| 2024 | ISSTA | Testing Concurrent Algorithms on JVM with Lincheck and IntelliJ IDEA. | Aleksandr Potapov, Maksim Zuev, Evgenii Moiseenko, Nikita Koval |
| 2024 | PPoPP | Memory Bounds for Concurrent Bounded Queues. | Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov |
| 2023 | CAV | Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM. | Nikita Koval, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, Dan Alistarh |
| 2023 | PPoPP | Fast and Scalable Channels in Kotlin Coroutines. | Nikita Koval, Dan Alistarh, Roman Elizarov |
| 2023 | PPoPP | The State-of-the-Art LCRQ Concurrent Queue Algorithm Does NOT Require CAS2. | Raed Romanov, Nikita Koval |
| 2022 | PPoPP | Multi-queues can be state-of-the-art priority schedulers. | Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh |
| 2021 | SPAA | A Scalable Concurrent Algorithm for Dynamic Connectivity. | Alexander Fedorov, Nikita Koval, Dan Alistarh |
| 2020 | PPoPP | Restricted memory-friendly lock-free bounded queues. | Nikita Koval, Vitaly Aksenov |
| 2020 | PPoPP | Testing concurrency on the JVM with lincheck. | Nikita Koval, Maria Sokolova, Alexander Fedorov, Dan Alistarh, Dmitry Tsitelov |
| 2019 | EuroPar | Scalable FIFO Channels for Programming via Communicating Sequential Processes. | Nikita Koval, Dan Alistarh, Roman Elizarov |
| 2019 | OPODIS | In Search of the Fastest Concurrent Union-Find Algorithm. | Dan Alistarh, Alexander Fedorov, Nikita Koval |
| 2019 | PPoPP | Lock-free channels for programming via communicating sequential processes: poster. | Nikita Koval, Dan Alistarh, Roman Elizarov |
| 2019 | SPAA | Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. | Dan Alistarh, Giorgi Nadiradze, Nikita Koval |