Structural Properties for Feasibly Computable Classes of Type Two. - Tomoyuki Yamakami (Math. Syst. Theory, 1992)

Sets Computable in Polynomial Time on Average. - Rainer Schuler; Tomoyuki Yamakami (COCOON, 1995)

Feasible Computability and Resource Bounded Topology - Tomoyuki Yamakami (Inf. Comput., 1995)

Polynomial Games and Determinacy. - Tomoyuki Yamakami (Ann. Pure Appl. Log., 1996)

Generic Separations. - Lance Fortnow; Tomoyuki Yamakami (J. Comput. Syst. Sci., 1996)

Structural Average Case Complexity. - Rainer Schuler; Tomoyuki Yamakami (J. Comput. Syst. Sci., 1996)

A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. - Stephen A. Cook; Russell Impagliazzo; Tomoyuki Yamakami (Inf. Comput., 1997)

Average case computational complexity theory. - Tomoyuki Yamakami (1997)

NQP = co-C=P - Tomoyuki Yamakami; Andrew Chi-Chih Yao (Electron. Colloquium Comput. Complex., 1998)

Analysis of Quantum Functions (Preliminary Version). - Tomoyuki Yamakami (FSTTCS, 1999)

A Foundation of Programming a Multi-tape Quantum Turing Machine. - Tomoyuki Yamakami (MFCS, 1999)

NQPC = co-C=P. - Tomoyuki Yamakami; Andrew Chi-Chih Yao (Inf. Process. Lett., 1999)

Polynomial Time Samplable Distributions. - Tomoyuki Yamakami (J. Complex., 1999)

Quantum Computation Relative to Oracles. - Christino Tamon; Tomoyuki Yamakami (UMC, 2000)

Quantum Certificate Verification: Single versus Multiple Quantum Certificates - Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami (CoRR, 2001)

Quantum DNF Learnability Revisited. - Jeffrey C. Jackson; Christino Tamon; Tomoyuki Yamakami (COCOON, 2002)

Quantum NP and Quantum Hierarchy. - Tomoyuki Yamakami (IFIP TCS, 2002)

Quantum Optimization Problems. - Tomoyuki Yamakami (UMC, 2002)

Nearly Bounded Error Probabilistic Sets. - Tomoyuki Yamakami (CIAC, 2003)

Computational Complexity Measures of Multipartite Quantum Entanglement. - Tomoyuki Yamakami (ISAAC, 2003)

An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation - Harumichi Nishimura; Tomoyuki Yamakami (CoRR, 2003)

Analysis Of Quantum Functions. - Tomoyuki Yamakami (Int. J. Found. Comput. Sci., 2003)

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). - Harumichi Nishimura; Tomoyuki Yamakami (MFCS, 2004)

Polynomial time quantum computation with advice. - Harumichi Nishimura; Tomoyuki Yamakami (Inf. Process. Lett., 2004)

Collapsing Recursive Oracles for Relativized Polynomial Hierarchies. - Tomoyuki Yamakami (FCT, 2005)

Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks - Harumichi Nishimura; Tomoyuki Yamakami (CoRR, 2005)

Resource bounded immunity and simplicity. - Tomoyuki Yamakami; Toshio Suzuki (Theor. Comput. Sci., 2005)

Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. - Tomoyuki Yamakami (CATS, 2007)

Swapping Lemmas for Regular and Context-Free Languages with Advice - Tomoyuki Yamakami (CoRR, 2008)

The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract). - Tomoyuki Yamakami (ISAAC, 2009)

Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? - Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami (Chic. J. Theor. Comput. Sci., 2009)

Pseudorandom Generators against CFL/n - Tomoyuki Yamakami (CoRR, 2009)

An application of quantum finite automata to interactive proof systems. - Harumichi Nishimura; Tomoyuki Yamakami (J. Comput. Syst. Sci., 2009)

A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs. - Tomoyuki Yamakami (COCOA (1), 2010)

