| Publication | Date of Publication | Type |
|---|
| Determinism and Nondeterminism in Finite Automata with Advice | 2023-06-30 | Paper |
| Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations | 2022-11-09 | Paper |
| E-complete sets do not have optimal polynomial time approximations | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089196 | 2022-07-18 | Paper |
| Tight hierarchy of data-independent multi-head automata | 2020-09-07 | Paper |
| Sensing versus nonsensing automata | 2019-01-10 | Paper |
| Optimal lower bounds on the multiparty communication complexity | 2017-12-04 | Paper |
| Flip-pushdown automata with \(k\) pushdown reversals and E0L systems are incomparable | 2014-04-30 | Paper |
| On Computational Power of Partially Blind Automata | 2013-12-11 | Paper |
| On multi-partition communication complexity | 2004-11-12 | Paper |
| On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata | 2004-08-10 | Paper |
| Multiparty communication complexity and very hard functions | 2004-08-06 | Paper |
| On the computational complexity of infinite words. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779155 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762506 | 2002-01-09 | Paper |
| Lower bounds on the multiparty communication complexity | 1998-12-08 | Paper |
| CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED | 1995-10-29 | Paper |
| A note on the density of oracle decreasing time-space complexity | 1994-09-25 | Paper |
| On the power of multiple reads in a chip | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036605 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974862 | 1992-06-26 | Paper |
| Semelectivity is not sufficient | 1991-01-01 | Paper |
| Two lower bounds in asynchronous distributed computation | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732118 | 1989-01-01 | Paper |
| A minimum-area circuit for \(\ell\)-selection | 1987-01-01 | Paper |
| Lower bounds on communication complexity | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3756527 | 1987-01-01 | Paper |
| Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711746 | 1985-01-01 | Paper |
| A time-space tradeoff for language recognition | 1984-01-01 | Paper |
| Two Tapes are Better than One for Nondeterministic Machines | 1984-01-01 | Paper |
| Two nonlinear lower bounds for on-line computations | 1984-01-01 | Paper |
| One-way simple multihead finite automata are not closed under concatenation | 1983-01-01 | Paper |
| Fooling a two way automaton or one pushdown store is better than one counter for two way machines | 1982-01-01 | Paper |
| On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945613 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945614 | 1982-01-01 | Paper |
