Reducing Noise in Gossip-Based Reliable Broadcast. - Petr Kouznetsov; Rachid Guerraoui; Sidath B. Handurukande; Anne-Marie Kermarrec (SRDS, 2001)

On the Weakest Failure Detector for Non-Blocking Atomic Commit. - Rachid Guerraoui; Petr Kouznetsov (IFIP TCS, 2002)

A Note on Set Agreement with Omission Failures. - Rachid Guerraoui; Petr Kouznetsov; Bastian Pochon (GETCO, 2002)

On Failure Detectors and Type Boosters. - Rachid Guerraoui; Petr Kouznetsov (DISC, 2003)

Lightweight probabilistic broadcast. - Patrick Th. Eugster; Rachid Guerraoui; Sidath B. Handurukande; Petr Kouznetsov; Anne-Marie Kermarrec (ACM Trans. Comput. Syst., 2003)

D-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability. - Patrick Th. Eugster; Rachid Guerraoui; Petr Kouznetsov (ICDCS, 2004)

The weakest failure detectors to solve certain fundamental problems in distributed computing. - Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Vassos Hadzilacos; Petr Kouznetsov; Sam Toueg (PODC, 2004)

Computing with Reads and Writes in the Absence of Step Contention. - Hagit Attiya; Rachid Guerraoui; Petr Kouznetsov (DISC, 2005)

Mutual exclusion in asynchronous systems with failure detectors. - Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Petr Kouznetsov (J. Parallel Distributed Comput., 2005)

Abstracting out Byzantine Behavior. - Peter Druschel; Andreas Haeberlen; Petr Kouznetsov (From Security to Dependability, 2006)

The Case for Byzantine Fault Detection. - Andreas Haeberlen; Petr Kouznetsov; Peter Druschel (HotDep, 2006)

Synchronizing without locks is inherently expensive. - Hagit Attiya; Rachid Guerraoui; Danny Hendler; Petr Kouznetsov (PODC, 2006)

N-Consensus is the Second Strongest Object for N+1 Processes. - Eli Gafni; Petr Kuznetsov (OPODIS, 2007)

PeerReview: practical accountability for distributed systems. - Andreas Haeberlen; Petr Kouznetsov; Peter Druschel (SOSP, 2007)

PodBase: transparent storage management for personal devices. - Ansley Post; Petr Kuznetsov; Peter Druschel (IPTPS, 2008)

Defining weakly consistent Byzantine fault-tolerant services. - Atul Singh; Pedro Fonseca 001; Petr Kuznetsov; Rodrigo Rodrigues 001; Petros Maniatis (LADIS, 2008)

Failure detectors as type boosters. - Rachid Guerraoui; Petr Kouznetsov (Distributed Comput., 2008)

The weakest failure detectors to boost obstruction-freedom. - Rachid Guerraoui; Michal Kapalka; Petr Kouznetsov (Distributed Comput., 2008)

The gap in circumventing the impossibility of consensus. - Rachid Guerraoui; Petr Kuznetsov (J. Comput. Syst. Sci., 2008)

Zeno: Eventually Consistent Byzantine-Fault Tolerance. - Atul Singh; Pedro Fonseca 001; Petr Kuznetsov; Rodrigo Rodrigues 001; Petros Maniatis (NSDI, 2009)

The Fault Detection Problem. - Andreas Haeberlen; Petr Kuznetsov (OPODIS, 2009)

The weakest failure detector for solving k-set agreement. - Eli Gafni; Petr Kuznetsov (PODC, 2009)

On the weakest failure detector ever. - Rachid Guerraoui; Maurice Herlihy; Petr Kuznetsov; Nancy A. Lynch; Calvin C. Newport (Distributed Comput., 2009)

The complexity of obstruction-free implementations. - Hagit Attiya; Rachid Guerraoui; Danny Hendler; Petr Kuznetsov (J. ACM, 2009)

BFTW3: why? when? where? workshop on the theory and practice of byzantine fault tolerance. - Petr Kuznetsov; Rodrigo Rodrigues 001 (SIGACT News, 2009)

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. - Eli Gafni; Petr Kuznetsov (OPODIS, 2010)

