Parallelizing Sequential Algorithms on Trees
博士 === 國立清華大學 === 資訊工程學系 === 87 === In this dissertation, we propose a general scheme for parallelizing sequential algorithms on trees. We divide these algorithms into two classes, namely Type I algorithms and Type II algorithms. For each type, we give rules depictin...
Main Authors: | Lin, Jenn-Sheng, 林振盛 |
---|---|
Other Authors: | R.C.T. Lee |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/g6cq4h |
Similar Items
-
Parallelization of implementations of purely sequential algorithms
by: A. B. Bugerya, et al.
Published: (2018-10-01) -
A Study of the Voronoi Diagram: Its Sequential and Parallel algorithms
by: 林隆淵
Published: (1998) -
Optimal parallel algorithme for some problems on trees
by: LIN, JUN-HONG, et al.
Published: (1992) -
Sequential and parallel algorithms for network packet classification
by: Rafiq, A. N. M. Ehtesham
Published: (2010) -
Parallel and sequential algorithms on some perfect graphs
by: YANG, ZHENG-YING, et al.
Published: (1992)