Nathan Grosshans
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The \(\mathsf{AC}^0\)-complexity of visibly pushdown languages Logical Methods in Computer Science | 2026-09-16 | Paper |
| The \(\text{AC}^0\)-complexity of visibly pushdown languages | 2025-11-10 | Paper |
| scientific article; zbMATH DE number 7724224 (Why is no real title available?) (available as arXiv preprint) | 2023-08-08 | Paper |
| Tameness and the power of programs over monoids in \(\mathbf{DA}\) (available as arXiv preprint) | 2022-08-30 | Paper |
| Tameness and the power of programs over monoids in \(\mathbf{DA}\) | 2022-08-30 | Paper |
| The power of programs over monoids in \textbf{J} | 2020-07-27 | Paper |
| The power of programs over monoids in DA (available as arXiv preprint) | 2020-05-26 | Paper |
| Nondeterminism and an abstract formulation of Nečiporuk's lower bound method ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Research outcomes over time
This page was built for person: Nathan Grosshans
