Laboratoire de programmation concurrente

← Revenir au laboratoire

Publications

2023
Nikita Koval, Dmitry Khalanskiy, Dan Alistarh

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

PLDI 2023 : 244-266 (2023)

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

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

CAV 2023: 156-169

2023
Raed Romanov, Nikita Koval

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

PPoPP 2023: 14-26

2023
Nikita Koval, Dan Alistarh, Roman Elizarov

Fast and Scalable Channels in Kotlin Coroutines

PPoPP 2023: 107-118

2023
Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh

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

PPoPP 2022: 353-367

2021
Alexander Fedorov, Nikita Koval, Dan Alistarh:

A Scalable Concurrent Algorithm for Dynamic Connectivity

SPAA 2021: 208-220

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

Testing concurrency on the JVM with lincheck

PPoPP 2020: 423-424

2020
Nikita Koval, Vitaly Aksenov

Restricted memory-friendly lock-free bounded queues

PPoPP 2020: 433-434

2019
Nikita Koval, Dan Alistarh, Roman Elizarov

Scalable FIFO Channels for Programming via Communicating Sequential Processes

Euro-Par 2019: 317-333

2019
Dan Alistarh, Alexander Fedorov

In Search of the Fastest Concurrent Union-Find Algorithm

OPODIS 2019: 15:1-15:16

2019
Nikita Koval, Dan Alistarh, Roman Elizarov

POSTER: Lock-free channels for programming via communicating sequential processes

PPoPP 2019: 417-418

2019
Dan Alistarh, Giorgi Nadiradze, Nikita Koval

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers

SPAA 2019: 145-154