Kristin Sheridan

Hi! I am currently a sixth year PhD student studying theoretical computer science at the University of Texas at Austin, where I am advised by Prof. Shuchi Chawla. I am particularly interested in topics related to algorithms in graph theory and metric embeddings.

I am currently on the market for positions and postdocs beginning in 2027.

Prior to attending UT, I completed my B.S. ('20) and M.Eng. ('21) in Computer Science with Electrical Engineering at MIT. I was advised by Prof. Virginia Vassilevska-Williams and Prof. Mark Bathe for my M.Eng., and my thesis was Graph factorization and pseudofactorization with applications to hypercube embeddings.

I am on the board of the Graduate Women+ in Computing (GWiC+) group at UT. Please visit our website or contact me to learn more!

During the 2025-26 academic year, I was generously supported by a PhD research fellowship from JPMorgan Chase & Co.

During the summer of 2023, I worked on the high-rate delay tolerant networking (HDTN) team at NASA's Glenn Research Center, under the guidance of Dr. Robert Kassouf-Short.

I have also served as a reviewer for FOCS, ESA, ITCS, and SODA.

Publications & Preprints

• Bi-Lipschitz extensions and outlier embeddings into trees
  Shuchi Chawla, Arnold Filtser, Kristin Sheridan, Yonatan Trachtenberg
  APPROX 2026 (APPROX proceedings) (ArXiv)
• Brief announcement: A special case of maximum flow over time with network changes
  Shuchi Chawla, Kristin Sheridan
  SAND 2026 (SAND proceedings) (full version on ArXiv)
• Composition of nested embeddings with an application to outlier removal
  Shuchi Chawla, Kristin Sheridan
  SODA 2024 (SODA proceedings) (ArXiv)
• Factorization and pseudofactorization of weighted graphs
  Mark Bathe, Joseph Berleant, Anne Condon, Kristin Sheridan, Virginia Vassilevska Williams
  Discrete Applied Mathematics (journal) - 2023 (Journal version) (ArXiv)
• Isometric Hamming embeddings of weighted graphs
  Mark Bathe, Joseph Berleant, Anne Condon, Kristin Sheridan, Virginia Vassilevska Williams
  Discrete Applied Mathematics (journal) - 2023 (Journal version) (ArXiv)
• Fully succinct batch arguments for NP from indistinguishability obfuscation
  Rachit Garg, Kristin Sheridan, Brent Waters, David Wu
  TCC 2022 (TCC proceedings) (IACR)

Teaching

In the Fall of 2025, I was the instructor of record for CS 311H: Discrete Math for Computer Science at UT Austin.

• CS331H: Algorithms and Complexity (Spring 2025)
• CS388C: Combinatorics and Graph Theory (Fall 2024)
• CS349: Contemporary Issues in Computer Science (Spring 2024)
• CS331: Algorithms and Complexity (Spring 2023)
• CS388G: Algorithms: Techniques and Theory (Fall 2022)

• 6.006: Introduction to Algorithms (Spring 2021)
• 6.046: Design and Analysis of Algorithms (Fall 2020)
• 6.00: Introduction to Computer Science and Programming (lab assistant, Fall 2019 and Spring 2020)

Other information

I also spent a portion of my undergraduate years studying biological engineering, and I worked in the labs of Dr. Rahmi Oklu at the Mayo Clinic Scottsdale and Dr. Pablo Gonzalez at la PUC de Chile.