A simple parallel tree contraction algorithm
Journal of Algorithms
Parallel approximation algorithms for bin packing
Information and Computation
Construction of as tree from its traversals in optimal time and space
Information Processing Letters
Introduction to algorithms
Parallel general prefix computations with geometric, algebraic, and other applications
International Journal of Parallel Programming
A note on the reconstruction of a binary tree from its traversals
Information Processing Letters
Matching parentheses in parallel
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Parallel computational geometry
Parallel computational geometry
Constant time BSR solutions to L1 metric and digital geometry problems
Journal of Mathematical Imaging and Vision
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
An Efficient Implementation for the BROADCAST Instruction of BSR+
IEEE Transactions on Parallel and Distributed Systems
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
IEEE Transactions on Parallel and Distributed Systems
Optimal BSR Solutions to Several Convex Polygon Problems
The Journal of Supercomputing
A new Parallel Algorithm for the Parentheses-Matching Problem
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
The Journal of Supercomputing
Towards efficient BSP implementations of BSR programs for some computational geometry problems
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
O(1) time algorithm on BSR for constructing a binary search tree with best frequencies
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
| Hi-index | 0.01 |
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.