| Translated title of the contribution | Lower and upper bounds of SIMD-complexity for a family of Fourier-like transforms |
|---|---|
| Original language | English |
| Title of host publication | 11th IASTED International Conference on Parallel and Distributed Computing and Systems, November 3-6, 1999, Cambridge Massachusetts, USA |
| Pages | 6 s |
| Publication status | Published - 1999 |
| Publication type | B3 Article in conference proceedings |
Publication forum classification
- No publication forum level
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver