Pages that link to "Item:Q919827"
From MaRDI portal
The following pages link to Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827):
Displaying 4 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
