Computation with Absolutely No Space Overhead. - Lane A. Hemaspaandra; Proshanto Mukherji; Till Tantau (Developments in Language Theory, 2003)

Overhead-Free Computation, DCFLs, and CFLs - Lane A. Hemaspaandra; Proshanto Mukherji; Till Tantau (CoRR, 2004)

Discovering Planning Invariants as Anomalies in State Descriptions. - Proshanto Mukherji; Lenhart K. Schubert (ICAPS, 2005)

Context-free languages can be accepted with absolutely no space overhead. - Lane A. Hemaspaandra; Proshanto Mukherji; Till Tantau (Inf. Comput., 2005)

State-based Discovery and Verification of Propositional Planning Invariants. - Lenhart K. Schubert; Proshanto Mukherji (IC-AI, 2006)