Nathan Grosshans
7
Documents
Identifiants chercheurs
nathan-grosshans-
0000-0003-3400-1098
Présentation
Publications
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
|
|
Tameness and the power of programs over monoids in DALogical Methods in Computer Science, 2022, 18 (3), pp.14:1-14:34. ⟨10.46298/lmcs-18(3:14)2022⟩
Article dans une revue
hal-03114304v3
|
|
|
Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound MethodACM Transactions on Computation Theory, 2016, 9 (1), pp.1-34. ⟨10.1145/3013516⟩
Article dans une revue
hal-01426213v1
|
|
|
A Note on the Join of Varieties of Monoids with LI46th 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
|
|
|
The Power of Programs over Monoids in JLATA 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
|
|
|
The Power of Programs over Monoids in DA42nd 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
|
|
|
The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages2023
Pré-publication, Document de travail
hal-04005294v2
|
|
|
The Power of Programs over Monoids in J and Threshold Dot-depth One Languages2021
Pré-publication, Document de travail
hal-03157113v1
|