Nathan Grosshans

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 11

Top Topics

Top Venues

ACM Trans. Comput. Theory

Log. Methods Comput. Sci.

University of Paris-Saclay, France (PHD)

Education History

University of Paris-Saclay, France

PHD

Publications

Stefan Göller, Nathan Grosshans
The AC⁰-Complexity of Visibly Pushdown Languages. STACS (2024)
Stefan Göller, Nathan Grosshans
-Complexity Of Visibly Pushdown Languages. CoRR (2023)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Tameness and the power of programs over monoids in DA. Log. Methods Comput. Sci. 18 (3) (2022)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Tameness and the power of programs over monoids in DA. CoRR (2021)
Nathan Grosshans
A Note on the Join of Varieties of Monoids with LI. MFCS (2021)
Nathan Grosshans
A note on the join of varieties of monoids with LI. CoRR (2021)
Nathan Grosshans
The Power of Programs over Monoids in [inline-graphic not available: see fulltext]. LATA (2020)
Nathan Grosshans
The Power of Programs over Monoids in J. CoRR (2019)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
The Power of Programs over Monoids in DA. MFCS (2017)
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Nondeterminism and an abstract formulation of Nečiporuk's lower bound method. CoRR (2016)
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. ACM Trans. Comput. Theory 9 (1) (2016)