Communication Complexity of Distributed Minimum Spanning Tree Algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/berkeley/Spira77
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/berkeley/Spira77
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Philip_M._Spira
>
dc:
identifier
DBLP conf/berkeley/Spira77
(xsd:string)
dcterms:
issued
1977
(xsd:gYear)
rdfs:
label
Communication Complexity of Distributed Minimum Spanning Tree Algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Philip_M._Spira
>
swrc:
pages
236-
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/berkeley/1977
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/vldb/SuLLLD78
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/berkeley/Spira77/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/berkeley/Spira77
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/berkeley/berkeley77.html#Spira77
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/berkeley
>
dc:
title
Communication Complexity of Distributed Minimum Spanning Tree Algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document