[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/Fisher88>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/David_C._Fisher>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.2150>
foaf:homepage <https://doi.org/10.1109/12.2150>
dc:identifier DBLP journals/tc/Fisher88 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.2150 (xsd:string)
dcterms:issued 1988 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label Your Favorite Parallel Algorithms Might Not Be as Fast as You Think. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/David_C._Fisher>
swrc:number 2 (xsd:string)
swrc:pages 211-213 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/Fisher88/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/Fisher88>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc37.html#Fisher88>
rdfs:seeAlso <https://doi.org/10.1109/12.2150>
dc:subject computational complexity; finite transmission speed; matrix multiplications; parallel algorithms; real-world conditions; computational complexity; matrix algebra; parallel algorithms. (xsd:string)
dc:title Your Favorite Parallel Algorithms Might Not Be as Fast as You Think. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 37 (xsd:string)