default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Kuznetsov
Petr Kouznetsov
Person information
- affiliation: Max Planck Institute for Informatics, Saarbücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i52]Maxence Brugeres, Victor Languille, Petr Kuznetsov, Hamza Zarfaoui:
Fast, private and regulated payments in asynchronous networks. IACR Cryptol. ePrint Arch. 2025: 98 (2025)- 2024
- [c83]João Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, Stefan Schmid:
Dynamic Probabilistic Reliable Broadcast. OPODIS 2024: 31:1-31:30 - [c82]Vitaly Aksenov
, Nikita Koval, Petr Kuznetsov, Anton Paramonov:
Memory Bounds for Concurrent Bounded Queues. PPoPP 2024: 188-199 - [c81]Guillermo Toyos-Marfurt, Petr Kuznetsov:
On the Bit Complexity of Iterated Memory. SIROCCO 2024: 456-477 - [e2]Ran Gelles, Dennis Olivetti, Petr Kuznetsov:
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024. ACM 2024 [contents] - [i51]Guillermo Toyos-Marfurt, Petr Kuznetsov:
On the Bit Complexity of Iterated Memory. CoRR abs/2402.12484 (2024) - [i50]João Paulo Bezerra, Luciano Freitas de Souza, Petr Kuznetsov:
Asynchronous Latency and Fast Atomic Snapshot. CoRR abs/2408.02562 (2024) - 2023
- [j31]Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
Permissionless and asynchronous asset transfer. Distributed Comput. 36(3): 349-371 (2023) - [c80]Andrei Tonkikh, Pavel Ponomarev, Petr Kuznetsov, Yvonne-Anne Pignolet:
CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts. CCS 2023: 1556-1570 - [c79]João Paulo Bezerra, Petr Kuznetsov:
A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. OPODIS 2023: 31:1-31:19 - [i49]Veronika Anikina, João Paulo Bezerra, Petr Kuznetsov, Liron Schiff, Stefan Schmid:
Dynamic Probabilistic Reliable Broadcast. CoRR abs/2306.04221 (2023) - [i48]Luciano Freitas de Souza, Andrei Tonkikh, Adda-Akram Bendoukha, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Petr Kuznetsov:
Homomorphic Sortition - Single Secret Leader Election for PoS Blockchains. IACR Cryptol. ePrint Arch. 2023: 113 (2023) - 2022
- [j30]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
The consensus number of a cryptocurrency. Distributed Comput. 35(1): 1-15 (2022) - [j29]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
Correction to: The consensus number of a cryptocurrency. Distributed Comput. 35(1): 17 (2022) - [j28]Petr Kuznetsov, Andrei Tonkikh:
Asynchronous reconfiguration with Byzantine failures. Distributed Comput. 35(6): 477-502 (2022) - [j27]Martin Kunev, Petr Kuznetsov, Denis Sheynikhovich:
Agreement in Spiking Neural Networks. J. Comput. Biol. 29(4): 358-369 (2022) - [c78]João Paulo Bezerra, Petr Kuznetsov, Alice Koroleva:
Relaxed Reliable Broadcast for Decentralized Trust. NETYS 2022: 104-118 - [c77]Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh:
Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup. PODC 2022: 103-105 - [c76]João Paulo Bezerra, Petr Kuznetsov:
Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. PODC 2022: 427-429 - [c75]Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh:
Distributed Randomness from Approximate Agreement. DISC 2022: 24:1-24:21 - [i47]Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh:
Distributed Randomness from Approximate Agreement. CoRR abs/2205.11878 (2022) - [i46]João Paulo Bezerra, Petr Kuznetsov:
How to Tame Multiple Spending in Decentralized Cryptocurrencies. CoRR abs/2205.14076 (2022) - [i45]Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, Adda-Akram Bendoukha, Petr Kuznetsov:
Homomorphic Sortition - Secret Leader Election for Blockchain. CoRR abs/2206.11519 (2022) - [i44]Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts. CoRR abs/2212.04895 (2022) - 2021
- [c74]Petr Kuznetsov:
Accountable Distributed Computing (Invited Talk). OPODIS 2021: 2:1-2:1 - [c73]Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, Petr Kuznetsov:
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination. OPODIS 2021: 23:1-23:16 - [c72]Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Accountability and Reconfiguration: Self-Healing Lattice Agreement. OPODIS 2021: 25:1-25:23 - [c71]Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi:
Optimal Concurrency for List-Based Sets. PaCT 2021: 386-401 - [c70]Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang:
Revisiting Optimal Resilience of Fast Byzantine Consensus. PODC 2021: 343-353 - [c69]Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
Permissionless and Asynchronous Asset Transfer. DISC 2021: 28:1-28:19 - [c68]Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement. DISC 2021: 54:1-54:5 - [i43]Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang:
Revisiting Optimal Resilience of Fast Byzantine Consensus. CoRR abs/2102.12825 (2021) - [i42]Vitaly Aksenov, Nikita Koval, Petr Kuznetsov:
Memory-Optimality for Non-Blocking Containers. CoRR abs/2104.15003 (2021) - [i41]Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Accountability and Reconfiguration: Self-Healing Lattice Agreement. CoRR abs/2105.04909 (2021) - [i40]Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
Permissionless and Asynchronous Asset Transfer [Technical Report]. CoRR abs/2105.04966 (2021) - [i39]Luciano Freitas de Souza, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, Petr Kuznetsov:
RandSolomon: optimally resilient multi-party random number generation protocol. CoRR abs/2109.04911 (2021) - [i38]João Paulo Bezerra, Petr Kuznetsov, Alice Koroleva:
Relaxed Reliable Broadcast for Decentralized Trust. CoRR abs/2109.08611 (2021) - [i37]Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov:
Peformance Prediction for Coarse-Grained Locking: MCS Case. CoRR abs/2110.05545 (2021) - 2020
- [j26]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect failure detection with very few bits. Inf. Comput. 275: 104604 (2020) - [j25]Vitaly Aksenov, Petr Kuznetsov:
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. SIGACT News 51(4): 82-84 (2020) - [c67]Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh, Athanasios Xygkis:
Online Payments by Merely Broadcasting Messages. DSN 2020: 26-38 - [c66]Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh:
Dynamic Byzantine Reliable Broadcast. OPODIS 2020: 23:1-23:18 - [c65]Petr Kuznetsov, Thibault Rieutord:
Affine Tasks for k-Test-and-Set. SSS 2020: 151-166 - [c64]Petr Kuznetsov, Andrei Tonkikh:
Asynchronous Reconfiguration with Byzantine Failures. DISC 2020: 27:1-27:17 - [c63]Petr Kuznetsov, Thibault Rieutord:
Brief Announcement: On Decidability of 2-Process Affine Models. DISC 2020: 54:1-54:3 - [i36]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. CoRR abs/2004.08348 (2020) - [i35]Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Athanasios Xygkis, Matej Pavlovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh:
Online Payments by Merely Broadcasting Messages (Extended Version). CoRR abs/2004.13184 (2020) - [i34]Petr Kuznetsov, Andrei Tonkikh:
Asynchronous Reconfiguration with Byzantine Failures. CoRR abs/2005.13499 (2020) - [i33]Petr Kuznetsov, Thibault Rieutord:
On Decidability of 2-process Affine Models. CoRR abs/2008.02099 (2020)
2010 – 2019
- 2019
- [j24]Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
The weakest failure detector for eventual consistency. Distributed Comput. 32(6): 479-492 (2019) - [j23]Petr Kuznetsov:
SPTCC 2019 Review. SIGACT News 50(4): 48-55 (2019) - [c62]Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Reconfigurable Lattice Agreement and Applications. OPODIS 2019: 31:1-31:17 - [c61]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
The Consensus Number of a Cryptocurrency. PODC 2019: 307-316 - [c60]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
Scalable Byzantine Reliable Broadcast. DISC 2019: 22:1-22:16 - [i32]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Performance Prediction for Coarse-Grained Locking. CoRR abs/1904.11323 (2019) - [i31]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
The Consensus Number of a Cryptocurrency (Extended Version). CoRR abs/1906.05574 (2019) - [i30]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
Scalable Byzantine Reliable Broadcast (Extended Version). CoRR abs/1908.01738 (2019) - [i29]Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Reconfigurable Lattice Agreement and Applications. CoRR abs/1910.09264 (2019) - 2018
- [j22]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent limitations of hybrid transactional memory. Distributed Comput. 31(3): 167-185 (2018) - [j21]Petr Kuznetsov:
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017. SIGACT News 49(1): 81-90 (2018) - [c59]Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto:
On Helping and Stacks. NETYS 2018: 107-121 - [c58]Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto:
Parallel Combining: Benefits of Explicit Synchronization. OPODIS 2018: 11:1-11:16 - [c57]Petr Kuznetsov, Nayuta Yanagisawa:
Task Computability in Unreliable Anonymous Networks. OPODIS 2018: 23:1-23:13 - [c56]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. PODC 2018: 387-396 - [c55]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC 2018: 411-413 - [e1]Taisuke Izumi, Petr Kuznetsov:
Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings. Lecture Notes in Computer Science 11201, Springer 2018, ISBN 978-3-030-03231-9 [contents] - [i28]Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
AT2: Asynchronous Trustworthy Transfers. CoRR abs/1812.10844 (2018) - 2017
- [j20]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the uncontended complexity of anonymous agreement. Distributed Comput. 30(6): 459-468 (2017) - [j19]Petr Kuznetsov, Srivatsan Ravi:
Grasping the gap between blocking and non-blocking transactional memories. J. Parallel Distributed Comput. 101: 1-16 (2017) - [j18]Petr Kuznetsov, Sathya Peri:
Non-interference and local correctness in transactional memory. Theor. Comput. Sci. 688: 103-116 (2017) - [c54]Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi:
A Concurrency-Optimal Binary Search Tree. Euro-Par 2017: 580-593 - [c53]Petr Kuznetsov, Thibault Rieutord:
Agreement Functions for Distributed Computing Models. NETYS 2017: 175-190 - [c52]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. OPODIS 2017: 9:1-9:17 - [c51]Petr Kuznetsov, Thibault Rieutord, Yuan He:
Brief Announcement: Compact Topology of Shared-Memory Adversaries. DISC 2017: 56:1-56:4 - [i27]Petr Kuznetsov, Thibault Rieutord:
Agreement Functions for Distributed Computing Models. CoRR abs/1702.00361 (2017) - [i26]Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi:
A Concurrency-Optimal Binary Search Tree. CoRR abs/1702.04441 (2017) - [i25]Vitaly Aksenov, Petr Kuznetsov:
Flat Parallelization. CoRR abs/1705.02851 (2017) - [i24]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. CoRR abs/1709.01879 (2017) - [i23]Vitaly Aksenov, Petr Kuznetsov:
Parallel Combining: Making Use of Free Cycles. CoRR abs/1710.07588 (2017) - 2016
- [j17]Liron Schiff, Stefan Schmid, Petr Kuznetsov:
In-Band Synchronization for Distributed SDN Control Planes. Comput. Commun. Rev. 46(1): 37-43 (2016) - [c50]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. OPODIS 2016: 6:1-6:17 - [c49]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. OPODIS 2016: 7:1-7:15 - [c48]Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
In the Search for Optimal Concurrency. SIROCCO 2016: 143-158 - [c47]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect Failure Detection with Very Few Bits. SSS 2016: 154-169 - [i22]Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
In the Search of Optimal Concurrency. CoRR abs/1603.01384 (2016) - [i21]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. CoRR abs/1607.05635 (2016) - [i20]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. CoRR abs/1610.01423 (2016) - 2015
- [j16]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. Distributed Comput. 28(1): 3-19 (2015) - [c46]Petr Kuznetsov, Srivatsan Ravi:
On Partial Wait-Freedom in Transactional Memory. ICDCN 2015: 10:1-10:9 - [c45]Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid:
A distributed and robust SDN control plane for transactional network updates. INFOCOM 2015: 190-198 - [c44]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the Uncontended Complexity of Anonymous Consensus. OPODIS 2015: 12:1-12:16 - [c43]Petr Kuznetsov, Srivatsan Ravi:
Progressive Transactional Memory in Time and Space. PaCT 2015: 410-425 - [c42]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. PODC 2015: 271-280 - [c41]Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
The Weakest Failure Detector for Eventual Consistency. PODC 2015: 375-384 - [c40]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. DISC 2015: 185-199 - [c39]Petr Kuznetsov, Srivatsan Ravi:
Grasping the Gap Between Blocking and Non-Blocking Transactional Memories. DISC 2015: 232-247 - [p1]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety and Deferred Update in Transactional Memory. Transactional Memory 2015: 50-71 - [i19]Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang:
A Concurrency-Optimal List-Based Set. CoRR abs/1502.01633 (2015) - [i18]Petr Kuznetsov, Srivatsan Ravi:
Why Transactional Memory Should Not Be Obstruction-Free. CoRR abs/1502.02725 (2015) - [i17]Petr Kuznetsov, Srivatsan Ravi:
Progressive Transactional Memory in Time and Space. CoRR abs/1502.04908 (2015) - [i16]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. CoRR abs/1505.02690 (2015) - [i15]Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
The Weakest Failure Detector for Eventual Consistency. CoRR abs/1505.03469 (2015) - 2014
- [c38]Petr Kuznetsov, Sathya Peri:
Non-interference and Local Correctness in Transactional Memory. ICDCN 2014: 197-211 - [c37]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Strong Equivalence Relations for Iterated Models. OPODIS 2014: 139-154 - [c36]Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. PODC 2014: 222-231 - [i14]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Live Equals Fast in Iterated Models. CoRR abs/1402.2446 (2014) - [i13]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. CoRR abs/1405.5689 (2014) - [i12]Petr Kuznetsov, Srivatsan Ravi:
On Partial Wait-Freedom in Transactional Memory. CoRR abs/1407.6876 (2014) - 2013
- [c35]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. ICDCS 2013: 601-610 - [c34]Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid:
Software transactional networking: concurrent and consistent policy composition. HotSDN 2013: 1-6 - [c33]Petr Kuznetsov:
Universal Model Simulation: BG and Extended BG as Examples. SSS 2013: 17-31 - [i11]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. CoRR abs/1301.6297 (2013) - [i10]Eli Gafni, Petr Kuznetsov, Ciprian Manolescu:
A generalized asynchronous computability theorem. CoRR abs/1304.1220 (2013) - [i9]Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid:
A Distributed SDN Control Plane for Consistent Policy Updates. CoRR abs/1305.7429 (2013) - [i8]Petr Kuznetsov:
Simple CHT: A New Derivation of the Weakest Failure Detector for Consensus. CoRR abs/1310.1761 (2013) - 2012
- [j15]Yehuda Afek, Petr Kuznetsov, Israel Nir:
Renaming and the weakest family of failure detectors. Distributed Comput. 25(6): 411-425 (2012) - [j14]Petr Kuznetsov:
Understanding Non-Uniform Failure Models. Bull. EATCS 106: 53-77 (2012) - [j13]Rachid Guerraoui, Vassos Hadzilacos, Petr Kuznetsov, Sam Toueg:
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit. SIAM J. Comput. 41(6): 1343-1379 (2012) - [j12]Petr Kuznetsov, Srivatsan Ravi:
WTTM 2011: the third workshop on the theory of transactional memory. SIGACT News 43(1): 87-92 (2012) - [c32]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. PODC 2012: 105-114 - [c31]Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
Brief announcement: From sequential to concurrent: correctness and relative efficiency. PODC 2012: 241-242 - [c30]Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa:
On the cost of composing shared-memory algorithms. SPAA 2012: 298-307 - [i7]Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
From Sequential to Concurrent: Correctness and Relative Efficiency. CoRR abs/1203.4751 (2012) - [i6]Petr Kuznetsov, Sathya Peri:
On Non-Interference of Transactions. CoRR abs/1211.6315 (2012) - 2011
- [j11]Felix C. Freiling, Rachid Guerraoui, Petr Kuznetsov:
The failure detector abstraction. ACM Comput. Surv. 43(2): 9:1-9:40 (2011) - [j10]Eli Gafni, Petr Kuznetsov:
On set consensus numbers. Distributed Comput. 24(3-4): 149-163 (2011) - [j9]Paul C. Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Sergio Rajsbaum:
The impossibility of boosting distributed service resilience. Inf. Comput. 209(6): 927-950 (2011) - [c29]Eli Gafni, Petr Kuznetsov:
Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. ICDCN 2011: 191-202 - [c28]Petr Kuznetsov, Srivatsan Ravi:
On the Cost of Concurrency in Transactional Memory. OPODIS 2011: 112-127 - [c27]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev:
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. POPL 2011: 487-498 - [c26]Ansley Post, Juan Navarro, Petr Kuznetsov, Peter Druschel:
Autonomous Storage Management for Personal Devices with PodBase. USENIX ATC 2011 - [c25]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. DISC 2011: 145-146 - [i5]Petr Kuznetsov, Srivatsan Ravi:
On the Cost of Concurrency in Transactional Memory. CoRR abs/1103.1302 (2011) - [i4]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Impersonal Failure Detection. CoRR abs/1109.3056 (2011) - 2010
- [c24]Eli Gafni, Petr Kuznetsov:
Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. OPODIS 2010: 380-394 - [c23]Eli Gafni, Petr Kuznetsov:
Brief announcement: on L-resilience, hitting sets, and colorless tasks. PODC 2010: 81-82 - [c22]Petr Kuznetsov, Stefan Schmid:
Towards Network Games with Social Preferences. SIROCCO 2010: 14-28 - [i3]Petr Kuznetsov, Stefan Schmid:
Towards Network Games with Social Preferences. CoRR abs/1001.5134 (2010) - [i2]Eli Gafni, Petr Kuznetsov:
L-Resilient Adversaries and Hitting Sets. CoRR abs/1004.4701 (2010)
2000 – 2009
- 2009
- [j8]Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. Distributed Comput. 21(5): 353-366 (2009) - [j7]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov:
The complexity of obstruction-free implementations. J. ACM 56(4): 24:1-24:33 (2009) - [j6]Petr Kuznetsov, Rodrigo Rodrigues:
BFTW3: why? when? where? workshop on the theory and practice of byzantine fault tolerance. SIGACT News 40(4): 82-86 (2009) - [c21]Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, Petros Maniatis:
Zeno: Eventually Consistent Byzantine-Fault Tolerance. NSDI 2009: 169-184 - [c20]Andreas Haeberlen, Petr Kuznetsov:
The Fault Detection Problem. OPODIS 2009: 99-114 - [c19]Eli Gafni, Petr Kuznetsov:
The weakest failure detector for solving k-set agreement. PODC 2009: 83-91 - [c18]Eli Gafni, Petr Kuznetsov:
On Set Consensus Numbers. DISC 2009: 35-47 - 2008
- [j5]Rachid Guerraoui, Petr Kouznetsov:
Failure detectors as type boosters. Distributed Comput. 20(5): 343-358 (2008) - [j4]Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The weakest failure detectors to boost obstruction-freedom. Distributed Comput. 20(6): 415-433 (2008) - [j3]Rachid Guerraoui, Petr Kuznetsov:
The gap in circumventing the impossibility of consensus. J. Comput. Syst. Sci. 74(5): 823-830 (2008) - [c17]Ansley Post, Petr Kuznetsov, Peter Druschel:
PodBase: transparent storage management for personal devices. IPTPS 2008: 1 - [c16]Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, Petros Maniatis:
Defining weakly consistent Byzantine fault-tolerant services. LADIS 2008: 11:1-11:5 - 2007
- [c15]Eli Gafni, Petr Kuznetsov:
N-Consensus is the Second Strongest Object for N+1 Processes. OPODIS 2007: 260-273 - [c14]Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. PODC 2007: 235-243 - [c13]Andreas Haeberlen, Petr Kouznetsov, Peter Druschel:
PeerReview: practical accountability for distributed systems. SOSP 2007: 175-188 - 2006
- [c12]Andreas Haeberlen, Petr Kouznetsov, Peter Druschel:
The Case for Byzantine Fault Detection. HotDep 2006 - [c11]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov:
Synchronizing without locks is inherently expensive. PODC 2006: 300-307 - [c10]Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The Weakest Failure Detectors to Boost Obstruction-Freedom. DISC 2006: 399-412 - [i1]Peter Druschel, Andreas Haeberlen, Petr Kouznetsov:
Abstracting out Byzantine Behavior. From Security to Dependability 2006 - 2005
- [j2]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Petr Kouznetsov:
Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distributed Comput. 65(4): 492-505 (2005) - [c9]Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, Nancy A. Lynch, Sergio Rajsbaum:
The Impossibility of Boosting Distributed Service Resilience. ICDCS 2005: 39-48 - [c8]Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov:
Computing with Reads and Writes in the Absence of Step Contention. DISC 2005: 122-136 - 2004
- [c7]Patrick Th. Eugster, Rachid Guerraoui, Petr Kouznetsov:
D-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability. ICDCS 2004: 636-643 - [c6]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg:
The weakest failure detectors to solve certain fundamental problems in distributed computing. PODC 2004: 338-346 - 2003
- [j1]Patrick Th. Eugster, Rachid Guerraoui, Sidath B. Handurukande, Petr Kouznetsov, Anne-Marie Kermarrec:
Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4): 341-374 (2003) - [c5]Rachid Guerraoui, Petr Kouznetsov:
On Failure Detectors and Type Boosters. DISC 2003: 292-305 - 2002
- [c4]Rachid Guerraoui, Petr Kouznetsov:
On the Weakest Failure Detector for Non-Blocking Atomic Commit. IFIP TCS 2002: 461-473 - [c3]Rachid Guerraoui, Petr Kouznetsov, Bastian Pochon:
A Note on Set Agreement with Omission Failures. GETCO 2002: 48-58 - 2001
- [c2]Patrick Th. Eugster, Rachid Guerraoui, Sidath B. Handurukande, Petr Kouznetsov, Anne-Marie Kermarrec:
Lightweight Probabilistic Broadcast. DSN 2001: 443-452 - [c1]Petr Kouznetsov, Rachid Guerraoui, Sidath B. Handurukande, Anne-Marie Kermarrec:
Reducing Noise in Gossip-Based Reliable Broadcast. SRDS 2001: 186-189
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 2025-03-04 22:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
