Chapter

Interactive Graph Analytics at Scale in Arkouda
High-Performance Phylogenetic Inference
Benchmarking for Graph Clustering and Partitioning
Engineering Algorithms for Computational Biology
High Performance Algorithm Engineering for Large-Scale Problems
Sorting Signed Permutations by Reversal (Reversal Distance)
Benchmarking for Graph Clustering and Partitioning
Evaluating Multicore Processors and Accelerators for Dense Numerical Computations
Parallel community detection for massive graphs
Parallel Community Detection for Massive Graphs
Computational Challenges in Emerging Combinatorial Scientific Computing Applications
Fundamental Questions in the Analysis of Large Graphs
Graph Algorithms
Hybrid Programming With SIMPLE
Large-Scale Network Analysis
Spanning Tree, Minimum Weight
SWARM: A Parallel Programming Framework for Multicore Processors
Combinatorial Algorithm Design on the Cell/B.E. Processor
Designing Fast Fourier Transform for the IBM Cell Broadband Engine
The Case of the Fast Financial Feed
Engineering Algorithms for Computational Biology
High Performance Algorithm Engineering for Large-scale Problems
Sorting Signed Permutations by Reversal (Reversal Distance)
Design of Multithreaded Algorithms for Combinatorial Problems
Efficient Parallel Graph Algorithms for Shared-memory Multiprocessors
Multithreaded Algorithms for Processing Massive Graphs
High-Performance Algorithms for Phylogeny Reconstruction with Maximum Parsimony
High-Performance Phylogeny Reconstruction Under Maximum Parsimony
Parallel Algorithm Design for Branch and Bound
Algorithm Engineering for Parallel Computation