( en | de | ru )

 

Disambiguation of "Firoz, Jesun Sahariar"

Author of the publication

copydeleteadd this publication to your clipboard
Distributed Direction-Optimizing Label Propagation for Community Detection.

, , , , , , and . HPEC, page 1-6. IEEE, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Firoz Badesab

Firoz Badesab

Firoz Kaderali

Firoz Sojitrawalla

Firoz Farrokh

 

Other publications of authors with the same name

Fast and Scalable Sparse Triangular Solver for Multi-GPU Based HPC Architectures., , , , , , , and . CoRR, (2020)Distributed Direction-Optimizing Label Propagation for Community Detection., , , , , , and . HPEC, page 1-6. IEEE, (2019)Graph Algorithms in PGAS: Chapel and UPC++., , , , and . HPEC, page 1-6. IEEE, (2019)The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time., , , and . J. Comput. Biol., 18 (8): 1007-1011 (2011)On the Feasibility of Using Reduced-Precision Tensor Core Operations for Graph Analytics., , , and . HPEC, page 1-7. IEEE, (2020)The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nn)$ Time, , , and . CoRR, (2009)Synchronization-Avoiding Graph Algorithms., , , and . HiPC, page 52-61. IEEE, (2018)A Parallel Graph Environment for Real-World Data Analytics Workflows., , , , , , , , , and 2 other author(s). DATE, page 1313-1318. IEEE, (2019)The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time., , , and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 161-166. Springer, (2010)Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data., , and . GECCO, page 201-208. ACM, (2012)