| 2026 | PODC | Conflict-Freedom as a Progress Condition. | Petr Kuznetsov, Pierre Sutra, Guillermo Toyos-Marfurt |
| 2025 | AFT | Fast, Private and Regulated Payments in Asynchronous Networks. | Maxence Brugeres, Victor Languille, Petr Kuznetsov, Hamza Zarfaoui |
| 2025 | OPODIS | Resolving Conflicts with Grace: Dynamically Concurrent Universality. | Petr Kuznetsov, Nathan Josia Schrodt |
| 2025 | PODC | Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. | Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov |
| 2025 | PODC | Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency. | Joo Paulo Bezerra, Petr Kuznetsov, Luciano Freitas de Souza |
| 2025 | SSS | Space-Time Trade-Off in Bounded Iterated Memory. | Guillermo Toyos-Marfurt, Petr Kuznetsov |
| 2024 | OPODIS | Dynamic Probabilistic Reliable Broadcast. | Joo Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, Stefan Schmid |
| 2024 | PPoPP | Memory Bounds for Concurrent Bounded Queues. | Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov |
| 2024 | SIROCCO | On the Bit Complexity of Iterated Memory. | Guillermo Toyos-Marfurt, Petr Kuznetsov |
| 2023 | CCS | CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts. | Andrei Tonkikh, Pavel Ponomarev, Petr Kuznetsov, Yvonne-Anne Pignolet |
| 2023 | OPODIS | A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. | Joo Paulo Bezerra, Petr Kuznetsov |
| 2022 | PODC | Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. | Joo Paulo Bezerra, Petr Kuznetsov |
| 2022 | PODC | Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup. | Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh |
| 2021 | OPODIS | Accountable Distributed Computing (Invited Talk). | Petr Kuznetsov |
| 2021 | OPODIS | Accountability and Reconfiguration: Self-Healing Lattice Agreement. | Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni |
| 2021 | OPODIS | 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 |
| 2021 | PACT | Optimal Concurrency for List-Based Sets. | Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi |
| 2021 | PODC | Revisiting Optimal Resilience of Fast Byzantine Consensus. | Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang |
| 2020 | DSN | Online Payments by Merely Broadcasting Messages. | Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh, Athanasios Xygkis |
| 2020 | OPODIS | Dynamic Byzantine Reliable Broadcast. | Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh |
| 2020 | SSS | Affine Tasks for k-Test-and-Set. | Petr Kuznetsov, Thibault Rieutord |
| 2019 | OPODIS | Reconfigurable Lattice Agreement and Applications. | Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni |
| 2019 | PODC | The Consensus Number of a Cryptocurrency. | Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi |
| 2018 | OPODIS | Parallel Combining: Benefits of Explicit Synchronization. | Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto |
| 2018 | OPODIS | Task Computability in Unreliable Anonymous Networks. | Petr Kuznetsov, Nayuta Yanagisawa |
| 2018 | PODC | Brief Announcement: Performance Prediction for Coarse-Grained Locking. | Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov |
| 2018 | PODC | An Asynchronous Computability Theorem for Fair Adversaries. | Petr Kuznetsov, Thibault Rieutord, Yuan He |
| 2017 | EuroPar | A Concurrency-Optimal Binary Search Tree. | Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi |
| 2017 | OPODIS | Progress-Space Tradeoffs in Single-Writer Memory Implementations. | Damien Imbs, Petr Kuznetsov, Thibault Rieutord |
| 2016 | OPODIS | Set-Consensus Collections are Decidable. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2016 | OPODIS | Read-Write Memory and k-Set Consensus as an Affine Task. | Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord |
| 2016 | SIROCCO | In the Search for Optimal Concurrency. | Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi |
| 2016 | SSS | Perfect Failure Detection with Very Few Bits. | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord |
| 2015 | ICDCN | On Partial Wait-Freedom in Transactional Memory. | Petr Kuznetsov, Srivatsan Ravi |
| 2015 | INFOCOM | A distributed and robust SDN control plane for transactional network updates. | Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid |
| 2015 | OPODIS | On the Uncontended Complexity of Anonymous Consensus. | Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani |
| 2015 | PACT | Progressive Transactional Memory in Time and Space. | Petr Kuznetsov, Srivatsan Ravi |
| 2015 | PODC | On the Space Complexity of Set Agreement. | Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert |
| 2015 | PODC | The Weakest Failure Detector for Eventual Consistency. | Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens |
| 2014 | ICDCN | Non-interference and Local Correctness in Transactional Memory. | Petr Kuznetsov, Sathya Peri |
| 2014 | OPODIS | Strong Equivalence Relations for Iterated Models. | Zohir Bouzid, Eli Gafni, Petr Kuznetsov |
| 2014 | PODC | A generalized asynchronous computability theorem. | Eli Gafni, Petr Kuznetsov, Ciprian Manolescu |
| 2013 | ICDCS | Safety of Deferred Update in Transactional Memory. | Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi |
| 2013 | SIGCOMM | Software transactional networking: concurrent and consistent policy composition. | Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid |
| 2013 | SSS | Universal Model Simulation: BG and Extended BG as Examples. | Petr Kuznetsov |
| 2012 | PODC | Wait-freedom with advice. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2012 | PODC | Brief announcement: From sequential to concurrent: correctness and relative efficiency. | Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi |
| 2012 | SPAA | On the cost of composing shared-memory algorithms. | Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa |
| 2011 | ICDCN | Relating | Eli Gafni, Petr Kuznetsov |
| 2011 | OPODIS | On the Cost of Concurrency in Transactional Memory. | Petr Kuznetsov, Srivatsan Ravi |
| 2011 | POPL | 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 |
| 2011 | USENIX | Autonomous Storage Management for Personal Devices with PodBase. | Ansley Post, Juan Navarro, Petr Kuznetsov, Peter Druschel |
| 2010 | OPODIS | Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. | Eli Gafni, Petr Kuznetsov |
| 2010 | PODC | Brief announcement: on L-resilience, hitting sets, and colorless tasks. | Eli Gafni, Petr Kuznetsov |
| 2010 | SIROCCO | Towards Network Games with Social Preferences. | Petr Kuznetsov, Stefan Schmid |
| 2009 | NSDI | Zeno: Eventually Consistent Byzantine-Fault Tolerance. | Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, Petros Maniatis |
| 2009 | OPODIS | The Fault Detection Problem. | Andreas Haeberlen, Petr Kuznetsov |
| 2009 | PODC | The weakest failure detector for solving k-set agreement. | Eli Gafni, Petr Kuznetsov |
| 2007 | OPODIS | N-Consensus is the Second Strongest Object for N+1 Processes. | Eli Gafni, Petr Kuznetsov |