Authors: BERKMAN O MATIAS Y RAGDE P

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

Authors: BERKMAN O VISHKIN U

Citation: O. Berkman et U. Vishkin, ALMOST FULLY-PARALLEL PARENTHESES MATCHING, Discrete applied mathematics, 57(1), 1995, pp. 11-28

Authors: BERKMAN O ILIOPOULOS CS PARK K

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

Authors: BERKMAN O VISHKIN U

Citation: O. Berkman et U. Vishkin, FINDING LEVEL-ANCESTORS IN TREES, Journal of computer and system sciences, 48(2), 1994, pp. 214-230

Authors: BERKMAN O VISHKIN U

Citation: O. Berkman et U. Vishkin, ON PARALLEL INTEGER MERGING, Information and computation, 106(2), 1993, pp. 266-285