Citation: Ja. Garay et Y. Moses, FULLY POLYNOMIAL BYZANTINE AGREEMENT FOR N-GREATER-THAN-3T PROCESSORSIN T+1 ROUNDS, SIAM journal on computing, 27(1), 1998, pp. 247-290
Citation: Ja. Garay et al., A SUBLINEAR TIME DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES, SIAM journal on computing, 27(1), 1998, pp. 302-316