Nikita Koval

According to our database, Nikita Koval authored at least 17 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Memory Bounds for Concurrent Bounded Queues.

Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Testing Concurrent Algorithms on JVM with Lincheck and IntelliJ IDEA.

Aleksandr Potapov, Maksim Zuev, Evgenii Moiseenko, Nikita Koval

Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis, 2024

Understanding Concurrency Bugs in Real-World Programs with Kotlin Coroutines.

Bob Brockbernd, Nikita Koval, Arie van Deursen, Burcu Kulahcioglu Ozkan

Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023

CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.

Nikita Koval, Dmitry Khalanskiy, Dan Alistarh

Proc. ACM Program. Lang., 2023

The State-of-the-Art LCRQ Concurrent Queue Algorithm Does NOT Require CAS2.

Raed Romanov, Nikita Koval

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Fast and Scalable Channels in Kotlin Coroutines.

Nikita Koval, Dan Alistarh, Roman Elizarov

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.

Nikita Koval, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, Dan Alistarh

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Multi-queues can be state-of-the-art priority schedulers.

Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

2021

A Formally-Verified Framework for Fair Synchronization in Kotlin Coroutines.

Nikita Koval, Dmitry Khalanskiy, Dan Alistarh

CoRR, 2021

Memory-Optimality for Non-Blocking Containers.

Vitaly Aksenov, Nikita Koval, Petr Kuznetsov

CoRR, 2021

A Scalable Concurrent Algorithm for Dynamic Connectivity.

Alexander Fedorov, Nikita Koval, Dan Alistarh

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020

Testing concurrency on the JVM with lincheck.

Nikita Koval, Maria Sokolova, Alexander Fedorov, Dan Alistarh, Dmitry Tsitelov

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Restricted memory-friendly lock-free bounded queues.

Nikita Koval, Vitaly Aksenov

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

2019

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.

Dan Alistarh, Giorgi Nadiradze, Nikita Koval

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Lock-free channels for programming via communicating sequential processes: poster.

Nikita Koval, Dan Alistarh, Roman Elizarov

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

In Search of the Fastest Concurrent Union-Find Algorithm.

Dan Alistarh, Alexander Fedorov, Nikita Koval

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Scalable FIFO Channels for Programming via Communicating Sequential Processes.

Nikita Koval, Dan Alistarh, Roman Elizarov

Proceedings of the Euro-Par 2019: Parallel Processing, 2019