| Publication | Date of Publication | Type |
|---|
| Energy complexity of regular languages | 2024-02-23 | Paper |
| Real-time, constant-space, constant-randomness verifiers | 2023-10-17 | Paper |
| Constant-space, constant-randomness verifiers with arbitrarily small error | 2022-10-13 | Paper |
| Advice hierarchies among finite automata | 2022-10-13 | Paper |
| Real-time, constant-space, constant-randomness verifiers | 2022-08-16 | Paper |
| Energy complexity of regular language recognition | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016373 | 2021-12-13 | Paper |
| New results on vector and homing vector automata | 2019-12-19 | Paper |
| The weakness of CTC qubits and the power of approximate counting | 2019-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232904 | 2019-09-13 | Paper |
| Language classes associated with automata over matrix groups | 2019-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560202 | 2018-12-10 | Paper |
| One time-traveling bit is as good as logarithmically many | 2017-04-25 | Paper |
| Homing vector automata | 2017-03-24 | Paper |
| Debates with small transparent quantum verifiers | 2016-06-23 | Paper |
| Computation with multiple CTCs of fixed length and width | 2016-03-09 | Paper |
| Optimal bounds for estimating entropy with PMF queries | 2015-09-16 | Paper |
| Quantum finite automata: a modern introduction | 2015-09-08 | Paper |
| The complexity of debate checking | 2015-09-04 | Paper |
| Finite automata with advice tapes | 2015-04-23 | Paper |
| Debates with small transparent quantum verifiers | 2014-10-14 | Paper |
| TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES | 2014-07-04 | Paper |
| Real-time vector automata | 2013-08-16 | Paper |
| Finite automata with advice tapes | 2013-06-28 | Paper |
| Proving the power of postselection | 2013-04-18 | Paper |
| Quantum counter automata | 2013-01-18 | Paper |
| Quantum computation with write-only memory | 2012-11-15 | Paper |
| Finite state verifiers with constant randomness | 2012-08-14 | Paper |
| A new family of nonstochastic languages | 2012-01-18 | Paper |
| Languages recognized by nondeterministic quantum finite automata | 2011-10-05 | Paper |
| Models of pushdown automata with reset | 2011-07-29 | Paper |
| Unbounded-error quantum computation with small space bounds | 2011-07-08 | Paper |
| Computation with Narrow CTCs | 2011-06-17 | Paper |
| Quantum computation with devices whose contents are never read | 2010-07-26 | Paper |
| Languages Recognized with Unbounded Error by Quantum Finite Automata | 2009-08-18 | Paper |
| Efficient probability amplification in two-way quantum finite automata | 2009-05-19 | Paper |
| Causes of ineradicable spurious predictions in qualitative simulation | 2009-04-28 | Paper |
| Sound and complete qualitative simulation is impossible | 2006-02-07 | Paper |
| Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4435131 | 2003-11-26 | Paper |
| Sound and complete qualitative simulation needs ``quantitative filtering | 2003-06-09 | Paper |
| Duration consistency filtering for qualitative simulation | 2003-06-09 | Paper |
| Problems in representing liquid tanks with monotonicity constraints: A case study in model-imposed limitations on the coverage of qualitative simulators | 2002-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139197 | 1994-09-20 | Paper |
