[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/KalpakisY99>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Konstantinos_Kalpakis>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yaacov_Yesha>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2FPL00009254>
foaf:homepage <https://doi.org/10.1007/PL00009254>
dc:identifier DBLP journals/algorithmica/KalpakisY99 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2FPL00009254 (xsd:string)
dcterms:issued 1999 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Konstantinos_Kalpakis>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yaacov_Yesha>
swrc:number 2 (xsd:string)
swrc:pages 159-179 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/KalpakisY99/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/KalpakisY99>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica23.html#KalpakisY99>
rdfs:seeAlso <https://doi.org/10.1007/PL00009254>
dc:subject Multiprocessing, Parallel computation, Parallel architectures, Communication delay, Scheduling, Tree dags, Linear array, Mesh array, Tree decomposition. (xsd:string)
dc:title Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 23 (xsd:string)