The topic of our research is to study how randomization is used to solve Byzantine Agreement problem in different computational models. Byzantine Agreement is a classic distributed computing problem, where processors try to agree on a value, but some of the processors try to disrupt the agreement or make sure that the algorithm never terminates. […]
Read More