On problem transformability in VLSI
From MaRDI portal
Recommendations
Cites work
- Area-time lower-bound techniques with applications to sorting
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3894498 (Why is no real title available?)
- Information transfer and area-time tradeoffs for VLSI multiplication
- Lower bounds on communication complexity
- Minimum Storage Sorting Networks
- Parallel Scheduling Algorithms
- The Area-Time Complexity of Binary Multiplication
- Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
Cited in
(3)
This page was built for publication: On problem transformability in VLSI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101222)