Muhammad H. Alsuwaiyel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2022

Parallel AlgorithmsMuhammad H. Alsuwaiyel. Volume 16 of Lecture Notes Series on Computing, WorldScientific, 2022. [doi]

2021

Algorithms - Design Techniques and Analysis, Second EditionMuhammad H. Alsuwaiyel. Volume 15 of Lecture Notes Series on Computing, WorldScientific, 2021. [doi]

2016

Algorithms - Design Techniques and Analysis (Revised Edition)Muhammad H. Alsuwaiyel. Volume 14 of Lecture Notes Series on Computing, WorldScientific, 2016. [doi]

2011

k-ary hypercube tree and its average distanceMuhammad H. Alsuwaiyel. ijcm, 88(11):2258-2274, 2011. [doi]

2010

On the average distance of the hypercube treeMuhammad H. Alsuwaiyel. ijcm, 87(6):1208-1216, 2010. [doi]

On computing an optimal permutation of ranks for multiselectionMuhammad H. Alsuwaiyel. cma, 60(8):2200-2203, 2010. [doi]

2003

Computing the Euclidean Distance Transform on a Linear Array of ProcessorsMarina L. Gavrilova, Muhammad H. Alsuwaiyel. tjs, 25(2):177-185, 2003. [doi]

2002

An improved parallel algorithm for a geometric matching problem with application to trapezoid graphsMuhammad H. Alsuwaiyel. paapp, 17(2):147-155, 2002.

Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean MetricMarina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov. pdpta 2002: 1261-1270

2001

An optimal parallel algorithm for the multiselection problemMuhammad H. Alsuwaiyel. pc, 27(6):861-865, 2001.

A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of DiametersMuhammad H. Alsuwaiyel. jpdc, 61(5):662-666, 2001. [doi]

Two Algorithms for Computing the Euclidean Distance TransformMarina L. Gavrilova, Muhammad H. Alsuwaiyel. ijig, 1(4):635-645, 2001.

2000

On the Multiselection ProblemMuhammad H. Alsuwaiyel. pdpta 2000:

1999

Algorithms - Design Techniques and AnalysisMuhammad H. Alsuwaiyel. Volume 7 of Lecture Notes Series on Computing, World Scientific, 1999. [doi]

An Improved Parallel Algorithm for a Geometric Matching Problem with ApplicationsMuhammad H. Alsuwaiyel. pdpta 1999: 1697-1701

1997

Two Algorithms for the Sum of Diameters Problem and a Related ProblemMuhammad H. Alsuwaiyel. ijcga, 7(5):493-508, 1997.

1996

Finding a Shortest Hamiltonian Path Inside a Simple PolygonMuhammad H. Alsuwaiyel. ipl, 59(4):207-210, 1996. [doi]

1995

Finding an Approximate Minimum-Link Visibility Path Inside a Simple PolygonMuhammad H. Alsuwaiyel, D. T. Lee. ipl, 55(2):75-79, 1995. [doi]

1993

Minimal Link Visibility Paths Inside a Simple PolygonMuhammad H. Alsuwaiyel, D. T. Lee. comgeo, 3:1-25, 1993.

Sign in or sign up to see more results.

runs on WebDSL