NONASSOCIATIVE PARALLEL PREFIX COMPUTATION
| dc.citation.epage | 94 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 91 | en_US |
| dc.citation.volume | 44 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | CHEN, RJ | en_US |
| dc.contributor.author | HOU, YS | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:04:44Z | |
| dc.date.available | 2014-12-08T15:04:44Z | |
| dc.date.issued | 1992-11-19 | en_US |
| dc.description.abstract | Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications. | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3230 | |
| dc.identifier.wosnumber | WOS:A1992KC42400006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | PARALLEL ALGORITHMS | en_US |
| dc.subject | ASSOCIATIVE BINARY OPERATION | en_US |
| dc.subject | PARALLEL PREFIX COMPUTATION | en_US |
| dc.subject | ONE-WAY FINITE AUTOMATA | en_US |
| dc.title | NONASSOCIATIVE PARALLEL PREFIX COMPUTATION | en_US |
| dc.type | Article | en_US |