%0 Journal Article %1 journals/ijfcs/FintaL97 %A Finta, Lucian %A Liu, Zhen %D 1997 %J Int. J. Found. Comput. Sci. %K dblp %N 1 %P 43-66 %T Complexity of Task Graph Scheduling with Fixed Communication Capacity. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs8.html#FintaL97 %V 8

@article{journals/ijfcs/FintaL97, added-at = {2012-09-14T00:00:00.000+0200}, author = {Finta, Lucian and Liu, Zhen}, biburl = {https://www.bibsonomy.org/bibtex/209782f3be6477940ea02f3c090aa2189/dblp}, ee = {http://dx.doi.org/10.1142/S0129054197000045}, interhash = {f976ed286cee7649a16859896a0848b4}, intrahash = {09782f3be6477940ea02f3c090aa2189}, journal = {Int. J. Found. Comput. Sci.}, keywords = {dblp}, number = 1, pages = {43-66}, timestamp = {2012-09-15T11:34:29.000+0200}, title = {Complexity of Task Graph Scheduling with Fixed Communication Capacity.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs8.html#FintaL97}, volume = 8, year = 1997 }