3 papers
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…
quant-ph2025
Non-iid hypothesis testing: from classical to quantum
Giacomo De Palma, Marco Fanizza, Connor Mowry +1
We study hypothesis testing (aka state certification) in the non-identically distributed setting. A recent work (Garg et al. 2023) considered the classical case, in which one is gi…
cs.DS2024
A Bottom-Up Algorithm for Negative-Weight SSSP with Integrated Negative Cycle Finding
Jason Li, Connor Mowry
We present a simplified algorithm for solving the Negative-Weight Single-Source Shortest Paths (SSSP) problem, focusing on enhancing clarity and practicality over prior methods. Ou…