Pages that link to "Item:Q1091139"
From MaRDI portal
The following pages link to Area-time lower-bound techniques with applications to sorting (Q1091139):
Displaying 8 items.
- Semelectivity is not sufficient (Q751288) (← links)
- Area complexity of merging (Q807018) (← links)
- The area-time complexity of the greatest common divisor problem: A lower bound (Q910227) (← links)
- Optimal tradeoffs for addition on systolic arrays (Q916387) (← links)
- The area-time complexity of the VLSI counter (Q1096385) (← links)
- On problem transformability in VLSI (Q1101222) (← links)
- On the VLSI complexity of some arithmetic and numerical problems (Q1103401) (← links)
- On the expansion and diameter of bluetooth-like topologies (Q1946491) (← links)
