1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHEN, RJen_US
dc.contributor.authorHOU, YSen_US
dc.date.accessioned2014-12-08T15:04:44Z-
dc.date.available2014-12-08T15:04:44Z-
dc.date.issued1992-11-19en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/11536/3230-
dc.description.abstractAssociativity 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.isoen_USen_US
dc.subjectPARALLEL ALGORITHMSen_US
dc.subjectASSOCIATIVE BINARY OPERATIONen_US
dc.subjectPARALLEL PREFIX COMPUTATIONen_US
dc.subjectONE-WAY FINITE AUTOMATAen_US
dc.titleNONASSOCIATIVE PARALLEL PREFIX COMPUTATIONen_US
dc.typeArticleen_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume44en_US
dc.citation.issue2en_US
dc.citation.spage91en_US
dc.citation.epage94en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1992KC42400006-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. A1992KC42400006.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...