8 citations · 11 across the 5 of their papers we have counts for
6 papers
Agreement Functions for Distributed Computing Models
Petr Kuznetsov, Thibault Rieutord
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function de…
A Concurrency-Optimal Binary Search Tree
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov +2
The paper presents the first \emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an intern…
In the Search of Optimal Concurrency
Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
Implementing a concurrent data structure typically begins with defining its sequential specification. However, when used \emph{as is}, a nontrivial sequential data structure, such…
On the Space Complexity of Set Agreement
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov +1
The -set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to different input values. In a system of …
The Weakest Failure Detector for Eventual Consistency
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov +2
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a major…
Safety of Deferred Update in Transactional Memory
Hagit Attiya, Sandeep Hans, Petr Kuznetsov +1
Transactional memory allows the user to declare sequences of instructions as speculative \emph{transactions} that can either \emph{commit} or \emph{abort}. If a transaction commits…