The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/fac/Hesselink99
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/fac/Hesselink99
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wim_H._Hesselink
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs001650050035
>
foaf:
homepage
<
https://doi.org/10.1007/s001650050035
>
dc:
identifier
DBLP journals/fac/Hesselink99
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs001650050035
(xsd:string)
dcterms:
issued
1999
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/fac
>
rdfs:
label
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wim_H._Hesselink
>
swrc:
number
1
(xsd:string)
swrc:
pages
45-55
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/fac/Hesselink99/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/fac/Hesselink99
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/fac/fac11.html#Hesselink99
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s001650050035
>
dc:
subject
Minimum spanning tree; Message passing; Asynchronous communication; Theorem proving
(xsd:string)
dc:
title
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
11
(xsd:string)