Muhammad H. Alsuwaiyel

According to our database, Muhammad H. Alsuwaiyel authored at least 19 papers between 1993 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Parallel Algorithms

Muhammad H. Alsuwaiyel

Lecture Notes Series on Computing 16, WorldScientific, ISBN: 9789811252990, 2022

2021

Algorithms - Design Techniques and Analysis, Second Edition

Muhammad H. Alsuwaiyel

Lecture Notes Series on Computing 15, WorldScientific, ISBN: 9789811238666, 2021

2016

Algorithms - Design Techniques and Analysis (Revised Edition)

Muhammad H. Alsuwaiyel

Lecture Notes Series on Computing 14, WorldScientific, ISBN: 9789814723664, 2016

2011

On the <i>k</i>-ary hypercube tree and its average distance.

Muhammad H. Alsuwaiyel

Int. J. Comput. Math., 2011

2010

On the average distance of the hypercube tree.

Muhammad H. Alsuwaiyel

Int. J. Comput. Math., 2010

On computing an optimal permutation of ranks for multiselection.

Muhammad H. Alsuwaiyel

Comput. Math. Appl., 2010

2003

Computing the Euclidean Distance Transform on a Linear Array of Processors.

Marina L. Gavrilova, Muhammad H. Alsuwaiyel

J. Supercomput., 2003

2002

An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs.

Muhammad H. Alsuwaiyel

Parallel Algorithms Appl., 2002

Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric.

Marina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002

2001

An optimal parallel algorithm for the multiselection problem.

Muhammad H. Alsuwaiyel

Parallel Comput., 2001

A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters.

Muhammad H. Alsuwaiyel

J. Parallel Distributed Comput., 2001

Two Algorithms for Computing the Euclidean Distance Transform.

Marina L. Gavrilova, Muhammad H. Alsuwaiyel

Int. J. Image Graph., 2001

2000

On the Multiselection Problem.

Muhammad H. Alsuwaiyel

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

An Improved Parallel Algorithm for a Geometric Matching Problem with Applications.

Muhammad H. Alsuwaiyel

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Algorithms - Design Techniques and Analysis

Muhammad H. Alsuwaiyel

Lecture Notes Series on Computing 7, World Scientific, ISBN: 981-02-3740-5, 1999

1997

Two Algorithms for the Sum of Diameters Problem and a Related Problem.

Muhammad H. Alsuwaiyel

Int. J. Comput. Geom. Appl., 1997

1996

Finding a Shortest Hamiltonian Path Inside a Simple Polygon.

Muhammad H. Alsuwaiyel

Inf. Process. Lett., 1996

1995

Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon.

Muhammad H. Alsuwaiyel, D. T. Lee

Inf. Process. Lett., 1995

1993

Minimal Link Visibility Paths Inside a Simple Polygon.

Muhammad H. Alsuwaiyel, D. T. Lee

Comput. Geom., 1993