Pages that link to "Item:Q3911406"
From MaRDI portal
The following pages link to Parallel Sorting with Constant Time for Comparisons (Q3911406):
Displaying 13 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Graphs whose every transitive orientation contains almost every relation (Q581415) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- Parallel comparison merging of many-ordered lists (Q807015) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Sorting in rounds (Q1117700) (← links)
- Sorting in one round (Q1152382) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Parallel sorting (Q1837535) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
