[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schenk95>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Eric_Schenk>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492673>
foaf:homepage <https://doi.org/10.1109/SFCS.1995.492673>
dc:identifier DBLP conf/focs/Schenk95 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.1995.492673 (xsd:string)
dcterms:issued 1995 (xsd:gYear)
rdfs:label Faster Approximate Agreement with Multi-Writer Registers. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Eric_Schenk>
swrc:pages 714-723 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Schenk95/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Schenk95>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs95.html#Schenk95>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.1995.492673>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject shared memory systems; computational complexity; distributed algorithms; multi-writer registers; complexity; wait-free approximate agreement problem; asynchronous shared memory; single-bit multi-writer multi-reader registers; lower bounds; upper bounds; shared registers; wait-free single-writer multi-reader; wait-free multi-writer multi-reader (xsd:string)
dc:title Faster Approximate Agreement with Multi-Writer Registers. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document