Nathan Grosshans

Paul Beame, Nathan Grosshans, Pierre Mckenzie, Luc Segoufin. Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method. ACM Transactions on Computation Theory, ACM, 2016, 9 (1), pp.1 - 34. ⟨10.1145/3013516⟩. ⟨hal-01426213⟩

Nathan Grosshans. A Note on the Join of Varieties of Monoids with LI. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. pp.51:1--51:16, ⟨10.4230/LIPIcs.MFCS.2021.51⟩. ⟨hal-03183838v3⟩

Nathan Grosshans. The Power of Programs over Monoids in J. LATA 2020 - 14th International Conference on Language and Automata Theory and Applications, Mar 2020, Milan, Italy. ⟨10.1007/978-3-030-40608-0_22⟩. ⟨hal-02414771⟩

Nathan Grosshans, Pierre Mckenzie, Luc Segoufin. The Power of Programs over Monoids in DA. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.2⟩. ⟨hal-02303526⟩

Nathan Grosshans, Pierre Mckenzie, Luc Segoufin. Tameness and the power of programs over monoids in DA. 2022. ⟨hal-03114304v3⟩

Nathan Grosshans. The Power of Programs over Monoids in J and Threshold Dot-depth One Languages. 2021. ⟨hal-03157113⟩