An Optimal Linked List Prefix Algorithm on a Local Memory Computer.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tc/Han91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tc/Han91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yijie_Han
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F12.93747
>
foaf:
homepage
<
https://doi.org/10.1109/12.93747
>
dc:
identifier
DBLP journals/tc/Han91
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F12.93747
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tc
>
rdfs:
label
An Optimal Linked List Prefix Algorithm on a Local Memory Computer.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yijie_Han
>
swrc:
number
10
(xsd:string)
swrc:
pages
1149-1153
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tc/Han91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tc/Han91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tc/tc40.html#Han91
>
rdfs:
seeAlso
<
https://doi.org/10.1109/12.93747
>
dc:
subject
linked list prefix algorithm; local memory computer; deterministic parallel algorithm; input list; local memory PRAM model; processors; shared memory cells; computational complexity; data structures; list processing; parallel algorithms.
(xsd:string)
dc:
title
An Optimal Linked List Prefix Algorithm on a Local Memory Computer.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
40
(xsd:string)