Nathan Grosshans

7
Documents
Identifiants chercheurs

Présentation

Publications

1
1
2
1
1
1
3
1
1
1
1
1
1
1

Publications

Deposit thumbnail

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages

Stefan Göller , Nathan Grosshans

41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Mar 2024, Clermont-Ferrand, France. pp.38:1-38:18, ⟨10.4230/LIPIcs.STACS.2024.38⟩

Communication dans un congrès hal-04005294v2
Deposit thumbnail

A Note on the Join of Varieties of Monoids with LI

Nathan Grosshans

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⟩

Communication dans un congrès hal-03183838v3
Deposit thumbnail

The Power of Programs over Monoids in J

Nathan Grosshans

LATA 2020 - 14th International Conference on Language and Automata Theory and Applications, Mar 2020, Milan, Italy. pp.315-327, ⟨10.1007/978-3-030-40608-0_22⟩

Communication dans un congrès hal-02414771v1
Deposit thumbnail

The Power of Programs over Monoids in DA

Nathan Grosshans , Pierre Mckenzie , Luc Segoufin

42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. pp.2:1-2:20, ⟨10.4230/LIPIcs.MFCS.2017.2⟩

Communication dans un congrès hal-02303526v1