| 2025 | CiE | Alternation-Bounded Semi-unbounded Fan-in Cascading Circuits and the Complementation Closure Property. | Tomoyuki Yamakami |
| 2025 | FCT | Quantum First-Order Logics and Quantum Natural Deduction. | Tomoyuki Yamakami |
| 2025 | UC | Machine Learning by Adiabatic Evolutionary Quantum Systems - (Preliminary Report). | Tomoyuki Yamakami |
| 2024 | CiE | Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability. | Tomoyuki Yamakami |
| 2024 | TAMC | Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. | Tomoyuki Yamakami |
| 2024 | WoLLIC | Logical Expressibility of Syntactic NL for Complementarity and Maximization. | Tomoyuki Yamakami |
| 2023 | FCT | Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. | Tomoyuki Yamakami |
| 2022 | COCOON | Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). | Tomoyuki Yamakami |
| 2022 | DLT | Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata. | Tomoyuki Yamakami |
| 2022 | ICTAC | Formal Grammars for Turn-Bounded Deterministic Context-Free Languages. | Tomoyuki Yamakami |
| 2022 | WoLLIC | Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability. | Tomoyuki Yamakami |
| 2021 | ADMA | Fuzzy Kolmogorov Complexity Based on Fuzzy Decompression Algorithms and Its Application to Fuzzy Data Mining - (Preliminary Report). | Tomoyuki Yamakami |
| 2021 | COCOON | Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. | Tomoyuki Yamakami |
| 2021 | UC | Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum Finite-State Transducers (Preliminary Report). | Tomoyuki Yamakami |
| 2020 | LATA | Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. | Tomoyuki Yamakami |
| 2020 | MFCS | Synchronizing Deterministic Push-Down Automata Can Be Really Hard. | Henning Fernau, Petra Wolf, Tomoyuki Yamakami |
| 2019 | LATA | Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. | Tomoyuki Yamakami |
| 2019 | SOFSEM | Behavioral Strengths and Weaknesses of Various Models of Limited Automata. | Tomoyuki Yamakami |
| 2019 | TAMC | Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P. | Tomoyuki Yamakami |
| 2019 | UC | Relativizations of Nonuniform Quantum Finite Automata Families. | Tomoyuki Yamakami |
| 2017 | DLT | One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report). | Tomoyuki Yamakami |
| 2017 | MFCS | The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. | Tomoyuki Yamakami |
| 2015 | DLT | Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract). | Tomoyuki Yamakami |
| 2014 | SOFSEM | Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. | Tomoyuki Yamakami |
| 2013 | COCOA | Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems. | Tomoyuki Yamakami |
| 2012 | ISAAC | Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. | Tomoyuki Yamakami |
| 2012 | LATA | One-Way Reversible and Quantum Finite Automata with Advice. | Tomoyuki Yamakami |
| 2011 | COCOON | Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems. | Tomoyuki Yamakami |
| 2011 | ISAAC | Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. | Tomoyuki Yamakami |
| 2010 | COCOA | A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs. | Tomoyuki Yamakami |
| 2010 | WAOA | Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems. | Tomoyuki Yamakami |
| 2009 | ISAAC | The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract). | Tomoyuki Yamakami |
| 2006 | ICALP | Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. | Akinori Kawachi, Tomoyuki Yamakami |
| 2005 | EuroCrypt | Computational Indistinguishability Between Quantum States and Its Cryptographic Application. | Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami |
| 2005 | FCT | Collapsing Recursive Oracles for Relativized Polynomial Hierarchies. | Tomoyuki Yamakami |
| 2004 | MFCS | An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). | Harumichi Nishimura, Tomoyuki Yamakami |
| 2004 | SOFSEM | Theory of One Tape Linear Time Turing Machines. | Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin |
| 2003 | CIAC | Nearly Bounded Error Probabilistic Sets. | Tomoyuki Yamakami |
| 2003 | ISAAC | Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? | Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
| 2003 | ISAAC | Computational Complexity Measures of Multipartite Quantum Entanglement. | Tomoyuki Yamakami |
| 2002 | COCOON | Quantum DNF Learnability Revisited. | Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami |
| 1999 | MFCS | A Foundation of Programming a Multi-tape Quantum Turing Machine. | Tomoyuki Yamakami |
| 1996 | MFCS | Polynomial Time Samplable Distributions. | Tomoyuki Yamakami |
| 1995 | COCOON | Sets Computable in Polynomial Time on Average. | Rainer Schuler, Tomoyuki Yamakami |