The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata. - Tomoyuki Yamakami (Int. J. Found. Comput. Sci., 2010)

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. - Akinori Kawachi; Tomoyuki Yamakami (SIAM J. Comput., 2010)

Theory of one-tape linear-time Turing machines. - Kohtaro Tadaki; Tomoyuki Yamakami; Jack C. H. Lin (Theor. Comput. Sci., 2010)

Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. - Tomoyuki Yamakami (ISAAC, 2011)

Immunity and pseudorandomness of context-free languages. - Tomoyuki Yamakami (Theor. Comput. Sci., 2011)

Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. - Tomoyuki Yamakami (ISAAC, 2012)

Approximate counting for complex-weighted Boolean constraint satisfaction problems. - Tomoyuki Yamakami (Inf. Comput., 2012)

Computational Indistinguishability Between Quantum States and Its Cryptographic Application. - Akinori Kawachi; Takeshi Koshiba; Harumichi Nishimura; Tomoyuki Yamakami (J. Cryptol., 2012)

A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs. - Tomoyuki Yamakami (Theor. Comput. Sci., 2012)

Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. - Tomoyuki Yamakami (Theor. Comput. Sci., 2012)

Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems. - Tomoyuki Yamakami (COCOA, 2013)

A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction. - Tomoyuki Yamakami (CoRR, 2013)

The dissecting power of regular languages. - Tomoyuki Yamakami; Yuichi Kato (Inf. Process. Lett., 2013)

Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata. - Tomoyuki Yamakami (ICTCS, 2014)

Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract). - Tomoyuki Yamakami (IFIP TCS, 2014)

The world of combinatorial fuzzy problems and the efficiency of fuzzy approximation algorithms. - Tomoyuki Yamakami (SCIS&ISIS, 2014)

Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. - Tomoyuki Yamakami (SOFSEM, 2014)

Quantum and Reversible Verification of Proofs Using Constant Memory Space. - Marcos Villagra; Tomoyuki Yamakami (TPNC, 2014)

One-way reversible and quantum finite automata with advice. - Tomoyuki Yamakami (Inf. Comput., 2014)

Constant-space quantum interactive proofs against multiple provers. - Tomoyuki Yamakami (Inf. Process. Lett., 2014)

Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems. - Tomoyuki Yamakami (Theory Comput. Syst., 2014)

Quantum State Complexity of Formal Languages. - Marcos Villagra; Tomoyuki Yamakami (DCFS, 2015)

Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract). - Tomoyuki Yamakami (DLT, 2015)

Straight Construction of Non-Interactive Quantum Bit Commitment Schemes from Indistinguishable Quantum State Ensembles. - Tomoyuki Yamakami (TPNC, 2015)

Counting List Matrix Partitions of Graphs. - Andreas Göbel 001; Leslie Ann Goldberg; Colin McQuillan; David Richerby; Tomoyuki Yamakami (SIAM J. Comput., 2015)

Interactive proofs with quantum finite automata. - Harumichi Nishimura; Tomoyuki Yamakami (Theor. Comput. Sci., 2015)

Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords. - Tomoyuki Yamakami (Balt. J. Mod. Comput., 2016)

Complexity Bounds of Constant-Space Quantum Computation. - Tomoyuki Yamakami (CoRR, 2016)

Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions. - Tomoyuki Yamakami (CoRR, 2016)

Pseudorandom generators against advised context-free languages. - Tomoyuki Yamakami (Theor. Comput. Sci., 2016)

One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report). - Tomoyuki Yamakami (DLT, 2017)

A recursive definition of quantum polynomial time computability (extended abstract). - Tomoyuki Yamakami (NCMA, 2017)

Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report). - Tomoyuki Yamakami (RP, 2017)

Behavioral Strengths and Weaknesses of Various Models of Limited Automata. - Tomoyuki Yamakami (SOFSEM, 2019)

Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P. - Tomoyuki Yamakami (TAMC, 2019)

