Krish Singal
Contact: ksingal [at] upenn.edu
I am currently a PhD student advised by Erik Waingarten and Sanjeev Khanna in the UPenn Theory of Computation Group. My research interests lie in algorithm design and complexity for problems in high dimensional geometry and machine learning.
I graduated magna cum laude from Columbia University in 2024 with a B.S. in Computer Science. In my free time, I enjoy long-distance running, reading, and playing music.
Recent News
- Fall 2025: Presented our paper 'A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams' at FOCS 2025 in Sydney, Australia!
Research
Authors are listed in alphabetical order unless otherwise specified(*)
Computer Science Theory
A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten
Foundations of Computer Science (FOCS) 2025 (Slides) (Video)
Combinatorics
On the Size and Complexity of Scrambles
Seamus Connor, Steven DiSilvio, Sasha Kononova, Ralph Morrison, Krish Singal
In submission (Slides) (Video)
Nila Cibu, Kexin Ding, Steven DiSilvio, Sasha Kononova, Chan Lee, Ralph Morrison, Krish Singal
In submission
Chip-Firing Games on Banana Trees
Marchelle Beougher, Nila Cibu, Kexin Ding, Steven DiSilvio, Kristin Heysse, Sasha Kononova, Chan Lee, Ralph Morrison, Krish Singal
In submission
Systems/Security
MC$^2$: Rigorous and Efficient Directed Greybox Fuzzing*
Abhishek Shah, Dongdong She, Samanway Sadhu, Krish Singal, Peter Coffman, Suman Jana
ACM Computer and Communication Security (CCS) 2022
Honorable Mention for Best Paper Award
Teaching
I have served as a teaching assistant for the following course offerings
CS 5030 Algorithms for Big Data (Fall 2025 + Spring 2026, UPenn)
CS 4232 Advanced Algorithms (Spring 2024, Columbia)
CS 4236 Computational Complexity (Fall 2023, Columbia)
CS 4231 Analysis of Algorithms (Fall 2022 + Spring 2023, Columbia)