Citation: O. Berkman et al., TRIPLY-LOGARITHMIC PARALLEL UPPER AND LOWER BOUNDS FOR MINIMUM AND RANGE MINIMA OVER SMALL DOMAINS, Journal of algorithms (Print), 28(2), 1998, pp. 197-215
Citation: O. Berkman et al., THE SUBTREE MAX GAP PROBLEM WITH APPLICATION TO PARALLEL STRING COVERING, Information and computation, 123(1), 1995, pp. 127-137
Authors:
BERKMAN O
JAJA J
KRISHNAMURTHY S
THURIMELLA R
VISHKIN U
Citation: O. Berkman et al., TOP-BOTTOM ROUTING AROUND A RECTANGLE IS AS EASY AS COMPUTING PREFIX MINIMA, SIAM journal on computing, 23(3), 1994, pp. 449-465