N. Edmonds

Design of a Large-Scale Hybrid-Parallel Graph Library

A. Lumsdaine, Jeremiah Willcock, N. Edmonds, 2010 .

Scalable Parallel Solution Techniques for Data-Intensive Problems in Distributed Memory

A. Lumsdaine, N. Edmonds, 2012 .

Single-Source Shortest Paths with the Parallel Boost Graph Library

Andrew Lumsdaine, Douglas P. Gregor, Nick Edmonds, 2006, The Shortest Path Problem.

Active messages as a spanning model for parallel graph computation

Andrew Lumsdaine, Nicholas Edmonds, A. Lumsdaine, 2013 .

Active pebbles: parallel programming for data-driven applications

Torsten Hoefler, Andrew Lumsdaine, Jeremiah Willcock, 2011, ICS '11.

Expressing graph algorithms using generalized active messages

Andrew Lumsdaine, Jeremiah Willcock, Nick Edmonds, 2013, ICS '13.

A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

Torsten Hoefler, Andrew Lumsdaine, Nick Edmonds, 2010, 2010 International Conference on High Performance Computing.

Extensible PGAS semantics for C++

Andrew Lumsdaine, Douglas P. Gregor, Nick Edmonds, 2010, PGAS '10.