This Article 
 Bibliographic References 
 Add to: 
Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals
February 1996 (vol. 7 no. 2)
pp. 218-224

Abstract—Recently Akl et al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solutions to the parenthesis matching, decoding binary trees in bitstring representation, generating next tree shape in B-order, and the reconstruction of binary trees from their traversals, using the BSR model. They are the first constant time solutions to mentioned problems on any model of computation. The number of processors used is equal to the input size, for each problem. A new algorithm for sorting integers is also presented.

[1] S.G. Akl, "Memory access in models of parallel computation: From folklore to synergy and beyond," Algorithms and Data Structures.Berlin: Springer Verlag, pp. 92-104, 1991.
[2] A. Anderson and S. Carlsson, "Construction of a tree from its traversals in optimal time and space," Information Processing Letters, vol. 34, no. 1, pp. 21-25, 1990.
[3] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka, "A Simple Parallel Tree Contraction Algorithm," J. Algorithms, vol. 10, no. 2, pp. 287-302, 1989.
[4] S.G. Akl, L. Fava Lindon, and G.R. Guenther, "Broadcasting with selective reduction on an optimal PRAM circuit," Technique et Science Informatiques, vol. 4, pp. 261-268, 1991.
[5] S.G. Akl and G.R. Guenther, "Application of BSR to the maximal sum subsegment problem," Int'l J. High Speed Computing, vol. 3, no. 2, pp. 107-119, 1991.
[6] S.G. Akl and G.R. Guenther, "Broadcasting with selective reduction," Proc. 11th IFIP Congress,San Francisco, pp. 515-520, Aug. 1989.
[7] S.G. Akl and K.A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, N.J., 1993.
[8] R.J. Anderson, E.W. Mayr, and M.K. Warmuth, "Parallel approximation algorithms for bin packing," Inform. and Comput., vol. 82, pp. 262-277, 1989.
[9] S.G. Akl and I. ${\bf Stojmenovi\acute c}$, “Multiple Criteria BSR: An Implementation and Applications to Computational Geometry Problems,” Proc. 27th Hawaii Int'l Conf. System Sciences, vol. II, pp. 159-168, Maui, Hawaii, Jan. 1994.
[10] S.G. Akl and I. Stojmenovic, "Generating binary trees in parallel," Proc. Allerton Conf. on Commun., Control and Computing,Monticello, Ill., pp. 225-233, Sept.30- Oct.2, 1992.
[11] H.A. Burgdorff, S. Jajodia, F.N. Springsteel, and Y. Zalstein, "Alternative methods for the reconstruction of trees from their traversals," BIT, vol. 27, pp. 134-140, 1987.
[12] C.C.Y. Chen and S.K. Das, "A cost optimal parallel algorithm for the parentheses matching problem on an EREW PRAM," Proc. Fifth Int'l Parallel Proc. Symp., pp. 132-137, May 1991.
[13] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[14] K. Diks and W. Rytter, "On optimal parallel computations for sequences of brackets," manuscript, 1990.
[15] L.F. Lindon and S.G. Akl, “An Optimal Implementation of Broadcasting with Selective Reduction,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 256-269, Mar. 1993.
[16] N. Gabrani and Priti Shankar, "A note on the reconstruction of a binary tree from its traversals," Information Processing Letters, vol. 42, pp. 117-119, 1992.
[17] C. Levcopoulos and O. Petersson, "Matching parentheses in parallel," Discrete Applied Mathematics, vol. 40, pp. 423-431, 1992.
[18] E. Makinen, "Constructing a binary tree from its traversals," BIT, vol. 29, pp. 572-575, 1989.
[19] R.A. Melter and I. ${\bf Stojmenovi \acute c}$, “Solving City Block Metric and Digital Geometry Problems on the BSR Model of Parallel Computation,” J. Math. Imaging and Vision, vol. 5, pp. 119-127, 1995.
[20] S. Olariu, C. Overstreet, and Z. Wen, "An optimal parallel algorithms to reconstruct a binary tree from its traversals," Proc. Int'l Conf. Computing and Information, Lecture Notes in Computer Science, vol. 497, pp. 484-495, 1991.
[21] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal parallel encoding and decoding for trees," Int'l J. Foundations of Computer Science, vol. 3, pp. 1-10, 1992.
[22] F. Ruskey and T.C. Hu, "Generating binary trees lexicographically," SIAM J. Comput., vol. 6, pp. 745-758, 1977.
[23] F. Springsteel and I. ${\bf Stojmenovi\acute c}$, “Parallel General Prefix Computations with Geometric, Algebraic, and Other Applications,” Int'l J. Parallel Program, vol. 18, no. 6, pp. 485-503, 1989.
[24] A.E. Trojanowski, "Ranking and listing algorithms for k-ary trees," SIAM J. Comput., vol. 7, no. 4, pp. 492-509, 1978.
[25] W.W. Tsang, T.L. Lam, and Y.L. Chin, "An optimal EREW parallel algorithm for parenthesis matching," Proc. Int'l Conf. Par. Proc., vol. 3, pp. 185-192, 1989.
[26] S. Zaks, "Lexicographic generation of ordered trees," Theoretical Computer Science, vol. 10, pp. 63-82, 1980.

Index Terms:
Binary tree, broadcast, parallel algorithm, parallel prefix, parenthesis matching, reduction, selection, sorting, tree traversals.
Ivan Stojmenovic, "Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 218-224, Feb. 1996, doi:10.1109/71.485530
Usage of this product signifies your acceptance of the Terms of Use.