I develop algorithms for subgraph matching and analyze randomized iterative methods for solving linear systems.
Jacob D. Moorman, Thomas K. Tu, Denali Molitor, Deanna Needell, “Randomized Kaczmarz with Averaging.” Proc. Information Theory and Applications Workshop, La Jolla, CA, Feb. 2019.
Jacob D. Moorman, Qinyi Chen, Thomas K. Tu, Zachary M. Boyd, Andrea L. Bertozzi, “Filtering Methods for Subgraph Matching on Multiplex Networks.” Proc. GTA³ 2.0: The 2nd workshop on Graph Techniques for Adversarial Activity Analytics, IEEE International Conference on Big Data, Seattle, WA, Dec. 2018.