default search action
Nikita Koval
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Bob Brockbernd, Nikita Koval, Arie van Deursen, Burcu Kulahcioglu Ozkan:
Understanding Concurrency Bugs in Real-World Programs with Kotlin Coroutines. ECOOP 2024: 8:1-8:20 - [c13]Aleksandr Potapov
, Maksim Zuev
Testing Concurrent Algorithms on JVM with Lincheck and IntelliJ IDEA. ISSTA 2024: 1821-1825 - [c12]Vitaly Aksenov
Memory Bounds for Concurrent Bounded Queues. PPoPP 2024: 188-199 - 2023
- [j1]Nikita Koval
CQS: A Formally-Verified Framework for Fair and Abortable Synchronization. Proc. ACM Program. Lang. 7(PLDI): 244-266 (2023) - [c11]Nikita Koval, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, Dan Alistarh:
Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM. CAV (1) 2023: 156-169 - [c10]Raed Romanov, Nikita Koval:
The State-of-the-Art LCRQ Concurrent Queue Algorithm Does NOT Require CAS2. PPoPP 2023: 14-26 - [c9]Nikita Koval, Dan Alistarh, Roman Elizarov:
Fast and Scalable Channels in Kotlin Coroutines. PPoPP 2023: 107-118 - 2022
- [c8]Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh:
Multi-queues can be state-of-the-art priority schedulers. PPoPP 2022: 353-367 - [i7]Nikita Koval, Dan Alistarh, Roman Elizarov:
Fast and Scalable Channels in Kotlin Coroutines. CoRR abs/2211.04986 (2022) - 2021
- [c7]Alexander Fedorov
A Scalable Concurrent Algorithm for Dynamic Connectivity. SPAA 2021: 208-220 - [i6]Vitaly Aksenov, Nikita Koval, Petr Kuznetsov:
Memory-Optimality for Non-Blocking Containers. CoRR abs/2104.15003 (2021) - [i5]Alexander Fedorov, Nikita Koval, Dan Alistarh:
A Scalable Concurrent Algorithm for Dynamic Connectivity. CoRR abs/2105.08098 (2021) - [i4]Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh:
Multi-Queues Can Be State-of-the-Art Priority Schedulers. CoRR abs/2109.00657 (2021) - [i3]Nikita Koval, Dmitry Khalanskiy, Dan Alistarh:
A Formally-Verified Framework for Fair Synchronization in Kotlin Coroutines. CoRR abs/2111.12682 (2021) - 2020
- [c6]Nikita Koval, Maria Sokolova, Alexander Fedorov
Testing concurrency on the JVM with lincheck. PPoPP 2020: 423-424 - [c5]Nikita Koval, Vitaly Aksenov
Restricted memory-friendly lock-free bounded queues. PPoPP 2020: 433-434 - [i2]Dan Alistarh, Nikita Koval, Giorgi Nadiradze:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. CoRR abs/2003.09363 (2020)
2010 – 2019
- 2019
- [c4]Nikita Koval, Dan Alistarh, Roman Elizarov:
Scalable FIFO Channels for Programming via Communicating Sequential Processes. Euro-Par 2019: 317-333 - [c3]Dan Alistarh, Alexander Fedorov
In Search of the Fastest Concurrent Union-Find Algorithm. OPODIS 2019: 15:1-15:16 - [c2]Nikita Koval, Dan Alistarh, Roman Elizarov:
Lock-free channels for programming via communicating sequential processes: poster. PPoPP 2019: 417-418 - [c1]Dan Alistarh, Giorgi Nadiradze, Nikita Koval:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. SPAA 2019: 145-154 - [i1]Dan Alistarh, Alexander Fedorov, Nikita Koval:
In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs/1911.06347 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: