A PGAS-Based Algorithm for the Longest Common Subsequence Problem. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/europar/BakhouyaSE08>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-85451-7%5F70>
foaf:homepage	<https://doi.org/10.1007/978-3-540-85451-7_70>
dc:identifier	DBLP conf/europar/BakhouyaSE08 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F978-3-540-85451-7%5F70 (xsd:string)
dcterms:issued	2008 (xsd:gYear)
rdfs:label	A PGAS-Based Algorithm for the Longest Common Subsequence Problem. (xsd:string)
swrc:pages	654-664 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/europar/2008>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/europar/BakhouyaSE08/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/europar/BakhouyaSE08>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/europar/europar2008.html#BakhouyaSE08>
rdfs:seeAlso	<https://doi.org/10.1007/978-3-540-85451-7_70>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/europar>
dc:subject	Parallel computing; Longest common subsequence; Partitioned Global Address Space; Unified Parallel C (UPC); Complexity design and analysis (xsd:string)
dc:title	A PGAS-Based Algorithm for the Longest Common Subsequence Problem. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document