[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tpds/BarcacciaBI00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Maurizio_A._Bonuccelli>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Miriam_Di_Ianni>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Piera_Barcaccia>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F71.888647>
foaf:homepage <https://doi.org/10.1109/71.888647>
dc:identifier DBLP journals/tpds/BarcacciaBI00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F71.888647 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tpds>
rdfs:label Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Maurizio_A._Bonuccelli>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Miriam_Di_Ianni>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Piera_Barcaccia>
swrc:number 10 (xsd:string)
swrc:pages 1090-1102 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tpds/BarcacciaBI00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tpds/BarcacciaBI00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tpds/tpds11.html#BarcacciaBI00>
rdfs:seeAlso <https://doi.org/10.1109/71.888647>
dc:subject Single hop distributed systems, scheduling, NP-completeness, minimum schedule length, approximation algorithms. (xsd:string)
dc:title Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 11 (xsd:string)