Computing a ham-sandwich cut in two dimensions
Journal of Symbolic Computation
Hi-index | 0.00 |
Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. We give a general method that trims a factor o f 0(logn) time (or more) for many applications of this technique.