Pages that link to "Item:Q1112618"
From MaRDI portal
The following pages link to Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618):
Displaying 8 items.
- Integer sorting on a mesh-connected array of processors (Q688438) (← links)
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays (Q915448) (← links)
- Lower bounds for sorting on mesh-connected architectures (Q1091826) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Indexing functions and time lower bounds for sorting on a mesh-connected computer (Q1192947) (← links)
- A time-optimal distributed sorting algorithm on a line network. (Q1853029) (← links)
- Space and time complexities of balanced sorting on processor arrays (Q2639641) (← links)
- Tight Bounds on the Complexity of Parallel Sorting (Q3219774) (← links)