Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14601
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stojmenović, Ivan | en_US |
dc.contributor.author | Miyakawa M. | en_US |
dc.date.accessioned | 2020-03-03T14:56:42Z | - |
dc.date.available | 2020-03-03T14:56:42Z | - |
dc.date.issued | 1988-01-01 | - |
dc.identifier.issn | 01678191 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/14601 | - |
dc.description.abstract | We describe an O(log(n)) time with O(n) processors optimal algorithm for finding the maximal elements of a set. The model of parallel computation we consider is the CREW-PRAM, i.e. it is the synchronous shared memory model where concurrent reads are allowed but no two processors can simultaneously attempt to write in the same memory location (even if they are trying to write the same thing). © 1988. | en |
dc.relation.ispartof | Parallel Computing | en |
dc.title | An optimal parallel algorithm for solving the maximal elements problem in the plane | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/0167-8191(88)90042-7 | - |
dc.identifier.scopus | 2-s2.0-0024031511 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0024031511 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 251 | en |
dc.relation.firstpage | 249 | en |
dc.relation.issue | 2 | en |
dc.relation.volume | 7 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
32
checked on Nov 20, 2023
Page view(s)
8
Last Week
4
4
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.