%0 Conference Paper %1 conf/ispdc/HagrasJ04 %A Hagras, Tarek %A Janecek, Jan %B ISPDC/HeteroPar %D 2004 %I IEEE Computer Society %K dblp %P 106-113 %T A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems. %U http://dblp.uni-trier.de/db/conf/ispdc/ispdc2004.html#HagrasJ04

@inproceedings{conf/ispdc/HagrasJ04, added-at = {2023-03-24T00:00:00.000+0100}, author = {Hagras, Tarek and Janecek, Jan}, biburl = {https://www.bibsonomy.org/bibtex/2e375bdc2ca76d68423e488b078387204/dblp}, booktitle = {ISPDC/HeteroPar}, crossref = {conf/ispdc/2004}, ee = {https://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.3}, interhash = {99005b0871dc85ddf715c36747aa75f6}, intrahash = {e375bdc2ca76d68423e488b078387204}, keywords = {dblp}, pages = {106-113}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T20:28:42.000+0200}, title = {A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems.}, url = {http://dblp.uni-trier.de/db/conf/ispdc/ispdc2004.html#HagrasJ04}, year = 2004 }