Publications and Talks

Peer-Reviewed Publications:

[27] Hayden Jananthan, Lauren Milechin, Michael Jones, William Arcand, William Bergeron, David Bestor, Chansup Byun, Michael Houle, Matthew Hubbell, Vijay Gadepally, Anna Klein, Peter Michaleas, Guillermo Morales, Julie Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Charles Yee, and Jeremy Kepner. Python implementation of the Dynamic Distributed Dimensional Data Model. In 2022 IEEE Conference on High Performance Extreme Computing (HPEC), 2022. (arxiv) (source)

[26] Chansup Byun, William Arcand, David Bestor, Bill Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Kurt Keville, Anna Klein, Peter Michaleas, Lauren Milechin, Guillermo Morales, Julie Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Charles Yee, and Jeremy Kepner. pPython for parallel Python programming. In 2022 IEEE Conference on High Performance Extreme Computing (HPEC), 2022. (arxiv) (source)

[25] Ivan Kawaminami, Arminda Estrada, Youssef Elsakkary, Hayden Jananthan, Aydin Buluç, Tim Davis, Daniel Grant, Michael Jones, Chad Meiners, Andrew Morris, Sandeep Pisharody, and Jeremy Kepner. Large scale enrichment and statistical cyber characterization of network traffic. In 2022 IEEE Conference on High Performance Extreme Computing (HPEC), 2022. (arxiv) (source)

[24] Sandeep Pisharody, Chad Meiners, Tyler Trigg, Hayden Jananthan, Michael Jones, Adam Michaleas, Timothy Davis, Erik Welch, William Arcand, David Bestor, William Bergeron, Chansup Byun, Vijay Gadepally, Michael Houle, Matthew Hubbell, Anna Klein, Peter Michaleas, Lauren Milechin, Julie Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Charles Yee, and Jeremy Kepner. Hypersparse network flow analysis of packets with GraphBLAS. In 2022 IEEE Conference on High Performance Extreme Computing (HPEC), 2022. (arxiv) (source)

[23] Michael Jones, Jeremy Kepner, Daniel Andersen, Aydin Buluç, Chansup Byun, K Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad Meiners, Lauren Milechin, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Jon Sreekanth, Doug Stetson, Charles Yee, and Peter Michaleas. GraphBLAS on the edge: High performance streaming of network traffic. In 2022 IEEE Conference on High Performance Extreme Computing (HPEC), 2022. (arxiv) (source)

[22] Jeremy Kepner, Michael Jones, Daniel Andersen, Aydin Buluç, Chansup Byun, K Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Daniel Grant, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad Meiners, Lauren Milechin, Andrew Morris, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Charles Yee, and Peter Michaleas. Temporal correlation of internet observatories and outposts. In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pages 247–254, 2022. (arxiv) (source)

[21] Lauren Milechin, Shana Hutchison, Hayden Jananthan, Jeremy Kepner, Benjamin A Miller, Andrew Prout, Siddharth Samsi, Chuck Yee, and Vijay Gadepally. Graphulo: Linear algebra graph kernels. In Massive Graph Analytics, pages 525–548. Chapman and Hall/CRC, 2022. (Taylor & Francis)

[20] Hayden R. Jananthan and Stephen G. Simpson. Extracting complexity from avoidance. In progress, 2021.

[19] Hayden R. Jananthan. Slow-growing avoidance. In progress, 2021.

[18] Hayden R. Jananthan. Extracting shift-complexity from complexity. In progress, 2021.

[17] Hayden R. Jananthan. Complexity and Avoidance. PhD thesis, Vanderbilt University, June 2021. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics under the direction of Stephen G. Simpson. (arxiv) (source)

[16] Jeremy Kepner, Timothy Davis, Vijay Gadepally, Hayden Jananthan, and Lauren Milechin. Mathematics of digital hyperspace. In 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pages 263–271, 2021. (arxiv) (source)

[15] Hayden R. Jananthan and Stephen G. Simpson. Turing degrees of hyperjumps. arXiv, 2021. 17 pages, submitted for publication in Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, 2020. (arxiv)

[14] Hayden R. Jananthan and Stephen G. Simpson. Pseudojump inversion in special r. b. Pi01 classes. arXiv, 2021. 19 pages, submitted for publication in Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, 2020. (arxiv)

[13] Jeremy Kepner, Vijay Gadepally, Hayden Jananthan, Lauren Milechin, and Siddharth Samsi. AI data wrangling with associative arrays. In 2020 Northeast Database Day (NEDB), January 2020. Accepted, publication pending. (arxiv)