Brief announcement: on L-resilience, hitting sets, and colorless tasks. - Eli Gafni; Petr Kuznetsov (PODC, 2010)

Towards Network Games with Social Preferences. - Petr Kuznetsov; Stefan Schmid 001 (SIROCCO, 2010)

L-Resilient Adversaries and Hitting Sets - Eli Gafni; Petr Kuznetsov (CoRR, 2010)

Relating L mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. - Eli Gafni; Petr Kuznetsov (ICDCN, 2011)

On the Cost of Concurrency in Transactional Memory. - Petr Kuznetsov; Srivatsan Ravi (OPODIS, 2011)

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. - Hagit Attiya; Rachid Guerraoui; Danny Hendler; Petr Kuznetsov; Maged M. Michael; Martin T. Vechev (POPL, 2011)

Autonomous Storage Management for Personal Devices with PodBase. - Ansley Post; Juan Navarro; Petr Kuznetsov; Peter Druschel (USENIX ATC, 2011)

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (DISC, 2011)

Impersonal Failure Detection - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (CoRR, 2011)

The failure detector abstraction. - Felix C. Freiling; Rachid Guerraoui; Petr Kuznetsov (ACM Comput. Surv., 2011)

On set consensus numbers. - Eli Gafni; Petr Kuznetsov (Distributed Comput., 2011)

The impossibility of boosting distributed service resilience. - Paul C. Attie; Rachid Guerraoui; Petr Kuznetsov; Nancy A. Lynch; Sergio Rajsbaum (Inf. Comput., 2011)

Brief announcement: From sequential to concurrent: correctness and relative efficiency. - Vincent Gramoli; Petr Kuznetsov; Srivatsan Ravi (PODC, 2012)

On the cost of composing shared-memory algorithms. - Dan Alistarh; Rachid Guerraoui; Petr Kuznetsov; Giuliano Losa (SPAA, 2012)

From Sequential to Concurrent: Correctness and Relative Efficiency - Vincent Gramoli; Petr Kuznetsov; Srivatsan Ravi (CoRR, 2012)

On Non-Interference of Transactions - Petr Kuznetsov; Sathya Peri (CoRR, 2012)

Renaming and the weakest family of failure detectors. - Yehuda Afek; Petr Kuznetsov; Israel Nir (Distributed Comput., 2012)

Understanding Non-Uniform Failure Models. - Petr Kuznetsov (Bull. EATCS, 2012)

The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit. - Rachid Guerraoui; Vassos Hadzilacos; Petr Kuznetsov; Sam Toueg (SIAM J. Comput., 2012)

WTTM 2011: the third workshop on the theory of transactional memory. - Petr Kuznetsov; Srivatsan Ravi (SIGACT News, 2012)

Safety of Deferred Update in Transactional Memory. - Hagit Attiya; Sandeep Hans; Petr Kuznetsov; Srivatsan Ravi (ICDCS, 2013)

Software transactional networking: concurrent and consistent policy composition. - Marco Canini; Petr Kuznetsov; Dan Levin; Stefan Schmid 001 (HotSDN, 2013)

Universal Model Simulation: BG and Extended BG as Examples. - Petr Kuznetsov (SSS, 2013)

A Distributed SDN Control Plane for Consistent Policy Updates. - Marco Canini; Petr Kuznetsov; Dan Levin; Stefan Schmid 001 (CoRR, 2013)

Simple CHT: A New Derivation of the Weakest Failure Detector for Consensus. - Petr Kuznetsov (CoRR, 2013)

Strong Equivalence Relations for Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (OPODIS, 2014)

A generalized asynchronous computability theorem. - Eli Gafni; Petr Kuznetsov; Ciprian Manolescu (PODC, 2014)

Live Equals Fast in Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (CoRR, 2014)

Safety and Deferred Update in Transactional Memory. - Hagit Attiya; Sandeep Hans; Petr Kuznetsov; Srivatsan Ravi (Transactional Memory, 2015)

On Partial Wait-Freedom in Transactional Memory. - Petr Kuznetsov; Srivatsan Ravi (ICDCN, 2015)

