Efficient parallel prefix algorithms on fully connected message-passing computers

Yen-Chun Lin, C. M. Lin. Efficient parallel prefix algorithms on fully connected message-passing computers. In 3rd International Conference on High Performance Computing, HIPC 1996, Proceedings, Trivandrum, India, 19-22 December, 1996. pages 316-321, IEEE Computer Society, 1996. [doi]

@inproceedings{LinL96-4,
  title = {Efficient parallel prefix algorithms on fully connected message-passing computers},
  author = {Yen-Chun Lin and C. M. Lin},
  year = {1996},
  doi = {10.1109/HIPC.1996.565841},
  url = {http://doi.ieeecomputersociety.org/10.1109/HIPC.1996.565841},
  researchr = {https://researchr.org/publication/LinL96-4},
  cites = {0},
  citedby = {0},
  pages = {316-321},
  booktitle = {3rd International Conference on High Performance Computing, HIPC 1996, Proceedings, Trivandrum, India, 19-22 December, 1996},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-7557-8},
}