[12] Jessica Titensky, Hayden Jananthan, and Jeremy Kepner. Uncertainty propogation in deep neural networks using extended Kalman filtering. In 2018 IEEE MIT Undergraduate Research Technology Conference (URTC), pages 1–4, Oct. 2018. (arxiv) (source)

[11] Katherine Gravel, Hayden Jananthan, and Jeremy Kepner. Visually representing the landscape of mathematical structures. In 2018 IEEE MIT Undergraduate Research Technology Conference (URTC), pages 1–4, Oct. 2018. (arxiv) (source)

[10] Jeremy Kepner, Ron Brightwell, Alan Edelman, Vijay Gadepally, Hayden Jananthan, Michael Jones, Sam Madden, Peter Michaleas, Hamed Okhravi, Kevin Pedretti, Albert Reuther, Thomas Sterling, and Mike Stonebraker. TabulaROSA: Tabular operating system architecture for massively parallel heterogeneous compute engines. In 2018 IEEE High Performance extreme Computing Conference (HPEC), pages 1–8, Sep. 2018. (arxiv) (source)

[9] Jeremy Kepner, Vijay Gadepally, Hayden Jananthan, Lauren Milechin, and Siddharth Samsi. Sparse deep neural network exact solutions. In 2018 IEEE High Performance extreme Computing Conference (HPEC), pages 1–8, Sep. 2018. (arxiv) (source)

[8] Jeremy Kepner and Hayden Jananthan. Mathematics of Big Data: Spreadsheets, Databases, Matrices, and Graphs. MIT Lincoln Laboratory Series. MIT Press, 2018. Forward by Charles E. Leiserson, XIII + 418 Pages. (MIT Press)

[7] Jeremy Kepner, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Timothy Davis, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Anna Klein, Peter Michaleas, Roger Pearce, Lauren Milechin, Julie Mullen, Andrew Prout, Antonio Rosa, Geoff Sanders, Charles Yee, and Albert Reuther. Design, generation, and validation of extreme scale power-law graphs. In 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pages 279–286, May 2018. (arxiv) (source)

[6] Hayden Jananthan, Ziqi Zhou, Vijay Gadepally, Dylan Hutchison, Suna Kim, and Jeremy Kepner. Polystore mathematics of relational algebra. In 2017 IEEE International Conference on Big Data (Big Data), pages 3180–3189, Dec 2017. (arxiv) (source)

[5] Hayden Jananthan, Suna Kim, and Jeremy Kepner. Linear systems over join-blank algebras. In 2017 IEEE MIT Undergraduate Research Technology Conference (URTC), pages 1–4, Nov 2017. (arxiv) (source)

[4] Hayden Jananthan, Karia Dibert, and Jeremy Kepner. Constructing adjacency arrays from incidence arrays. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pages 608–615, May 2017. (arxiv) (source)

[3] Jeremy Kepner, Vijay Gadepally, Dylan Hutchison, Hayden Jananthan, Timothy Mattson, Siddharth Samsi, and Albert Reuther. Associative array model of SQL, NoSQL, and NewSQL databases. In 2016 IEEE High Performance Extreme Computing Conference (HPEC), pages 1–9, Sep. 2016. (arxiv) (source)

[2] Karia Dibert, Hayden Jansen, and Jeremy Kepner. Algebraic conditions for generating accurate adjacency arrays. In 2015 IEEE MIT Undergraduate Research Technology Conference (URTC), pages 1–4, Nov 2015. (source)

[1] Jeremy Kepner, Julian Chaidez, Vijay Gadepally, and Hayden Jansen. Associative arrays; unified mathematics for spreadsheets, databases, matrices, and graphs. In 2015 New England Database Summit, Jan 2015. 4 pages. (arxiv) (source)

Conference Talks:

Posner-Robinson for Hyperjump of Turing Degrees, presented at the 20th annual Graduate Student Conference in Logic, Spring 2019, hosted at the University of Illinois, Chicago.

Constructing Adjacency Arrays from Incidence Arrays, presented at IEEE IPDPS 2017 Workshop on Graph Algorithm Building Blocks.

Other Talks:

Posner-Robinson for Hyperjump of Turing Degrees, presented at the Vanderbilt Mathematics Department Universal Algebra and Logic Seminar, Spring 2019; the Summer School in Logic at the National University of Singapore, Summer 2019.