A distributed and robust SDN control plane for transactional network updates. - Marco Canini; Petr Kuznetsov; Dan Levin; Stefan Schmid 001 (INFOCOM, 2015)

On the Uncontended Complexity of Anonymous Consensus. - Claire Capdevielle; Colette Johnen; Petr Kuznetsov; Alessia Milani (OPODIS, 2015)

Progressive Transactional Memory in Time and Space. - Petr Kuznetsov; Srivatsan Ravi (PaCT, 2015)

On the Space Complexity of Set Agreement. - Carole Delporte-Gallet; Hugues Fauconnier; Petr Kuznetsov; Eric Ruppert (PODC, 2015)

A Concurrency-Optimal List-Based Set. - Vincent Gramoli; Petr Kuznetsov; Srivatsan Ravi; Di Shang (CoRR, 2015)

Why Transactional Memory Should Not Be Obstruction-Free. - Petr Kuznetsov; Srivatsan Ravi (CoRR, 2015)

Wait-freedom with advice. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (Distributed Comput., 2015)

Set-Consensus Collections are Decidable. - Carole Delporte-Gallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov (OPODIS, 2016)

Read-Write Memory and k-Set Consensus as an Affine Task. - Eli Gafni; Yuan He 003; Petr Kuznetsov; Thibault Rieutord (OPODIS, 2016)

In the Search for Optimal Concurrency. - Vincent Gramoli; Petr Kuznetsov; Srivatsan Ravi (SIROCCO, 2016)

In-Band Synchronization for Distributed SDN Control Planes. - Liron Schiff; Stefan Schmid 001; Petr Kuznetsov (Comput. Commun. Rev., 2016)

A Concurrency-Optimal Binary Search Tree. - Vitaly Aksenov; Vincent Gramoli; Petr Kuznetsov; Anna Malova; Srivatsan Ravi (Euro-Par, 2017)

Agreement Functions for Distributed Computing Models. - Petr Kuznetsov; Thibault Rieutord (NETYS, 2017)

Progress-Space Tradeoffs in Single-Writer Memory Implementations. - Damien Imbs; Petr Kuznetsov; Thibault Rieutord (OPODIS, 2017)

Brief Announcement: Compact Topology of Shared-Memory Adversaries. - Petr Kuznetsov; Thibault Rieutord; Yuan He 003 (DISC, 2017)

Flat Parallelization. - Vitaly Aksenov; Petr Kuznetsov (CoRR, 2017)

Parallel Combining: Making Use of Free Cycles. - Vitaly Aksenov; Petr Kuznetsov (CoRR, 2017)

On the uncontended complexity of anonymous agreement. - Claire Capdevielle; Colette Johnen; Petr Kuznetsov; Alessia Milani (Distributed Comput., 2017)

Grasping the gap between blocking and non-blocking transactional memories. - Petr Kuznetsov; Srivatsan Ravi (J. Parallel Distributed Comput., 2017)

Non-interference and local correctness in transactional memory. - Petr Kuznetsov; Sathya Peri (Theor. Comput. Sci., 2017)

On Helping and Stacks. - Vitaly Aksenov; Petr Kuznetsov; Anatoly Shalyto 001 (NETYS, 2018)

Parallel Combining: Benefits of Explicit Synchronization. - Vitaly Aksenov; Petr Kuznetsov; Anatoly Shalyto 001 (OPODIS, 2018)

Task Computability in Unreliable Anonymous Networks. - Petr Kuznetsov; Nayuta Yanagisawa (OPODIS, 2018)

Brief Announcement: Performance Prediction for Coarse-Grained Locking. - Vitaly Aksenov; Dan Alistarh; Petr Kuznetsov (PODC, 2018)

An Asynchronous Computability Theorem for Fair Adversaries. - Petr Kuznetsov; Thibault Rieutord; Yuan He 003 (PODC, 2018)

AT2: Asynchronous Trustworthy Transfers. - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (CoRR, 2018)

Inherent limitations of hybrid transactional memory. - Dan Alistarh; Justin Kopinsky; Petr Kuznetsov; Srivatsan Ravi; Nir Shavit (Distributed Comput., 2018)

