Faster Algorithms for Computing Longest Common Increasing Subsequences.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cpm/BrodalKKK06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cpm/BrodalKKK06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gerth_St%E2%88%9A%C5%82lting_Brodal
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Irit_Katriel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kanela_Kaligosi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Martin_Kutz
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F11780441%5F30
>
foaf:
homepage
<
https://doi.org/10.1007/11780441_30
>
dc:
identifier
DBLP conf/cpm/BrodalKKK06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F11780441%5F30
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
rdfs:
label
Faster Algorithms for Computing Longest Common Increasing Subsequences.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gerth_St%E2%88%9A%C5%82lting_Brodal
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Irit_Katriel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kanela_Kaligosi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Martin_Kutz
>
swrc:
pages
330-341
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cpm/2006
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cpm/BrodalKKK06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cpm/BrodalKKK06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cpm/cpm2006.html#BrodalKKK06
>
rdfs:
seeAlso
<
https://doi.org/10.1007/11780441_30
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cpm
>
dc:
title
Faster Algorithms for Computing Longest Common Increasing Subsequences.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document