Lower bounds on the iteration time and the number of resources for functional pipelined data flow graphs
| dc.contributor.author | Carlson, Bradley S. | en_US |
| dc.contributor.author | Hu, Yuan | |
| dc.contributor.author | Ghouse, Ahmed | |
| dc.date.accessioned | 2007-07-17T16:54:09Z | |
| dc.date.available | 2007-07-17T16:54:09Z | |
| dc.date.issued | 1993 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1951/37299 | |
| dc.format.extent | 5544942 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Stony Brook, N.Y.: State University of New York at Stony Brook, College of Engineering. | en_US |
| dc.title | Lower bounds on the iteration time and the number of resources for functional pipelined data flow graphs | en_US |
| dc.type | Technical Report | en_US |
Files in this item
This item appears in the following Collection(s)
-
Community Members' Scholarship [SBU CEAS] [470]
This collection contains technical reports, articles and other published and unpublished scholarship authored by the college's diverse scholarly and research community. -
Technical Reports [SBU] [457]