Expressing graph algorithms using generalized active messages

Nicholas Gerard Edmonds, Jeremiah Willcock, Andrew Lumsdaine. Expressing graph algorithms using generalized active messages. In Allen D. Malony, Mario Nemirovsky, Samuel P. Midkiff, editors, International Conference on Supercomputing, ICS'13, Eugene, OR, USA - June 10 - 14, 2013. pages 283-292, ACM, 2013. [doi]

@inproceedings{EdmondsWL13,
  title = {Expressing graph algorithms using generalized active messages},
  author = {Nicholas Gerard Edmonds and Jeremiah Willcock and Andrew Lumsdaine},
  year = {2013},
  doi = {10.1145/2464996.2465441},
  url = {http://doi.acm.org/10.1145/2464996.2465441},
  researchr = {https://researchr.org/publication/EdmondsWL13},
  cites = {0},
  citedby = {0},
  pages = {283-292},
  booktitle = {International Conference on Supercomputing, ICS'13, Eugene, OR, USA - June 10 - 14, 2013},
  editor = {Allen D. Malony and Mario Nemirovsky and Samuel P. Midkiff},
  publisher = {ACM},
  isbn = {978-1-4503-2130-3},
}