Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines

Daniel Gajski. Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines. In Wolfgang Händler, editor, CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, Nürnberg, Germany, June 10-12, 1981, Proceedings. Volume 111 of Lecture Notes in Computer Science, pages 343-357, Springer, 1981.

@inproceedings{Gajski81,
  title = {Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines},
  author = {Daniel Gajski},
  year = {1981},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Gajski81},
  cites = {0},
  citedby = {0},
  pages = {343-357},
  booktitle = {CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, Nürnberg, Germany, June 10-12, 1981, Proceedings},
  editor = {Wolfgang Händler},
  volume = {111},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-10827-0},
}