Остановите войну!
for scientists:
default search action
Lyudmila Kovalchuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Yuri Bespalov, Lyudmila Kovalchuk, Hanna Nelasa, Roman Oliynykov, Rob Viglione:
Models for Generation of Proof Forest in zk-SNARK Based Sidechains. Cryptogr. 7(1): 14 (2023) - [c11]Lyudmila Kovalchuk, Mariia Rodinko, Roman Oliynykov:
Reputation-Based Incentive Model for Decentralized Analysis of Development Proposals. IDAACS 2023: 638-643 - 2022
- [c10]Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos, Roman Oliynykov:
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria. AFT 2022: 268-280 - [c9]Lyudmila Kovalchuk, Mariia Rodinko, Roman Oliynykov:
A Game-Theoretic Analysis of Delegation Incentives in Blockchain Governance. DPM/CBT@ESORICS 2022: 275-293 - [c8]Yuri Bespalov, Lyudmila Kovalchuk, Hanna Nelasa, Roman Oliynykov, Alberto Garoffolo:
Game theory analysis of incentive distribution for prompt generation of the proof tree in zk-SNARK based sidechains. ICCST 2022: 1-7 - [i1]Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos, Roman Oliynykov:
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria. CoRR abs/2202.04064 (2022) - 2021
- [j2]Mikolaj P. Karpinski, Lyudmila Kovalchuk, Roman V. Kochan, Roman Oliynykov, Mariia Rodinko, Lukasz Wieclaw:
Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus. Sensors 21(19): 6408 (2021) - [c7]Yuri Bespalov, Alberto Garoffolo, Lyudmila Kovalchuk, Hanna Nelasa, Roman Oliynykov:
Game-Theoretic View on Decentralized Proof Generation in zk-SNARK-based Sidechains. CPITS I 2021: 47-59 - [c6]Roman Kochana, Lyudmila Kovalchuk, Oleksandr Korchenko, Nataliia Kuchynska:
Statistical Tests Independence Verification Methods. KES 2021: 2678-2688 - 2020
- [j1]Lyudmila Kovalchuk, Dmytro Kaidalov, Andrii Nastenko, Mariia Rodinko, Oleksiy Shevtsov, Roman Oliynykov:
Decreasing security threshold against double spend attack in networks with slow synchronization. Comput. Commun. 154: 75-81 (2020) - [c5]Anatoly Bessalov, Lyudmila Kovalchuk, Volodymyr Sokolov, Pavlo Skladannyi, Tamara Radivilova:
Analysis of 2-Isogeny Properties of Generalized Form Edwards Curves. CPITS 2020: 1-13 - [c4]Lyudmila Kovalchuk, Mariia Rodinko, Roman Oliynykov:
Upper bound probability of double spend attack on SPECTRE. CryBlock@MOBICOM 2020: 18-22
2010 – 2019
- 2019
- [c3]Lyudmila Kovalchuk, Dmytro Kaidalov, Andrii Nastenko, Mariia Rodinko, Oleksiy Shevtsov, Roman Oliynykov:
Decreasing Security Threshold Against Double Spend Attack in Networks with Slow Synchronization. INFOCOM Workshops 2019: 216-221 - 2018
- [c2]Lyudmila Kovalchuk, Dmytro Kaidalov, Andrii Nastenko, Oleksiy Shevtsov, Mariia Rodinko, Roman Oliynykov:
Number of confirmation blocks for Bitcoin and GHOST consensus protocols on networks with delayed message delivery: Extended abstract. CRYBLOCK@MobiSys 2018: 42-47 - 2017
- [c1]Lyudmila Kovalchuk, Dmytro Kaidalov, Oleksiy Shevtsov, Andrii Nastenko, Mariia Rodinko, Roman Oliynykov:
Analysis of splitting attacks on Bitcoin and GHOST consensus protocols. IDAACS 2017: 978-982
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-04-25 02:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint