A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...