The following pages link to Muhammad H. Alsuwaiyel (Q671604):
Displaying 15 items.
- (Q197565) (redirect page) (← links)
- On computing an optimal permutation of ranks for multiselection (Q623154) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Computing the Euclidean distance transform on a linear array of processors (Q1404307) (← links)
- (Q2998872) (← links)
- On the<i>k</i>-ary hypercube tree and its average distance (Q3101622) (← links)
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS (Q3150028) (← links)
- On the average distance of the hypercube tree (Q3568450) (← links)
- Two Algorithms for the Sum of Diameters Problem and a Related Problem (Q4365030) (← links)
- Algorithms (Q5021710) (← links)
- Parallel Algorithms (Q5067653) (← links)
- A random algorithm for multiselection (Q5424050) (← links)
- Algorithms (Q5890565) (← links)
- An optimal parallel algorithm for the multiselection problem (Q5940996) (← links)
- A parallel algorithm for partitioning a point set to minimize the maximum of diameters (Q5943108) (← links)
