Approximating complete partitions Guy Kortsarz Joint work with J. Radhakrishnan and S.Sivasubramanian.
Opera: Reconstructing optimal genomic scaffolds with high- throughput paired-end sequences Song Gao, Niranjan Nagarajan, Wing-Kin Sung National University.
1 Sparse Matrices for High-Performance Graph Analytics John R. Gilbert University of California, Santa Barbara Oak Ridge National Laboratory October 3,
Approximating complete partitions
Parallel Sparse Matrix-Matrix Multiplication and Its Use in Triangle Counting and Enumeration Ariful Azad Lawrence Berkeley National Laboratory SIAM ALA.
