Petr Kuznetsov

Available identifiers

zbMath Open kuznetsov.petrMaRDI QIDQ550249

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6128561	2024-04-15	Paper
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination	2024-04-15	Paper
https://portal.mardi4nfdi.de/entity/Q6128592	2024-04-15	Paper
Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup	2024-03-26	Paper
Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies	2024-03-26	Paper
Permissionless and Asynchronous Asset Transfer	2023-12-08	Paper
Brief Announcement: Accountability and Reconfiguration -Self-Healing Lattice Agreement	2023-12-08	Paper
Permissionless and asynchronous asset transfer	2023-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q5874265	2023-02-07	Paper
Asynchronous reconfiguration with Byzantine failures	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5091082	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091100	2022-07-21	Paper
The consensus number of a cryptocurrency	2022-04-01	Paper
Correction to: ``The consensus number of a cryptocurrency	2022-04-01	Paper
The Consensus Number of a Cryptocurrency	2021-01-20	Paper
Perfect failure detection with very few bits	2020-12-15	Paper
Progress-Space Tradeoffs in Single-Writer Memory Implementations	2020-07-30	Paper
The weakest failure detector for eventual consistency	2019-11-27	Paper
Perfect failure detection with very few bits	2019-11-22	Paper
Brief Announcement	2019-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q3174928	2018-07-18	Paper
On the uncontended complexity of anonymous agreement	2017-11-29	Paper
On the Uncontended Complexity of Anonymous Consensus	2017-09-29	Paper
Non-interference and local correctness in transactional memory	2017-06-19	Paper
In the Search for Optimal Concurrency	2016-12-01	Paper
On the Space Complexity of Set Agreement	2016-03-23	Paper
The Weakest Failure Detector for Eventual Consistency	2016-03-23	Paper
The complexity of obstruction-free implementations	2015-11-11	Paper
A generalized asynchronous computability theorem	2015-09-03	Paper
The weakest failure detectors to solve certain fundamental problems in distributed computing	2015-08-03	Paper
Wait-freedom with advice	2015-03-25	Paper
Synchronizing without locks is inherently expensive	2015-03-10	Paper
Wait-freedom with advice	2014-12-05	Paper
Brief announcement	2014-12-05	Paper
The failure detector abstraction	2014-08-13	Paper
The weakest failure detector for solving k-set agreement	2014-07-23	Paper
Laws of order	2014-04-10	Paper
On the weakest failure detector ever	2014-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q2843714	2013-08-23	Paper
On the weakest failure detector ever	2013-06-28	Paper
Failure detectors as type boosters	2013-06-20	Paper
The weakest failure detectors to boost obstruction-freedom	2013-06-20	Paper
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit	2013-03-19	Paper
Renaming and the weakest family of failure detectors	2013-02-04	Paper
https://portal.mardi4nfdi.de/entity/Q4904161	2013-01-28	Paper
On set consensus numbers	2012-02-06	Paper
The impossibility of boosting distributed service resilience	2011-07-08	Paper
Towards Network Games with Social Preferences	2010-06-17	Paper
Distributed Computing	2010-02-23	Paper
On Set Consensus Numbers	2009-11-19	Paper
The Weakest Failure Detectors to Boost Obstruction-Freedom	2008-09-09	Paper
The gap in circumventing the impossibility of consensus	2008-06-26	Paper
N-Consensus is the Second Strongest Object for N + 1 Processes	2008-04-22	Paper
Distributed Computing	2006-11-01	Paper
Mutual exclusion in asynchronous systems with failure detectors	2005-08-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Petr Kuznetsov