|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Mikhail J. Atallah , Frank Dehne , Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay, Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.204-214, July 21-24, 1991, Hilton Head, South Carolina, United States
[doi> 10.1145/113379.113398]
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
| |
7
|
S. Hambrusch, X. He, and R. Miller, Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer, Technical Report, 1992.
|
| |
8
|
|
| |
9
|
|
| |
10
|
D. Nassimi and S. Sahni, Finding connected components and connected ones on a mesh-connected parallel computer, SIAM Journal on Computing, 9 (1980), 744-757.
|
| |
11
|
D. Nassimi and S. Sahni, Bitonic sort on a meshconnected parallel computer, IEEE Transactions on Computers, C-27(1):2-7, January t979.
|
| |
12
|
D. Nassimi and S. Sahni, Data broadcasting in SIMD computers, IEEE Transactions on Computers, C-30(2):101-107, February 1981.
|
| |
13
|
|
| |
14
|
J. Reif and Q.F. Stout, Optimal component labeling algorithms for mesh computers and VLSI, to appear.
|
| |
15
|
|
| |
16
|
Q.F. Stout, Tree-based graph algorithms for some parallel computers, Proc. of ~he 1985 International Conference on Parallel Processing, 1985, pp. 727- 730.
|
 |
17
|
|
|