P. Kuznetsov

Publications
Influence

P. Eugster, R. Guerraoui, S. Handurukande, P. Kuznetsov, A. Kermarrec
Computer Science
TOCS
1 November 2003

This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional Probabilistic Broadcast algorithms with a scalable memory management technique. Expand

PeerReview: practical accountability for distributed systems

Andreas Haeberlen, P. Kuznetsov, P. Druschel
Computer Science
SOSP
14 October 2007

We describe PeerReview, a system that provides accountability in distributed systems that provides Byzantine faults whose effects are observed by a correct node are eventually detected and irrefutably linked to a faulty node. Expand

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated

H. Attiya, R. Guerraoui, D. Hendler, P. Kuznetsov, M. Michael, Martin T. Vechev
Computer Science
POPL '11
26 January 2011

We prove that it is impossible to build concurrent implementations of classic and ubiquitous specifications such as sets, queues, stacks, mutual exclusion and read-modify-write operations, that completely eliminate the use of expensive synchronization. Expand

Microbially-accelerated consolidation of oil sands tailings. Pathway I: changes in porewater chemistry

T. Siddique, P. Kuznetsov, +6 authors J. Foght
Chemistry, Medicine
Front. Microbiol.
21 March 2014

Dispersed clay particles in mine tailings and soft sediments remain suspended for decades, hindering consolidation and challenging effective management of these aqueous slurries. Current geotechnical… Expand

The Case for Byzantine Fault Detection

Andreas Haeberlen, P. Kuznetsov, P. Druschel
Computer Science
HotDep
8 November 2006

We explore an alternative approach that aims at detecting rather than masking faulty behavior. Expand

The weakest failure detectors to solve certain fundamental problems in distributed computing

Carole Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kuznetsov, S. Toueg
Computer Science
PODC '04
25 July 2004

We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments -- i.e., regardless of number and timing of crashes. Expand

Lightweight probabilistic broadcast

P. Eugster, R. Guerraoui, S. Handurukande, P. Kuznetsov, A. Kermarrec
Computer Science
International Conference on Dependable Systems…
1 July 2001

The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Expand

Computing with Reads and Writes in the Absence of Step Contention

H. Attiya, R. Guerraoui, P. Kuznetsov
Computer Science
DISC
26 September 2005

We present a generic obstruction-free object implementation that has linear contention-free step complexity (number of reads and writes taken by a process running solo) and uses a linear number of read/write objects. Expand

Zeno: Eventually Consistent Byzantine-Fault Tolerance

A. Singh, P. Fonseca, P. Kuznetsov, Rodrigo Rodrigues, Petros Maniatis
Computer Science
NSDI
22 April 2009

This paper presents a novel BFT state machine replication protocol called Zeno that trades consistency for higher availability. Expand

Mutual exclusion in asynchronous systems with failure detectors

Carole Delporte-Gallet, H. Fauconnier, R. Guerraoui, P. Kuznetsov
Computer Science
J. Parallel Distributed Comput.
1 April 2005

This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. Expand

Recommended Authors