Nathan Grosshans

According to our database, Nathan Grosshans authored at least 9 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The AC⁰-Complexity of Visibly Pushdown Languages.

Stefan Göller, Nathan Grosshans

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

The AC⁰-Complexity Of Visibly Pushdown Languages.

Stefan Göller, Nathan Grosshans

CoRR, 2023

2022

Tameness and the power of programs over monoids in DA.

Nathan Grosshans, Pierre McKenzie, Luc Segoufin

Log. Methods Comput. Sci., 2022

2021

A Note on the Join of Varieties of Monoids with LI.

Nathan Grosshans

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

The Power of Programs over Monoids in [inline-graphic not available: see fulltext].

Nathan Grosshans

Proceedings of the Language and Automata Theory and Applications, 2020

2019

The Power of Programs over Monoids in J.

Nathan Grosshans

CoRR, 2019

2018

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

PhD thesis, 2018

2017

The Power of Programs over Monoids in DA.

Nathan Grosshans, Pierre McKenzie, Luc Segoufin

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

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