37 citations · 76 across the 20 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DC2017
Generalized Paxos Made Byzantine (and Less Complex)
Miguel Pires, Srivatsan Ravi, Rodrigo Rodrigues
One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification o…
cs.DC2017
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…