7 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2025
How fast are algorithms reducing the demands on memory? A survey of progress in space complexity
Hayden Rome, Jayson Lynch, Jeffery Li +2
Algorithm research focuses primarily on how many operations processors need to do (time complexity). But for many problems, both the runtime and energy used are dominated by memory…
cs.CC2023
A Collapsible Polynomial Hierarchy for Promise Problems
Chirag Falor, Shu Ge, Anand Natarajan
The polynomial hierarchy has been widely studied in classical complexity theory. In this paper, we will generalize some commonly known results about the polynomial hierarchy to a v…
gr-qc2022★ 7 cited
The Quadruple Image Configurations of Asymptotically Circular Gravitational Lenses
Chirag Falor, Paul L. Schechter
The quadruple image configurations of gravitational lenses with vanishing ellipticity are examined. Even though such lenses asymptotically approach circularity, the configurations…