The following pages link to Sorting and Merging in Rounds (Q3956411):
Displaying 11 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Graphs whose every transitive orientation contains almost every relation (Q581415) (← links)
- Parallel comparison merging of many-ordered lists (Q807015) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- Parallel selection (Q913517) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Sorting in rounds (Q1117700) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Parallel sorting (Q1837535) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
