|
|
|
⇣
|
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
|
|
|
⇣
|
⇣
|
Optimal Concurrency for List-Based Sets,
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov ■, Di Shang, Srivatsan Ravi,
PaCT 2021, Kaliningrad, Russian Federation
|
|
|
⇣
|
⇣
|
Revisiting Optimal Resilience of Fast Byzantine Consensus,
Petr Kuznetsov ■, Andrei Tonkikh, Yan Zhang,
PODC 2021, Virtual Event Italy, France
|
|
|
⇣
|
⇣
|
Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement,
Luciano Freitas De Souza, Petr Kuznetsov ■, Thibault Rieutord, Sara Tucci Piergiovanni,
DISC 2021, Freibourg, Germany
|
|
|
|
⇣
|
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
|
|
|
⇣
|
⇣
|
Brief Announcement: On Decidability of 2-Process Affine Models,
Petr Kuznetsov ■, Thibault Rieutord,
DISC 2020, VIRTUAL, France
|
|
|
⇣
|
⇣
|
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,
DSN 2020, Valencia, Spain
|
|
|
⇣
|
⇣
|
Affine Tasks for k-Test-and-Set,
Petr Kuznetsov ■, Thibault Rieutord,
SSS 2020
|
|
|
|
⇣
|
Dynamic Byzantine Reliable Broadcast,
Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov ■, Yvonne Anne Pignolet, Dragos Adrian Seredinschi, Andrei Tonkikh,
OPODIS 2020
|
|
|
⇣
|
⇣
|
Reconfigurable Lattice Agreement and Applications,
Petr Kuznetsov ■, Thibault Rieutord, Sara Tucci Piergiovanni,
OPODIS 2019, Neuchatel, Switzerland
|
|
|
⇣
|
⇣
|
Scalable Byzantine Reliable Broadcast,
Rachid Guerraoui, Petr Kuznetsov ■, Matteo Monti, Matej Pavlovic, Dragos Adrian Seredinschi,
DISC 2019, Budapest, Hungary
|
|
|
⇣
|
⇣
|
Task Computability in Unreliable Anonymous Networks,
Petr Kuznetsov, Nayuta Yanagisawa,
OPODIS 2018, Hong Kong, China
|
|
|
⇣
|
⇣
|
Parallel Combining: Benefits of Explicit Synchronization,
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto,
OPODIS 2018, Hong Kong, China
|
|
|
⇣
|
⇣
|
On Helping and Stacks,
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto,
NETYS 2018, Essaouira, Morocco
|
|
|
⇣
|
⇣
|
Brief Announcement: Performance Prediction for Coarse-Grained Locking,
Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov,
PODC 2018, Egham, United Kingdom
|
|
|
⇣
|
⇣
|
Progress-Space Tradeoffs in Single-Writer Memory Implementations,
Damien Imbs, Petr Kuznetsov, Thibault Rieutord,
OPODIS 2017, Lisbon, Portugal
|
|
|
⇣
|
⇣
|
A Concurrency-Optimal Binary Search Tree,
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi,
Euro-Par 2017, Santiago de Compostella, Spain
|
|
|
|
⇣
|
Agreement Functions for Distributed Computing Models,
Petr Kuznetsov, Thibault Rieutord,
NETYS 2017
|
|
|
|
⇣
|
Brief Announcement: Compact Topology of Shared-Memory Adversaries,
Petr Kuznetsov, Thibault Rieutord, Yuan He,
DISC 2017
|
|
|
⇣
|
⇣
|
Set-Consensus Collections are Decidable,
Carole Delporte Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov,
OPODIS 2016, MADRID, Spain
|
|
|
⇣
|
|
Complexité du consensus anonyme en l'absence de concurrence,
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani,
ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2016, Bayonne, France
|
|
|
|
⇣
|
Read-Write Memory and k-Set Consensus as an Affine Task,
Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord,
OPODIS 2016
|
|
|
|
⇣
|
In the Search for Optimal Concurrency,
Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi,
SIROCCO 2016
|
|
|
⇣
|
⇣
|
Progressive Transactional Memory in Time and Space,
Petr Kuznetsov, Srivatsan Ravi,
PaCT 2015, Petrozavodsk, Russian Federation
|
|
|
⇣
|
⇣
|
On the Uncontended Complexity of Anonymous Consensus,
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani,
OPODIS 2015, Rennes, France
|
|
|
⇣
|
|
Brief Announcement: On the Uncontended Complexity of Anonymous Consensus,
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani,
DISC 2015 2015, Tokyo, Japan
|
|
|
⇣
|
|
Brief Announcement: A Concurrency-Optimal List-Based Set,
Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang,
DISC 2015 2015, Tokyo, Japan
|
|
|
|
⇣
|
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,
INFOCOM 2015
|
|
|
|
⇣
|
On the Space Complexity of Set Agreement,
Carole Delporte Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert,
PODC 2015
|
|
|
|
⇣
|
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
|
|
|
|
⇣
|
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,
HotSDN 2013
|
|
|
|
⇣
|
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
|
|
|
|
⇣
|
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 Michael, Martin Vechev,
POPL 2011
|
|
|
|
⇣
|
Autonomous Storage Management for Personal Devices with PodBase,
Ansley Post, Juan Navarro, Petr Kuznetsov, Peter Druschel,
USENIX Annual Technical Conference 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
|
|
|
|
⇣
|
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,
SIROCCO 2010
|
|
|
|
⇣
|
Zeno: Eventually Consistent Byzantine-Fault Tolerance,
Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, 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
|
|
|
|
⇣
|
Defining weakly consistent Byzantine fault-tolerant services,
Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, Petros Maniatis,
LADIS 2008
|
|
|
|
⇣
|
PodBase: transparent storage management for personal devices,
Ansley Post, Petr Kuznetsov, Peter Druschel,
IPTPS 2008
|
|
|
|
⇣
|
N-Consensus is the Second Strongest Object for N+1 Processes,
Eli Gafni, Petr Kuznetsov,
OPODIS 2007
|
|
|
⇣
|
⇣
|
Permissionless and asynchronous asset transfer,
Petr Kuznetsov ■, Yvonne Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh ■,
Distributed Comput. 2023, Strasbourg, France
|
|
|
|
⇣
|
Various Types of Light Guides for Use in Lossy Mode Resonance-Based Sensors,
Dmitriy Sudas, Viktor Jitov, Petr Kuznetsov ■,
Sensors 2023
|
|
|
⇣
|
⇣
|
The consensus number of a cryptocurrency,
Rachid Guerraoui, Petr Kuznetsov ■, Matteo Monti, Matej Pavlovic, Dragos Adrian Seredinschi,
Distributed Computing 2022
|
|
|
⇣
|
⇣
|
Agreement in Spiking Neural Networks,
Martin Kunev, Petr Kuznetsov ■, Denis Sheynikhovich,
Journal of Computational Biology 2022
|
|
|
⇣
|
⇣
|
Asynchronous reconfiguration with Byzantine failures,
Petr Kuznetsov ■, Andrei Tonkikh ■,
Distributed Comput. 2022, VIRTUAL, France
|
|
|
|
⇣
|
Correction to: The consensus number of a cryptocurrency,
Rachid Guerraoui, Petr Kuznetsov ■, Matteo Monti, Matej Pavlovic, Dragos Adrian Seredinschi,
Distributed Comput. 2022
|
|
|
|
⇣
|
A Study of the Lossy Mode Resonances during the Synthesis Process of Zinc Telluride Films,
Petr Kuznetsov ■, Dmitriy Sudas, Evgeny Savelyev,
Sensors 2022
|
|
|
⇣
|
|
New data on the ultrastructure of the proboscis in females of Bonellia viridis (Annelida: Bonellinae),
Petr Kuznetsov ■, Alexander Ereskovsky, Elena N Temereva,
Zoomorphology 2021
|
|
|
⇣
|
⇣
|
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020,
Vitaly Aksenov, Petr Kuznetsov ■,
ACM SIGACT News 2020
|
|
|
⇣
|
⇣
|
Perfect failure detection with very few bits,
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov ■, Thibault Rieutord,
Information and Computation 2020
|
|
|
⇣
|
⇣
|
The weakest failure detector for eventual consistency,
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov ■, Franck Petit, Pierre Sens,
Distributed Computing 2019
|
|
|
⇣
|
⇣
|
Inherent limitations of hybrid transactional memory,
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit,
Distributed Computing 2018
|
|
|
⇣
|
|
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017,
Petr Kuznetsov,
SIGACT News 2018
|
|
|
⇣
|
⇣
|
Non-interference and local correctness in transactional memory,
Petr Kuznetsov, Sathya Peri,
Theor. Comput. Sci. 2017
|
|
|
⇣
|
⇣
|
On the uncontended complexity of anonymous agreement,
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani,
Distributed Computing 2017
|
|
|
⇣
|
⇣
|
Grasping the gap between blocking and non-blocking transactional memories,
Petr Kuznetsov, Srivatsan Ravi,
J. Parallel Distributed Comput. 2017, Tokyo, Japan
|
|
|
⇣
|
⇣
|
In-Band Synchronization for Distributed SDN Control Planes,
Liron Schiff, Stefan Schmid, Petr Kuznetsov,
Computer Communication Review 2016
|
|
|
|
⇣
|
Wait-freedom with advice,
Carole Delporte Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov,
Distributed Comput. 2015
|
|
|
|
⇣
|
Renaming and the weakest family of failure detectors,
Yehuda Afek, Petr Kuznetsov, Israel Nir,
Distributed Comput. 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
|
|
|
|
⇣
|
The failure detector abstraction,
Felix 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 Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy Lynch, Sergio Rajsbaum,
Inf. Comput. 2011
|
|
|
|
⇣
|
On the weakest failure detector ever,
Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy Lynch, Calvin 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,
SIGACT News 2009
|
|
|
|
⇣
|
The gap in circumventing the impossibility of consensus,
Rachid Guerraoui, Petr Kuznetsov,
J. Comput. Syst. Sci. 2008
|
|
|
|
⇣
|
Dynamic Probabilistic Reliable Broadcast,
Veronika Anikina, João Paulo Bezerra, Petr Kuznetsov ■, Liron Schiff, Stefan Schmid,
CoRR 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
|
|
|
|
⇣
|
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
|
|
|
|
⇣
|
CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts,
Petr Kuznetsov ■, Yvonne Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh ■,
CoRR 2022
|
|
|
|
⇣
|
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
|
|
|
⇣
|
⇣
|
An Asynchronous Computability Theorem for Fair Adversaries,
Petr Kuznetsov ■, Thibault Rieutord, Yuan He,
CoRR 2020
|
|
|
|
⇣
|
Online Payments by Merely Broadcasting Messages (Extended Version),
Daniel Collins, 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
|
|
|
|
⇣
|
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
|
|
|
⇣
|
⇣
|
AT2: Asynchronous Trustworthy Transfers,
Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos Adrian Seredinschi,
CoRR 2018
|
|
|
⇣
|
⇣
|
Parallel Combining: Making Use of Free Cycles,
Vitaly Aksenov, Petr Kuznetsov,
CoRR 2017
|
|
|
|
⇣
|
Flat Parallelization,
Vitaly Aksenov, Petr Kuznetsov,
CoRR 2017
|
|
|
|
⇣
|
In the Search of Optimal Concurrency,
Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi,
CoRR 2016
|
|
|
|
⇣
|
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
|
|
|
|
⇣
|
Live Equals Fast in Iterated Models,
Zohir Bouzid, Eli Gafni, Petr Kuznetsov,
CoRR 2014
|
|
|
|
⇣
|
A Distributed SDN Control Plane for Consistent Policy Updates,
Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid,
CoRR 2013
|
|
|
|
⇣
|
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
|
|
|
|
⇣
|
Impersonal Failure Detection,
Carole Delporte Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov,
CoRR 2011
|
|
|
|
⇣
|
L-Resilient Adversaries and Hitting Sets,
Eli Gafni, Petr Kuznetsov,
CoRR 2010
|
