Pages that link to "Item:Q1091826"
From MaRDI portal
The following pages link to Lower bounds for sorting on mesh-connected architectures (Q1091826):
Displaying 13 items.
- Integer sorting on a mesh-connected array of processors (Q688438) (← links)
- A unified algorithm for sorting on multidimensional mesh-connected processors (Q751246) (← links)
- Low-gate quantum golden collision finding (Q832353) (← links)
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays (Q915448) (← links)
- Sorting in constant number of row and column phases on a mesh (Q1105380) (← links)
- Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618) (← links)
- Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
- Indexing functions and time lower bounds for sorting on a mesh-connected computer (Q1192947) (← links)
- Packet Routing on grids of processors (Q1207327) (← links)
- A mathematical model for mesh's dynamic behavior (Q1336879) (← links)
- A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
- k-k Sorting on the multi-mesh (Q5055924) (← links)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes (Q6102292) (← links)