\begin{thebibliography}{1}

\bibitem{ainsworth_graph_2016}
Sam Ainsworth and Timothy~M. Jones.
\newblock Graph prefetching using data structure knowledge.
\newblock {\em Proceedings of the International Conference on Supercomputing},
  01-03-June, 2016.

\bibitem{berry_graph_2007}
Jonathan Berry and Bruce Hendrickson.
\newblock Graph {Analysis} with {High} {Performance} {Computing}.
\newblock {\em Computing in Science and Engineering}, 2007.

\bibitem{cook_rage_2018}
Kyle Cook.
\newblock {\em {RAGE}: {The} {Rage} {Attack} {Graph} {Engine}}.
\newblock PhD thesis, 2018.

\bibitem{CVE-2019-10747}
{set-value is vulnerable to Prototype Pollution in versions lower than 3.0.1.
  The function mixin-deep could be tricked into adding or modifying properties
  of Object.prototype using any of the constructor, prototype and $\_$proto$\_$
  payloads.}
\newblock National Vulnerability Database, August 2019.

\bibitem{li_combining_2019}
Ming Li, Peter Hawrylak, and John Hale.
\newblock Combining {OpenCL} and {MPI} to support heterogeneous computing on a
  cluster.
\newblock {\em ACM International Conference Proceeding Series}, 2019.

\bibitem{li_concurrency_2019}
Ming Li, Peter Hawrylak, and John Hale.
\newblock Concurrency {Strategies} for {Attack} {Graph} {Generation}.
\newblock {\em Proceedings - 2019 2nd International Conference on Data
  Intelligence and Security, ICDIS 2019}, pages 174--179, 2019.

\bibitem{zhang_boosting_2017}
Jialiang Zhang, Soroosh Khoram, and Jing Li.
\newblock Boosting the performance of {FPGA}-based graph processor using hybrid
  memory cube: {A} case for breadth first search.
\newblock {\em FPGA 2017 - Proceedings of the 2017 ACM/SIGDA International
  Symposium on Field-Programmable Gate Arrays}, pages 207--216, 2017.

\end{thebibliography}