Introduction to Parallel Algorithms 15-853 : Algorithms in the Real World (DRAFT)

[1]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[2]  B. Awerbuch,et al.  New Connectivity and MSF Algorithms for Ultracomputer and PRAM , 1983, ICPP.

[3]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[4]  C. A. Philips,et al.  Parallel graph contraction , 1989, SPAA '89.

[5]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[6]  David A. Patterson,et al.  Direction-optimizing Breadth-First Search , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[7]  Guy E. Blelloch,et al.  Ligra: a lightweight graph processing framework for shared memory , 2013, PPoPP '13.

[8]  Gary L. Miller,et al.  Parallel graph decompositions using random shifts , 2013, SPAA.

[9]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[10]  Guy E. Blelloch,et al.  A Top-Down Parallel Semisort , 2015, SPAA.