Muhammad H. Alsuwaiyel

Publication Activity (10 Years)

Years Active: 1993-2011
Publications (10 Years): 0

Publications

Muhammad H. Alsuwaiyel
-ary hypercube tree and its average distance. Int. J. Comput. Math. 88 (11) (2011)
Muhammad H. Alsuwaiyel
On computing an optimal permutation of ranks for multiselection. Comput. Math. Appl. 60 (8) (2010)
Muhammad H. Alsuwaiyel
On the average distance of the hypercube tree. Int. J. Comput. Math. 87 (6) (2010)
Marina L. Gavrilova, Muhammad H. Alsuwaiyel
Computing the Euclidean Distance Transform on a Linear Array of Processors. J. Supercomput. 25 (2) (2003)
Marina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov
Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric. PDPTA (2002)
Muhammad H. Alsuwaiyel
An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs. Parallel Algorithms Appl. 17 (2) (2002)
Muhammad H. Alsuwaiyel
An optimal parallel algorithm for the multiselection problem. Parallel Comput. 27 (6) (2001)
Muhammad H. Alsuwaiyel
A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. J. Parallel Distributed Comput. 61 (5) (2001)
Marina L. Gavrilova, Muhammad H. Alsuwaiyel
Two Algorithms for Computing the Euclidean Distance Transform. Int. J. Image Graph. 1 (4) (2001)
Muhammad H. Alsuwaiyel
On the Multiselection Problem. PDPTA (2000)
Muhammad H. Alsuwaiyel
An Improved Parallel Algorithm for a Geometric Matching Problem with Applications. PDPTA (1999)
Muhammad H. Alsuwaiyel
Two Algorithms for the Sum of Diameters Problem and a Related Problem. Int. J. Comput. Geom. Appl. 7 (5) (1997)
Muhammad H. Alsuwaiyel
Finding a Shortest Hamiltonian Path Inside a Simple Polygon. Inf. Process. Lett. 59 (4) (1996)
Muhammad H. Alsuwaiyel, D. T. Lee
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. 55 (2) (1995)
Muhammad H. Alsuwaiyel, D. T. Lee
Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. 3 (1993)