This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
The general stubborn set approach to CTL model checking 2] has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled tra...
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
Miguel Correia, Alysson Neves Bessani, Paulo Ver&i...