%0 Conference Paper %1 conf/glvlsi/ONeilS02 %A O'Neil, Timothy W. %A Sha, Edwin Hsing-Mean %B ACM Great Lakes Symposium on VLSI %D 2002 %E Ghose, Kanad %E Madden, Patrick H. %E De, Vivek %E Kogge, Peter M. %I ACM %K dblp %P 136-141 %T Minimizing resources in a repeating schedule for a split-node data-flow graph. %U http://dblp.uni-trier.de/db/conf/glvlsi/glvlsi2002.html#ONeilS02 %@ 1-58113-462-2

@inproceedings{conf/glvlsi/ONeilS02, added-at = {2018-11-06T00:00:00.000+0100}, author = {O'Neil, Timothy W. and Sha, Edwin Hsing-Mean}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2cab6f6e4f641a6ee38133967e96913a6/dblp}, booktitle = {ACM Great Lakes Symposium on VLSI}, crossref = {conf/glvlsi/2002}, editor = {Ghose, Kanad and Madden, Patrick H. and De, Vivek and Kogge, Peter M.}, ee = {https://doi.org/10.1145/505306.505336}, interhash = {93b513bd87787b18073ad91fe39a31c3}, intrahash = {cab6f6e4f641a6ee38133967e96913a6}, isbn = {1-58113-462-2}, keywords = {dblp}, pages = {136-141}, publisher = {ACM}, timestamp = {2019-09-27T19:33:57.000+0200}, title = {Minimizing resources in a repeating schedule for a split-node data-flow graph.}, url = {http://dblp.uni-trier.de/db/conf/glvlsi/glvlsi2002.html#ONeilS02}, year = 2002 }