W. Shen

TL;DR: This paper proposes a time-optimal algorithm to solve the multiple search problem on meshes with multiple broadcasting and presents some surprising applications of themultiple search algorithm to computer graphics, image processing, robotics, and computational geometry.

TL;DR: In this article, the authors proposed a time-optimal algorithm to solve the multiple search problem on meshes with multiple broadcasting, which runs in formula] × formula] time and is shown to be time optimal.

TL;DR: It is shown that Ω(log n) is a time lower bound on the CREW-PRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallest-area enclosing rectangle, and the largest-area inscribed triangle of a convex n-gon.

TL;DR: This work shows that any algorithm that solves the semigroup computation problem must take Ω(log m) time if and time for and designs an algorithm whose running time matches the lower bound.

TL;DR: The first lower bound and the first time-optimal algorithm which apply to the entire range of m (2 ≤ m ≤ n) are presented and the bound is tight by designing an algorithm whose running time matches the lower bound.