Nathan Grosshans

12 papers A 1B 2C 1Journal 7
YearRankTypeTitle / Venue / Authors
2024 A conf
The AC⁰-Complexity of Visibly Pushdown Languages.
STACS
Stefan Göller, Nathan Grosshans
2023 J jnl
The AC
CoRR
Stefan Göller, Nathan Grosshans
2022 J jnl
Tameness and the power of programs over monoids in DA.
Log. Methods Comput. Sci.
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2021 B conf
A Note on the Join of Varieties of Monoids with LI.
MFCS
Nathan Grosshans
2021 J jnl
A note on the join of varieties of monoids with LI.
CoRR
Nathan Grosshans
2021 J jnl
Tameness and the power of programs over monoids in DA.
CoRR
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2020 C conf
The Power of Programs over Monoids in J.
LATA
Nathan Grosshans
2019 J jnl
The Power of Programs over Monoids in J.
CoRR
Nathan Grosshans
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
2017 B conf
The Power of Programs over Monoids in DA.
MFCS
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2016 J jnl
Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method.
ACM Trans. Comput. Theory
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2016 J jnl
Nondeterminism and an abstract formulation of Nečiporuk's lower bound method.
CoRR
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin