In this paper, the authors highlight the existence of close relations between the execution time, efficiency and number of communication rounds in a family of CGM-based parallel algorithms for the optimal binary search tree problem (OBST). In this case, these three parameters cannot be...

The traditional Monte Carlo simulation of order transitions in a ferromagnet (or in a binary crystalline alloy) is carried out by generating a sequence of local swaps (spin reversals or exchanges of atoms) on a finite lattice, each of which in turn is accepted or rejected according to...