Relativizations of Nonuniform Quantum Finite Automata Families. - Tomoyuki Yamakami (UCNC, 2019)

State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. - Tomoyuki Yamakami (Theor. Comput. Sci., 2019)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. - Tomoyuki Yamakami (LATA, 2020)

One-Way Topological Automata and the Tantalizing Effects of Their Topological Features. - Tomoyuki Yamakami (J. Autom. Lang. Comb., 2020)

A Schematic Definition of quantum Polynomial Time Computability. - Tomoyuki Yamakami (J. Symb. Log., 2020)

Fuzzy Kolmogorov Complexity Based on Fuzzy Decompression Algorithms and Its Application to Fuzzy Data Mining - (Preliminary Report). - Tomoyuki Yamakami (ADMA, 2021)

Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. - Tomoyuki Yamakami (COCOON, 2021)

Synchronizing Words for Real-Time Deterministic Pushdown Automata - Extended Abstract. - Tomoyuki Yamakami; Eitatsu Mikami (ICMC, 2021)

Nondeterministically Selecting Positive Instances of Context-Free Languages. - Tomoyuki Yamakami (ICTCS, 2021)

Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum Finite-State Transducers (Preliminary Report). - Tomoyuki Yamakami (UCNC, 2021)

Parameterizations of Logarithmic-Space Reductions, Stack-State Complexity of Nonuniform Families of Pushdown Automata, and a Road to the LOGCFL⊆LOGDCFL/poly Question. - Tomoyuki Yamakami (CoRR, 2021)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata. - Tomoyuki Yamakami (CoRR, 2021)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). - Tomoyuki Yamakami (COCOON, 2022)

Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata. - Tomoyuki Yamakami (DLT, 2022)

Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis. - Tomoyuki Yamakami (FTC (1), 2022)

Formal Grammars for Turn-Bounded Deterministic Context-Free Languages. - Tomoyuki Yamakami (ICTAC, 2022)

Fine Grained Space Complexity and the Linear Space Hypothesis (Preliminary Report). - Tomoyuki Yamakami (ICS, 2022)

Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata. - Tomoyuki Yamakami (RP, 2022)

Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability. - Tomoyuki Yamakami (WoLLIC, 2022)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. - Tomoyuki Yamakami (CoRR, 2022)

How does adiabatic quantum computation fit into quantum automata theory? - Tomoyuki Yamakami (Inf. Comput., 2022)

Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. - Tomoyuki Yamakami (Inf. Comput., 2022)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. - Tomoyuki Yamakami (FCT, 2023)

When Input Integers are Given in the Unary Numeral Representation. - Tomoyuki Yamakami (ICTCS, 2023)

The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. - Tomoyuki Yamakami (J. Comput. Syst. Sci., 2023)

Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata. - Tomoyuki Yamakami (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

Synchronizing deterministic push-down automata can be really hard. - Henning Fernau; Petra Wolf 002; Tomoyuki Yamakami (Inf. Comput., 2023)

Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability. - Tomoyuki Yamakami (CiE, 2024)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems. - Tomoyuki Yamakami (SAI (4), 2024)

Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. - Tomoyuki Yamakami (TAMC, 2024)

Logical Expressibility of Syntactic NL for Complementarity and Maximization. - Tomoyuki Yamakami (WoLLIC, 2024)

Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization. - Tomoyuki Yamakami (CoRR, 2024)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits. - Tomoyuki Yamakami (CoRR, 2024)

Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions. - Tomoyuki Yamakami (Math. Struct. Comput. Sci., 2024)

Alternation-Bounded Semi-unbounded Fan-in Cascading Circuits and the Complementation Closure Property. - Tomoyuki Yamakami (CiE, 2025)

What is the Most Natural Generalized Pumping Lemma beyond Regular and Context-Free Languages? - Tomoyuki Yamakami (DCFS, 2025)