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 |
|---|---|---|
| A unified method for placing problems in polylogarithmic depth | 2020-11-25 | Paper |
| Visibly counter languages and constant depth circuits | 2017-01-24 | Paper |
| Cost register automata for nested words Lecture Notes in Computer Science | 2016-09-02 | Paper |
| Positive and negative proofs for circuits and branching programs Theoretical Computer Science | 2015-12-10 | Paper |
| On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\) Developments in Language Theory | 2015-11-10 | Paper |
| A circuit complexity approach to transductions Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
| Visibly counter languages and the structure of \(\mathrm {NC}^{1}\) Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
| Positive and negative proofs for circuits and branching programs Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Research outcomes over time
This page was built for person: Michael Ludwig
