BOOM 2024 - Wordle Solver
Faster and more general algorithms for Wordle 
Posts by Collection
portfolio
Engineering Course Evaluations
Collecting insights across 10,000 evluations summaries with simple display 
Flaky Test Experience
Automatic assertion detection and instrumentation for flakiness reduction 
h-index visualization
Visualizer for h-index and citations over time for any researcher since inception. 
Healer
Android App for the elderly - fall detection, emergency calling, medication reminders 
Image Processor
C++ image editor for TGA images with multiple blending modes 
M3 Challenge
Math modeling on remote work prevalence 
McDiver
Explore-exploit tradeoff in Java sewer game 
Cornell Nexus
Project Team work in vision and turning algorithms along with fast testing. 
Sudoku in OCaml
Diagonal Sudoku with hints 
Math Test Writing
~100 original questions in the areas of Complex Numbers and Matrices & Vectors 
publications
Using Video Analytics to Improve Traffic Intersection Safety and Performance
Ahan Mishra, Ke Chen, Subhadipto Poddar, Emmanuel Posadas, Anand Rangarajan, and Sanjay Ranka
Published in MDPI Vehicles, 2022
This paper proposes a method to evaluate proposals to increase intersection safety and achieves 80% reduction in dangerous instances at a local intersection.
Video-based Pedestrian and Vehicle Traffic Analysis During Football Games
Jacques P. Fleischer, Ryan Pallack, Ahan Mishra, Gustavo Riente De Andrade, Subhadipto Poddar, and Emmanuel Posadas
Published in IEEE ITSC, 2024
This paper analyzes traffic incident rates during gamedays and improves understanding of correlation between types of games and possible accidents.
An Optimal Density Bound for Discretized Point Patrolling
Ahan Mishra
Published in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026
This paper proves an optimal theoretical bound for discretized point patrolling (a 10 year old open problem) as well as an improved algorithm for bamboo garden trimming, with extensible techniques in both cases.
NP-Hardness and a PTAS for the Pinwheel Problem
Robert Kleinberg, Ahan Mishra
Published in IEEE Symposium on Foundations of Computer Science (FOCS), 2026
This paper proves NP-hardness of pinwheel scheduling (a 37 year old open problem) using new techniques and establishes a PTAS approximation algorithm, improving on the previous best which was a constant-factor approximation.
talks
teaching
Data Structures TA
CS 2110, Cornell University, CS Department, 2024
Graded exams and held consulting hours for Object-Oriented Programming and Data Structures with Professor Curran Muhlberger.
Algorithms TA
CS 4820, Cornell University, CS Department, 2024
Held office hours, graded assignments and exams and facilitated partner matching for Introduction to Analysis of Algorithms with Professor Anke van Zuylen.
Machine Learning TA
CS 3780, Cornell University, CS Department, 2025
Held office hours, graded assignments and exams and assisted Kaggle competition creation for Introduction to Machine Learning with Professor Karthik Sridharan.
Artificial Intelligence TA
CS 3700, Cornell University, CS Department, 2025
Soon to work as a Teaching Assistant for Foundations of AI Reasoning and Decision-Making for Professor Bart Selman.