Not All Fair Probabilistic Schedulers Are Equivalent.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/opodis/ChatzigiannakisDFMS09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/opodis/ChatzigiannakisDFMS09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ioannis_Chatzigiannakis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Othon_Michail
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paul_G._Spirakis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%B0ndor_P._Fekete
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shlomi_Dolev
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-10877-8%5F5
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-10877-8_5
>
dc:
identifier
DBLP conf/opodis/ChatzigiannakisDFMS09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-10877-8%5F5
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
Not All Fair Probabilistic Schedulers Are Equivalent.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ioannis_Chatzigiannakis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Othon_Michail
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paul_G._Spirakis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%B0ndor_P._Fekete
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shlomi_Dolev
>
swrc:
pages
33-47
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/opodis/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/opodis/ChatzigiannakisDFMS09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/opodis/ChatzigiannakisDFMS09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/opodis/opodis2009.html#ChatzigiannakisDFMS09
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-10877-8_5
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/opodis
>
dc:
subject
population protocol; probabilistic scheduler; fair scheduler; fairness; communicating automata; sensor network
(xsd:string)
dc:
title
Not All Fair Probabilistic Schedulers Are Equivalent.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document