完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | TANG, CY | en_US |
dc.contributor.author | LEE, RCT | en_US |
dc.date.accessioned | 2014-12-08T15:06:16Z | - |
dc.date.available | 2014-12-08T15:06:16Z | - |
dc.date.issued | 1984 | en_US |
dc.identifier.issn | 0020-0255 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/4848 | - |
dc.language.iso | en_US | en_US |
dc.title | OPTIMAL SPEEDING UP OF PARALLEL ALGORITHMS BASED UPON THE DIVIDE-AND-CONQUER STRATEGY | en_US |
dc.type | Article | en_US |
dc.identifier.journal | INFORMATION SCIENCES | en_US |
dc.citation.volume | 32 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 173 | en_US |
dc.citation.epage | 186 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1984TA78700002 | - |
dc.citation.woscount | 4 | - |
顯示於類別: | 期刊論文 |