Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/wdag/BrandtLU21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/wdag/BrandtLU21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jara_Uitto
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rustam_Latypov
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sebastian_Brandt_0002
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.DISC.2021.50
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.DISC.2021.50
>
dc:
identifier
DBLP conf/wdag/BrandtLU21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.DISC.2021.50
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
rdfs:
label
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jara_Uitto
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rustam_Latypov
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sebastian_Brandt_0002
>
swrc:
pages
50:1-50:4
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/wdag/2021
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/wdag/BrandtLU21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/wdag/BrandtLU21
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/wdag/disc2021.html#BrandtLU21
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.DISC.2021.50
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/wdag
>
dc:
title
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document