[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/hicss/Rao95a>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Josyula_R._Rao>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FHICSS.1995.375480>
foaf:homepage <https://doi.org/10.1109/HICSS.1995.375480>
dc:identifier DBLP conf/hicss/Rao95a (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FHICSS.1995.375480 (xsd:string)
dcterms:issued 1995 (xsd:gYear)
rdfs:label Eventual determinism: using probabilistic means to achieve deterministic ends. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Josyula_R._Rao>
swrc:pages 29-38 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/hicss/1995>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/hicss/Rao95a/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/hicss/Rao95a>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/hicss/hicss1995.html#Rao95a>
rdfs:seeAlso <https://doi.org/10.1109/HICSS.1995.375480>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/hicss>
dc:subject parallel algorithms; deterministic algorithms; randomised algorithms; computational complexity; eventual determinism; eventually-determining algorithms; probabilistic algorithms; deterministic algorithms; parallel algorithm design; symmetry breaking; determinacy; worst case complexity bound; conflict resolution; self-stabilization (xsd:string)
dc:title Eventual determinism: using probabilistic means to achieve deterministic ends. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document