| Publication | Date of Publication | Type |
|---|
| Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions | 2024-11-29 | Paper |
| Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters | 2024-11-12 | Paper |
| Power of counting by nonuniform families of polynomial-size finite automata | 2024-05-29 | Paper |
| Synchronizing deterministic push-down automata can be really hard | 2024-02-02 | Paper |
| Sets computable in polynomial time on average | 2023-12-12 | Paper |
| Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract) | 2023-08-10 | Paper |
| Formal grammars for turn-bounded deterministic context-free languages | 2023-07-28 | Paper |
| Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata | 2023-07-21 | Paper |
| The 2CNF Boolean formula satisfiability problem and the linear space hypothesis | 2023-06-12 | Paper |
| Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability | 2023-06-02 | Paper |
| Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata | 2023-03-30 | Paper |
| Synchronizing words for real-time deterministic pushdown automata (extended abstract) | 2022-10-07 | Paper |
| Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata | 2022-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089200 | 2022-07-18 | Paper |
| Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) | 2022-07-06 | Paper |
| Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice | 2022-06-13 | Paper |
| How does adiabatic quantum computation fit into quantum automata theory? | 2022-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4988166 | 2021-05-12 | Paper |
| A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY | 2021-04-15 | Paper |
| Behavioral strengths and weaknesses of various models of limited automata | 2020-10-22 | Paper |
| Intersection and union hierarchies of deterministic context-free languages and pumping lemmas | 2020-07-27 | Paper |
| State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis | 2020-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111278 | 2020-05-26 | Paper |
| How does adiabatic quantum computation fit into quantum automata theory? | 2020-05-12 | Paper |
| Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice | 2019-12-04 | Paper |
| State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis | 2019-11-07 | Paper |
| Supportive oracles for parameterized polynomial-time sub-linear-space computations in relation to L, NL, and P | 2019-10-15 | Paper |
| Relativizations of nonuniform quantum finite automata families | 2019-10-10 | Paper |
| Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report) | 2017-12-20 | Paper |
| One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report) | 2017-10-13 | Paper |
| Pseudorandom generators against advised context-free languages | 2015-12-28 | Paper |
| Complexity Bounds of Constant-Space Quantum Computation | 2015-11-10 | Paper |
| Counting List Matrix Partitions of Graphs | 2015-09-02 | Paper |
| Quantum State Complexity of Formal Languages | 2015-08-07 | Paper |
| Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems | 2015-02-05 | Paper |
| Interactive proofs with quantum finite automata | 2015-01-28 | Paper |
| Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages | 2015-01-13 | Paper |
| One-way reversible and quantum finite automata with advice | 2014-11-28 | Paper |
| Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract) | 2014-09-15 | Paper |
| Constant-space quantum interactive proofs against multiple provers | 2014-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414574 | 2014-05-06 | Paper |
| Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems | 2013-12-10 | Paper |
| Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs | 2013-03-21 | Paper |
| The dissecting power of regular languages | 2013-03-20 | Paper |
| Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems | 2012-11-27 | Paper |
| Approximate counting for complex-weighted Boolean constraint satisfaction problems | 2012-11-27 | Paper |
| A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs | 2012-08-13 | Paper |
| Computational indistinguishability between quantum states and its cryptographic application | 2012-07-10 | Paper |
| One-way reversible and quantum finite automata with advice | 2012-06-08 | Paper |
| Immunity and pseudorandomness of context-free languages | 2012-01-09 | Paper |
| Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems | 2011-12-16 | Paper |
| Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems | 2011-08-17 | Paper |
| Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding | 2011-04-04 | Paper |
| Approximate counting for complex-weighted Boolean constraint satisfaction problems | 2011-02-15 | Paper |
| THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA | 2011-01-19 | Paper |
| A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs | 2011-01-08 | Paper |
| The roles of advice to one-tape linear-time Turing machines and finite automata (extended abstract) | 2009-12-17 | Paper |
| Theory of one-tape linear-time Turing machines | 2009-12-01 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Polynomial time quantum computation with advice | 2009-07-21 | Paper |
| SOFSEM 2004: Theory and Practice of Computer Science | 2009-06-04 | Paper |
| An application of quantum finite automata to interactive proof systems | 2009-04-30 | Paper |
| The efficiency of quantum identity testing of multiple states | 2008-10-21 | Paper |
| Computational Indistinguishability Between Quantum States and Its Cryptographic Application | 2008-05-06 | Paper |
| Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding | 2007-09-11 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Resource bounded immunity and simplicity | 2005-12-29 | Paper |
| ANALYSIS OF QUANTUM FUNCTIONS | 2005-10-19 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673395 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808682 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437109 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437510 | 2003-12-02 | Paper |
| \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707540 | 2001-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501686 | 2000-09-04 | Paper |
| Polynomial time samplable distributions | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941921 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375820 | 1998-02-08 | Paper |
| A tight relationship between generic oracles and type-2 complexity theory | 1997-10-07 | Paper |
| Structural average case complexity | 1997-01-27 | Paper |
| Polynomial games and determinacy | 1996-07-23 | Paper |
| Generic separations | 1996-07-16 | Paper |
| Feasible computability and resource bounded topology | 1995-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4025000 | 1993-02-22 | Paper |
| Structural properties for feasibly computable classes of type two | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5752559 | 1989-01-01 | Paper |
