Parallel general prefix computations with geometric, algebraic, and other applications
- 1 December 1989
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 18 (6) , 485-503
- https://doi.org/10.1007/bf01381719
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Two algorithms for constructing a binary tree from its traversalsInformation Processing Letters, 1988
- An O(√n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processorsInformation Processing Letters, 1988
- Alternative methods for the reconstruction of trees from their traversalsBIT Numerical Mathematics, 1987
- Optimal computation of prefix sums on a binary tree of processorsInternational Journal of Parallel Programming, 1987
- algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computerInformation Processing Letters, 1986
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- Listing and counting subtrees of equal size of a binary treeInformation Processing Letters, 1983
- Database Location in Computer NetworksJournal of the ACM, 1980
- A Note on Enumerating Binary TreesJournal of the ACM, 1980
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977