5 citations · 6 across the 8 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
Jason Li, Connor Mowry, Satish Rao
We present a faster algorithm for low-diameter decompositions on directed graphs, matching the loss factor from Bringmann, Fischer, Haeupler, and Latypov (ICA…
cs.CL2025
Error Reflection Prompting: Can Large Language Models Successfully Understand Errors?
Jason Li, Lauren Yraola, Kevin Zhu +1
Prompting methods for language models, such as Chain-of-thought (CoT), present intuitive step-by-step processes for problem solving. These methodologies aim to equip models with a…
cs.DS2025
Simpler and Faster Directed Low-Diameter Decompositions
Jason Li
We present a simpler and faster algorithm for low-diameter decompositions on directed graphs, matching the loss factor from Bringmann, Fischer, Haeupler, and…