default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhammad H. Alsuwaiyel
Person information
- affiliation: King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b4]Muhammad H. Alsuwaiyel:
Parallel Algorithms. Lecture Notes Series on Computing 16, WorldScientific 2022, ISBN 9789811252976, pp. 1-400- 2021
- [b3]Muhammad H. Alsuwaiyel:
Algorithms - Design Techniques and Analysis, Second Edition. Lecture Notes Series on Computing 15, WorldScientific 2021, ISBN 9789811238642, pp. 1-756
2010 – 2019
- 2016
- [b2]Muhammad H. Alsuwaiyel:
Algorithms - Design Techniques and Analysis (Revised Edition). Lecture Notes Series on Computing 14, WorldScientific 2016, ISBN 9789814723640, pp. 1-572 - 2011
- [j12]Muhammad H. Alsuwaiyel:
On the k-ary hypercube tree and its average distance. Int. J. Comput. Math. 88(11): 2258-2274 (2011) - 2010
- [j11]Muhammad H. Alsuwaiyel:
On computing an optimal permutation of ranks for multiselection. Comput. Math. Appl. 60(8): 2200-2203 (2010) - [j10]Muhammad H. Alsuwaiyel:
On the average distance of the hypercube tree. Int. J. Comput. Math. 87(6): 1208-1216 (2010)
2000 – 2009
- 2003
- [j9]Marina L. Gavrilova
, Muhammad H. Alsuwaiyel:
Computing the Euclidean Distance Transform on a Linear Array of Processors. J. Supercomput. 25(2): 177-185 (2003) - 2002
- [j8]Muhammad H. Alsuwaiyel:
An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs. Parallel Algorithms Appl. 17(2): 147-155 (2002) - [c3]Marina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov:
Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric. PDPTA 2002: 1261-1270 - 2001
- [j7]Marina L. Gavrilova, Muhammad H. Alsuwaiyel:
Two Algorithms for Computing the Euclidean Distance Transform. Int. J. Image Graph. 1(4): 635-645 (2001) - [j6]Muhammad H. Alsuwaiyel:
A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. J. Parallel Distributed Comput. 61(5): 662-666 (2001) - [j5]Muhammad H. Alsuwaiyel:
An optimal parallel algorithm for the multiselection problem. Parallel Comput. 27(6): 861-865 (2001) - 2000
- [c2]Muhammad H. Alsuwaiyel:
On the Multiselection Problem. PDPTA 2000
1990 – 1999
- 1999
- [b1]Muhammad H. Alsuwaiyel:
Algorithms - Design Techniques and Analysis. Lecture Notes Series on Computing 7, World Scientific 1999, ISBN 981-02-3740-5, pp. 1-544 - [c1]Muhammad H. Alsuwaiyel:
An Improved Parallel Algorithm for a Geometric Matching Problem with Applications. PDPTA 1999: 1697-1701 - 1997
- [j4]Muhammad H. Alsuwaiyel:
Two Algorithms for the Sum of Diameters Problem and a Related Problem. Int. J. Comput. Geom. Appl. 7(5): 493-508 (1997) - 1996
- [j3]Muhammad H. Alsuwaiyel:
Finding a Shortest Hamiltonian Path Inside a Simple Polygon. Inf. Process. Lett. 59(4): 207-210 (1996) - 1995
- [j2]Muhammad H. Alsuwaiyel, D. T. Lee:
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. 55(2): 75-79 (1995) - 1993
- [j1]Muhammad H. Alsuwaiyel, D. T. Lee:
Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. 3: 1-25 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
