Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (FSTTCS, 2014)

Min/Max-Poly Weighting Schemes and the NL versus UL Problem. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (ACM Trans. Comput. Theory, 2017)

UTIME Easy-witness Lemma & Some Consequences. - Anant Dhayal; Russell Impagliazzo (Electron. Colloquium Comput. Complex., 2019)

On Limiting & Limited Non-determinism in NEXP Lower Bounds. - Anant Dhayal (2021)