An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cit/SarkarJK06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cit/SarkarJK06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bhagirath_Kumar
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bikash_Kanti_Sarkar
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shahid_Jamal
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FICIT.2006.27
>
foaf:
homepage
<
https://doi.org/10.1109/ICIT.2006.27
>
dc:
identifier
DBLP conf/cit/SarkarJK06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FICIT.2006.27
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
rdfs:
label
An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bhagirath_Kumar
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bikash_Kanti_Sarkar
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shahid_Jamal
>
swrc:
pages
269-272
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cit/2006
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cit/SarkarJK06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cit/SarkarJK06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cit/cit2006.html#SarkarJK06
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ICIT.2006.27
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cit
>
dc:
subject
largest, Second_largest , P-RAM, optimal
(xsd:string)
dc:
title
An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document