409 citations · 767 across the 29 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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…
cs.DC2017★ 12 cited
DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains
Tyler Crain, Vincent Gramoli, Mikel Larrea +1
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence o…