I am a theoretical computer scientist in the fourth year of my Ph.D at the department of electrical engineering and computer science at Oregon State University. My primary focus is constructing algorithms that solve problems structured linear systems from a combinatorial perspective. With a focus on graph theoretic approaches, sparse signal techniques, and seperable codes over prime powers, my work involves a breadth of mathematical topics. Inverse Laplacian systems on graphs and combinatorial structures and fundamental computational linear algebraic algorithms with sparsity guarantees comprise the majority of my body of work. In 2022 I obtained my B.S. in Mathematics with a focus on algebraic geometry and topology. Co-advised by both professor Amir Nayyeri [Oregon State University] a computational geometer with a keen eye for graph theoretic algorithms and professor Huck Bennett [University of Colorado Boulder] an expert in computational linear algebra, coding theory, and lattice algorithms. Currently, I am focusing my attention towards my thesis, a geometric, algebraic, and algorithmic perspective of the combinatorial Green function, using this to solve inverse problems in spectral graph theory.
| Output-Sparse Matrix Multiplication Using Compressed Sensing [pre-print] | RANDOM 2026 | Leibniz International Proceedings in Informatics |
| Graph Inference with Effective Resistance Queries | ALT 2026 | Proceedings of Machine Learning Research |
| Matrix Multiplication Verification Using Coding Theory | RANDOM 2024 | Leibniz International Proceedings in Informatics |
Email: me [at] evelynw [dot] xyz
Address: Oregon State University EECS, Corvallis, OR