A spanning tree T of graph G is a ρ-approximate universal Steiner
tree (...
Sharding is used to address the performance and scalability issues of th...
We study computer systems with transactions executed on a set of shared
...
A distributed directory is an overlay data structure on a graph G that
h...
Population protocols model information spreading in networks where pairw...
The performance of partially synchronous BFT-based consensus protocols i...
There is surge of interest to the blockchain technology not only in the
...
Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in
c...