Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Kuznetsov, Petr - Institut Deutsche Telekom Laboratories, Technische Universität Berlin
Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated
PeerReview: Practical Accountability for Distributed Systems
A Note on Set Agreement with Omission Failures #
The Impossibility of Boosting Distributed Service Resilience Paul Attie
Simple CHT: A New Derivation of the Weakest Failure Detector for Consensus
On Set Consensus Numbers Eli Gafni1 and Petr Kuznetsov2
The Weakest Failure Detector for Non-Blocking Atomic Commit
The Gap in Circumventing the Impossibility of Consensus
Using the Topological Characterization of Synchronous Models
A Note on Set Agreement with Omission Failures
Secure Lookup without (Constrained) Flooding Bobby Bhattacharjee1
On the Weakest Failure Detector for Non-Blocking Atomic Commit
Failure Detectors as Type Boosters Rachid Guerraoui1 and Petr Kouznetsov1,2
Reducing Noise in Gossip-Based Reliable Broadcast P. Kouznetsov1
N-Consensus is the Second Strongest Object for N + 1 Processes
The Failure Detector Abstraction Felix C. Freiling, University of Mannheim
Failure Detectors as Type Boosters Rachid Guerraoui and Petr Kouznetsov
Reducing Noise in GossipBased Reliable Broadcast # P. Kouznetsov 1 R. Guerraoui 1 S. B. Handurukande 1 A.M. Kermarrec 2
J. Parallel Distrib. Comput. 65 (2005) 492505 www.elsevier.com/locate/jpdc
The Fault Detection Problem Andreas Haeberlen
The Weakest Failure Detector for Solving k-Set Agreement Petr Kuznetsov
Large-Scale Byzantine Fault Tolerance: Safe but Not Always Live Rodrigo Rodrigues
On the Weakest Failure Detector Ever Rachid Guerraoui1,2, Maurice Herlihy3, Petr Kuznetsov4, Nancy Lynch1, and Calvin Newport1
3262 (2005) COLE POLYTECHNIQUE FDRALE DE LAUSANNE
