Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. - Paul Beame; Nathan Grosshans; Pierre McKenzie; Luc Segoufin (ACM Trans. Comput. Theory, 2016)

The Power of Programs over Monoids in DA. - Nathan Grosshans; Pierre McKenzie; Luc Segoufin (MFCS, 2017)

The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. (Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis). - Nathan Grosshans (2018)

The Power of Programs over Monoids in J. - Nathan Grosshans (CoRR, 2019)

The Power of Programs over Monoids in [inline-graphic not available: see fulltext]. - Nathan Grosshans (LATA, 2020)

A Note on the Join of Varieties of Monoids with LI. - Nathan Grosshans (MFCS, 2021)

Tameness and the power of programs over monoids in DA. - Nathan Grosshans; Pierre McKenzie; Luc Segoufin (Log. Methods Comput. Sci., 2022)

The AC0-Complexity Of Visibly Pushdown Languages. - Stefan Göller; Nathan Grosshans (CoRR, 2023)

The AC⁰-Complexity of Visibly Pushdown Languages. - Stefan Göller; Nathan Grosshans (STACS, 2024)