@article{oai:nitech.repo.nii.ac.jp:00004950,
 author = {Chen, Wei and Wada, Koichi},
 issue = {5},
 journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
 month = {May},
 note = {Multi-level divide-and-conquer (MDC) is a generalized divide-and-conquer technique, which consists of more than one division step organized hierarchically. In this paper, we investigate the paradigm of the MDC and show that it is an efficient technique for designing parallel algorithms. The following parallel algorithms are used for studying the MDC: finding the convex hull of discs, finding the upper envelope of line segments, finding the farthest neighbors of a convex polygon and finding all the row maxima of a totally monotone matrix. The third and the fourth algorithms are newly presented. Our discussion is based on the EREW PRAM, but the methods discussed here can be applied to any parallel computation models., application/pdf},
 pages = {1201--1208},
 title = {Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer},
 volume = {E84-A},
 year = {2001}
}