Add to ORKG[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0006-3835&DestApp=JCR&RQ=IF_CAT_BOXPLO
Recent advances in the design of efficient parallel algorithms have been largely focusing on the now...
summary:In recent years, scientists have discussed the possibilities of increasing the computing pow...
[[abstract]]The data dependence graph (DDG) is a useful tool for the parallelism detection which is ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
This report records the author’s work during the project’s period. This project will study paral...
Includes bibliographical references ( leaves 61-64).One way the early use of parallel computers has ...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
The segment tree is a simple and important data structure in computational geometry [7,11]. We prese...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Efficiently processing large graphs is challenging, since parallel graph algorithms suffer from poor...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Graphs are widely used in manyapplications. Some of the applications that usedgraph theory are: anal...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
Recent advances in the design of efficient parallel algorithms have been largely focusing on the now...
summary:In recent years, scientists have discussed the possibilities of increasing the computing pow...
[[abstract]]The data dependence graph (DDG) is a useful tool for the parallelism detection which is ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
This report records the author’s work during the project’s period. This project will study paral...
Includes bibliographical references ( leaves 61-64).One way the early use of parallel computers has ...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
The segment tree is a simple and important data structure in computational geometry [7,11]. We prese...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Efficiently processing large graphs is challenging, since parallel graph algorithms suffer from poor...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Graphs are widely used in manyapplications. Some of the applications that usedgraph theory are: anal...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
Recent advances in the design of efficient parallel algorithms have been largely focusing on the now...
summary:In recent years, scientists have discussed the possibilities of increasing the computing pow...
[[abstract]]The data dependence graph (DDG) is a useful tool for the parallelism detection which is ...