The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017. - Petr Kuznetsov (SIGACT News, 2018)

Reconfigurable Lattice Agreement and Applications. - Petr Kuznetsov; Thibault Rieutord; Sara Tucci Piergiovanni (OPODIS, 2019)

Scalable Byzantine Reliable Broadcast. - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (DISC, 2019)

Performance Prediction for Coarse-Grained Locking. - Vitaly Aksenov; Dan Alistarh; Petr Kuznetsov (CoRR, 2019)

The Consensus Number of a Cryptocurrency (Extended Version). - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (CoRR, 2019)

Scalable Byzantine Reliable Broadcast (Extended Version). - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (CoRR, 2019)

The weakest failure detector for eventual consistency. - Swan Dubois; Rachid Guerraoui; Petr Kuznetsov; Franck Petit; Pierre Sens 001 (Distributed Comput., 2019)

SPTCC 2019 Review. - Petr Kuznetsov (SIGACT News, 2019)

Online Payments by Merely Broadcasting Messages. - Daniel Collins 001; Rachid Guerraoui; Jovan Komatovic; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Yvonne-Anne Pignolet; Dragos-Adrian Seredinschi; Andrei Tonkikh; Athanasios Xygkis (DSN, 2020)

Dynamic Byzantine Reliable Broadcast. - Rachid Guerraoui; Jovan Komatovic; Petr Kuznetsov; Yvonne-Anne Pignolet; Dragos-Adrian Seredinschi; Andrei Tonkikh (OPODIS, 2020)

Affine Tasks for k-Test-and-Set. - Petr Kuznetsov; Thibault Rieutord (SSS, 2020)

Brief Announcement: On Decidability of 2-Process Affine Models. - Petr Kuznetsov; Thibault Rieutord (DISC, 2020)

Online Payments by Merely Broadcasting Messages (Extended Version). - Daniel Collins 001; Rachid Guerraoui; Jovan Komatovic; Matteo Monti; Athanasios Xygkis; Matej Pavlovic; Petr Kuznetsov; Yvonne-Anne Pignolet; Dragos-Adrian Seredinschi; Andrei Tonkikh (CoRR, 2020)

On Decidability of 2-process Affine Models. - Petr Kuznetsov; Thibault Rieutord (CoRR, 2020)

Perfect failure detection with very few bits. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers; Petr Kuznetsov; Thibault Rieutord (Inf. Comput., 2020)

Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. - Vitaly Aksenov; Petr Kuznetsov (SIGACT News, 2020)

Accountable Distributed Computing (Invited Talk). - Petr Kuznetsov (OPODIS, 2021)

Accountability and Reconfiguration: Self-Healing Lattice Agreement. - Luciano Freitas de Souza; Petr Kuznetsov; Thibault Rieutord; Sara Tucci Piergiovanni (OPODIS, 2021)

RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination. - Luciano Freitas de Souza; Andrei Tonkikh; Sara Tucci Piergiovanni; Renaud Sirdey; Oana Stan; Nicolas Quero; Petr Kuznetsov (OPODIS, 2021)

Optimal Concurrency for List-Based Sets. - Vitaly Aksenov; Vincent Gramoli; Petr Kuznetsov; Di Shang; Srivatsan Ravi (PaCT, 2021)

Revisiting Optimal Resilience of Fast Byzantine Consensus. - Petr Kuznetsov; Andrei Tonkikh; Yan X. Zhang (PODC, 2021)

Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement. - Luciano Freitas de Souza; Petr Kuznetsov; Thibault Rieutord; Sara Tucci Piergiovanni (DISC, 2021)

Memory-Optimality for Non-Blocking Containers. - Vitaly Aksenov; Nikita Koval; Petr Kuznetsov (CoRR, 2021)

Permissionless and Asynchronous Asset Transfer [Technical Report]. - Petr Kuznetsov; Yvonne-Anne Pignolet; Pavel Ponomarev; Andrei Tonkikh (CoRR, 2021)

