The following pages link to The VLSI Complexity of Sorting (Q3036700):
Displayed 15 items.
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- Constant time sorting on a processor array with a reconfigurable bus system (Q915452) (← links)
- The foundation of self-developing blob machines for spatial computing (Q933442) (← links)
- Improving the average delay of sorting (Q1007244) (← links)
- Area-time lower-bound techniques with applications to sorting (Q1091139) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Fault-tolerance VLSI sorters (Q1108014) (← links)
- Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618) (← links)
- VLSI-sorting evaluated under the linear model (Q1117701) (← links)
- Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors (Q1210315) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- Parallel integer sorting using small operations (Q1346223) (← links)
- New lower bound techniques for VLSI (Q3950484) (← links)