NONASSOCIATIVE PARALLEL PREFIX COMPUTATION

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	CHEN, RJ	en_US
dc.contributor.author	HOU, YS	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.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3230	-
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.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
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	44	en_US
dc.citation.issue	2	en_US
dc.citation.spage	91	en_US
dc.citation.epage	94	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.identifier.wosnumber	WOS:A1992KC42400006	-
dc.citation.woscount	1	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。