1 citations · 3 across the 5 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2014
Interactive Consistency in practical, mostly-asynchronous systems
Panos Diamantopoulos, Stathis Maneas, Christos Patsonakis +2
Interactive consistency is the problem in which n nodes, where up to t may be byzantine, each with its own private value, run an algorithm that allows all non-faulty nodes to infer…
cs.DC2011★ 1 cited
On the Practicality of `Practical' Byzantine Fault Tolerance
Nikos Chondros, Konstantinos Kokordelis, Mema Roussopoulos
Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT sys…