Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/14601
DC FieldValueLanguage
dc.contributor.authorStojmenović, Ivanen_US
dc.contributor.authorMiyakawa M.en_US
dc.date.accessioned2020-03-03T14:56:42Z-
dc.date.available2020-03-03T14:56:42Z-
dc.date.issued1988-01-01-
dc.identifier.issn01678191en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/14601-
dc.description.abstractWe 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.ispartofParallel Computingen
dc.titleAn optimal parallel algorithm for solving the maximal elements problem in the planeen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1016/0167-8191(88)90042-7-
dc.identifier.scopus2-s2.0-0024031511-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0024031511-
dc.description.versionUnknownen_US
dc.relation.lastpage251en
dc.relation.firstpage249en
dc.relation.issue2en
dc.relation.volume7en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:Naučne i umetničke publikacije
Show simple item record

SCOPUSTM   
Citations

32
checked on Nov 20, 2023

Page view(s)

8
Last Week
4
Last month
0
checked on May 3, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.