David A. Bader
David A. Bader
Home
People
Posts
Projects
Publications
Talks
Contact
CV
Guojing Cong
Latest
Graph Algorithms
Hybrid Programming With SIMPLE
Spanning Tree, Minimum Weight
SWARM: A Parallel Programming Framework for Multicore Processors
Design of Multithreaded Algorithms for Combinatorial Problems
Efficient Parallel Graph Algorithms for Shared-memory Multiprocessors
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
On the Architectural Requirements for Efficient Execution of Graph Algorithms
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs
Lock-Free Parallel Algorithms: An Experimental Study
The Euler Tour Technique and Parallel Rooted Spanning Tree
Cite
×