RandSolomon: optimally resilient multi-party random number generation protocol. - Luciano Freitas de Souza; Sara Tucci Piergiovanni; Renaud Sirdey; Oana Stan; Nicolas Quero; Petr Kuznetsov (CoRR, 2021)

Peformance Prediction for Coarse-Grained Locking: MCS Case. - Vitaly Aksenov; Daniil Bolotov; Petr Kuznetsov (CoRR, 2021)

Relaxed Reliable Broadcast for Decentralized Trust. - João Paulo Bezerra; Petr Kuznetsov; Alice Koroleva (NETYS, 2022)

Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. - João Paulo Bezerra; Petr Kuznetsov (PODC, 2022)

Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup. - Luciano Freitas de Souza; Petr Kuznetsov; Andrei Tonkikh (PODC, 2022)

Distributed Randomness from Approximate Agreement. - Luciano Freitas de Souza; Petr Kuznetsov; Andrei Tonkikh (DISC, 2022)

How to Tame Multiple Spending in Decentralized Cryptocurrencies. - João Paulo Bezerra; Petr Kuznetsov (CoRR, 2022)

Homomorphic Sortition - Secret Leader Election for Blockchain. - Luciano Freitas de Souza; Andrei Tonkikh; Sara Tucci Piergiovanni; Renaud Sirdey; Oana Stan; Nicolas Quero; Adda-Akram Bendoukha; Petr Kuznetsov (CoRR, 2022)

The consensus number of a cryptocurrency. - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (Distributed Comput., 2022)

Correction to: The consensus number of a cryptocurrency. - Rachid Guerraoui; Petr Kuznetsov; Matteo Monti; Matej Pavlovic; Dragos-Adrian Seredinschi (Distributed Comput., 2022)

Asynchronous reconfiguration with Byzantine failures. - Petr Kuznetsov; Andrei Tonkikh (Distributed Comput., 2022)

Agreement in Spiking Neural Networks. - Martin Kunev; Petr Kuznetsov; Denis Sheynikhovich (J. Comput. Biol., 2022)

CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts. - Andrei Tonkikh; Pavel Ponomarev; Petr Kuznetsov; Yvonne-Anne Pignolet (CCS, 2023)

A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. - João Paulo Bezerra; Petr Kuznetsov (OPODIS, 2023)

Homomorphic Sortition - Single Secret Leader Election for PoS Blockchains. - Luciano Freitas de Souza; Andrei Tonkikh; Adda-Akram Bendoukha; Sara Tucci Piergiovanni; Renaud Sirdey; Oana Stan; Petr Kuznetsov (IACR Cryptol. ePrint Arch., 2023)

Permissionless and asynchronous asset transfer. - Petr Kuznetsov; Yvonne-Anne Pignolet; Pavel Ponomarev; Andrei Tonkikh (Distributed Comput., 2023)

Dynamic Probabilistic Reliable Broadcast. - João Paulo Bezerra; Veronika Anikina; Petr Kuznetsov; Liron Schiff; Stefan Schmid 001 (OPODIS, 2024)

Memory Bounds for Concurrent Bounded Queues. - Vitaly Aksenov; Nikita Koval; Petr Kuznetsov; Anton Paramonov (PPoPP, 2024)

On the Bit Complexity of Iterated Memory. - Guillermo Toyos-Marfurt; Petr Kuznetsov (SIROCCO, 2024)

Asynchronous Latency and Fast Atomic Snapshot. - João Paulo Bezerra; Luciano Freitas de Souza; Petr Kuznetsov (CoRR, 2024)

Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. - Michael Anoprenko; Petr Kuznetsov; Vitaly Aksenov (PODC, 2025)

Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency. - João Paulo Bezerra; Petr Kuznetsov; Luciano Freitas de Souza (PODC, 2025)

Fast, private and regulated payments in asynchronous networks. - Maxence Brugeres; Victor Languille; Petr Kuznetsov; Hamza Zarfaoui (IACR Cryptol. ePrint Arch., 2025)

DAGs for the Masses. - Michael Anoprenko; Andrei Tonkikh; Alexander Spiegelman; Petr Kuznetsov (CoRR, 2025)