On the Complexity of Certified Write All Algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/fsttcs/MartelS92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/fsttcs/MartelS92
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Charles_U._Martel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ramesh_Subramonian
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-56287-7%5F119
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-56287-7_119
>
dc:
identifier
DBLP conf/fsttcs/MartelS92
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-56287-7%5F119
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
rdfs:
label
On the Complexity of Certified Write All Algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Charles_U._Martel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ramesh_Subramonian
>
swrc:
pages
368-379
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/fsttcs/1992
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/fsttcs/MartelS92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/fsttcs/MartelS92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs92.html#MartelS92
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-56287-7_119
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/fsttcs
>
dc:
title
On the Complexity of Certified Write All Algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document