Parallel 3-Primes FFT Algorithm

Giovanni Cesari, Roman Maeder. Parallel 3-Primes FFT Algorithm. In Jacques Calmet, Carla Limongelli, editors, Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO 96, Karlsruhe, Germany, September 18-20, 1996, Proceedings. Volume 1128 of Lecture Notes in Computer Science, pages 174-182, Springer, 1996.

@inproceedings{CesariM96,
  title = {Parallel 3-Primes FFT Algorithm},
  author = {Giovanni Cesari and Roman Maeder},
  year = {1996},
  researchr = {https://researchr.org/publication/CesariM96},
  cites = {0},
  citedby = {0},
  pages = {174-182},
  booktitle = {Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO  96, Karlsruhe, Germany, September 18-20, 1996, Proceedings},
  editor = {Jacques Calmet and Carla Limongelli},
  volume = {1128},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61697-7},
}