Standards for graph algorithm primitives

Standards for graph algorithm primitives. Mattson, T., Bader, D. A., Berry, J. W., Buluç, A., Dongarra, J. J., Faloutsos, C., Feo, J., Gilbert, J. R., Gonzalez, J., Hendrickson, B., Kepner, J., Leiserson, C. E., Lumsdaine, A., Padua, D. A., Poole, S., Reinhardt, S. P., Stonebraker, M., Wallach, S., & Yoo, A. In IEEE High Performance Extreme Computing Conference, HPEC 2013, Waltham, MA, USA, September 10-12, 2013, pages 1–2, 2013. IEEE.

Paper doi bibtex

@inproceedings{DBLP:conf/hpec/MattsonBBBDFFGGHKLLPPRSWY13,
  author       = {Tim Mattson and
                  David A. Bader and
                  Jonathan W. Berry and
                  Aydin Bulu{\c{c}} and
                  Jack J. Dongarra and
                  Christos Faloutsos and
                  John Feo and
                  John R. Gilbert and
                  Joseph Gonzalez and
                  Bruce Hendrickson and
                  Jeremy Kepner and
                  Charles E. Leiserson and
                  Andrew Lumsdaine and
                  David A. Padua and
                  Stephen Poole and
                  Steven P. Reinhardt and
                  Mike Stonebraker and
                  Steve Wallach and
                  Andrew Yoo},
  title        = {Standards for graph algorithm primitives},
  booktitle    = {{IEEE} High Performance Extreme Computing Conference, {HPEC} 2013,
                  Waltham, MA, USA, September 10-12, 2013},
  pages        = {1--2},
  publisher    = {{IEEE}},
  year         = {2013},
  url          = {https://doi.org/10.1109/HPEC.2013.6670338},
  doi          = {10.1109/HPEC.2013.6670338},
  timestamp    = {Tue, 21 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/hpec/MattsonBBBDFFGGHKLLPPRSWY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0