Author image not provided
 Ioana O Bercea

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.50
Citation Count1
Publication count2
Publication years2014-2017
Available for download2
Average downloads per article90.00
Downloads (cumulative)180
Downloads (12 Months)30
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
January 2017 ACM Transactions on Parallel Computing (TOPC) - Special Issue for SPAA 2014: Volume 3 Issue 1, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 43,   Downloads (Overall): 69

Full text available: PDFPDF
Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Essentially, the challenge is to design (randomized) algorithms in which the number of processors used is polynomial and the (expected) runtime is ...
Keywords: independent sets, parallel algorithms, Hypergraphs, randomized algorithms

2 published by ACM
June 2014 SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Downloads (Overall): 93

Full text available: PDFPDF
Whether or not the problem of finding maximal independent sets (MIS)in hypergraphs is in R NC is one of the fundamental problems in the theory of parallel computing. Unlike the well-understood case of MIS in graphs, for the hypergraph problem, our knowledge is quite limited despite considerable work. It is ...
Keywords: parallel algorithms, randomized algorithms, independent sets



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us