Tomoyuki Yamakami

178 papers A* 1A 2B 17C 17Misc 5Journal 104Unranked 31

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Alternation-Bounded Semi-unbounded Fan-in Cascading Circuits and the Complementation Closure Property. CiE Tomoyuki Yamakami
2025	J	`jnl`	Intersection and union hierarchies of deterministic context-free languages and pumping lemmas. Inf. Comput. Tomoyuki Yamakami
2025	—	`conf`	Machine Learning by Adiabatic Evolutionary Quantum Systems - (Preliminary Report). UCNC Tomoyuki Yamakami
2025	J	`jnl`	Power of counting by nonuniform families of polynomial-size finite automata. Inf. Comput. Tomoyuki Yamakami
2025	J	`jnl`	Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability. CoRR Tomoyuki Yamakami
2025	B	`conf`	Quantum First-Order Logics and Quantum Natural Deduction. FCT Tomoyuki Yamakami
2025	—	`conf`	What is the Most Natural Generalized Pumping Lemma beyond Regular and Context-Free Languages? DCFS Tomoyuki Yamakami
2024	—	`conf`	Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems. SAI (4) Tomoyuki Yamakami
2024	J	`jnl`	Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems. CoRR Tomoyuki Yamakami
2024	J	`jnl`	Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions. Math. Struct. Comput. Sci. Tomoyuki Yamakami
2024	C	`conf`	Logical Expressibility of Syntactic NL for Complementarity and Maximization. WoLLIC Tomoyuki Yamakami
2024	J	`jnl`	Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization. CoRR Tomoyuki Yamakami
2024	J	`jnl`	Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits. CoRR Tomoyuki Yamakami
2024	C	`conf`	Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability. CiE Tomoyuki Yamakami
2024	J	`jnl`	Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. CoRR Tomoyuki Yamakami
2024	C	`conf`	Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. TAMC Tomoyuki Yamakami
2023	J	`jnl`	Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth- Int. J. Comput. Math. Comput. Syst. Theory Tomoyuki Yamakami
2023	J	`jnl`	Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions. CoRR Tomoyuki Yamakami
2023	B	`conf`	Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. FCT Tomoyuki Yamakami
2023	J	`jnl`	Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. CoRR Tomoyuki Yamakami
2023	J	`jnl`	Synchronizing deterministic push-down automata can be really hard. Inf. Comput. Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2023	J	`jnl`	The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. J. Comput. Syst. Sci. Tomoyuki Yamakami
2023	J	`jnl`	Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata. CoRR Tomoyuki Yamakami
2023	—	`conf`	When Input Integers are Given in the Unary Numeral Representation. ICTCS Tomoyuki Yamakami
2023	J	`jnl`	When Input Integers are Given in the Unary Numeral Representation. CoRR Tomoyuki Yamakami
2022	J	`jnl`	Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. CoRR Tomoyuki Yamakami
2022	C	`conf`	Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability. WoLLIC Tomoyuki Yamakami
2022	A	`conf`	Fine Grained Space Complexity and the Linear Space Hypothesis (Preliminary Report). ICS Tomoyuki Yamakami
2022	C	`conf`	Formal Grammars for Turn-Bounded Deterministic Context-Free Languages. ICTAC Tomoyuki Yamakami
2022	J	`jnl`	How does adiabatic quantum computation fit into quantum automata theory? Inf. Comput. Tomoyuki Yamakami
2022	C	`conf`	Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata. DLT Tomoyuki Yamakami
2022	Misc	`conf`	Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). COCOON Tomoyuki Yamakami
2022	J	`jnl`	Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. Inf. Comput. Tomoyuki Yamakami
2022	—	`conf`	Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis. FTC (1) Tomoyuki Yamakami
2022	J	`jnl`	Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis. CoRR Tomoyuki Yamakami
2022	—	`conf`	Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata. RP Tomoyuki Yamakami
2021	J	`jnl`	Behavioral Strengths and Weaknesses of Various Models of Limited Automata. CoRR Tomoyuki Yamakami
2021	Misc	`conf`	Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. COCOON Tomoyuki Yamakami
2021	C	`conf`	Fuzzy Kolmogorov Complexity Based on Fuzzy Decompression Algorithms and Its Application to Fuzzy Data Mining - (Preliminary Report). ADMA Tomoyuki Yamakami
2021	J	`jnl`	Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. CoRR Tomoyuki Yamakami
2021	—	`conf`	Nondeterministically Selecting Positive Instances of Context-Free Languages. ICTCS Tomoyuki Yamakami
2021	J	`jnl`	Parameterizations of Logarithmic-Space Reductions, Stack-State Complexity of Nonuniform Families of Pushdown Automata, and a Road to the LOGCFL⊆LOGDCFL/poly Question. CoRR Tomoyuki Yamakami
2021	—	`conf`	Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum Finite-State Transducers (Preliminary Report). UCNC Tomoyuki Yamakami
2021	—	`conf`	Synchronizing Words for Real-Time Deterministic Pushdown Automata - Extended Abstract. ICMC Tomoyuki Yamakami, Eitatsu Mikami
2021	J	`jnl`	The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata. CoRR Tomoyuki Yamakami
2020	J	`jnl`	A Schematic Definition of quantum Polynomial Time Computability. J. Symb. Log. Tomoyuki Yamakami
2020	J	`jnl`	How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? CoRR Tomoyuki Yamakami
2020	C	`conf`	Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. LATA Tomoyuki Yamakami
2020	J	`jnl`	One-Way Topological Automata and the Tantalizing Effects of Their Topological Features. J. Autom. Lang. Comb. Tomoyuki Yamakami
2020	B	`conf`	Synchronizing Deterministic Push-Down Automata Can Be Really Hard. MFCS Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2020	J	`jnl`	Synchronizing Deterministic Push-Down Automata Can Be Really Hard. CoRR Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2019	B	`conf`	Behavioral Strengths and Weaknesses of Various Models of Limited Automata. SOFSEM Tomoyuki Yamakami
2019	—	`conf`	How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? DCFS Tomoyuki Yamakami
2019	C	`conf`	Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. LATA Tomoyuki Yamakami
2019	J	`jnl`	Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. CoRR Tomoyuki Yamakami
2019	J	`jnl`	One-Way Topological Automata and the Tantalizing Effects of Their Topological Features. CoRR Tomoyuki Yamakami
2019	—	`conf`	Relativizations of Nonuniform Quantum Finite Automata Families. UCNC Tomoyuki Yamakami
2019	J	`jnl`	State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. Theor. Comput. Sci. Tomoyuki Yamakami
2019	C	`conf`	Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P. TAMC Tomoyuki Yamakami
2019	J	`jnl`	Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P. CoRR Tomoyuki Yamakami
2018	J	`jnl`	A Schematic Definition of Quantum Polynomial Time Computability. CoRR Tomoyuki Yamakami
2018	—	`conf`	One-way topological automata and the tantalizing effects of their topological features. NCMA Tomoyuki Yamakami
2018	—	`conf`	State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis. DCFS Tomoyuki Yamakami
2018	J	`jnl`	State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis. CoRR Tomoyuki Yamakami
2017	—	`conf`	A recursive definition of quantum polynomial time computability (extended abstract). NCMA Tomoyuki Yamakami
2017	C	`conf`	One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report). DLT Tomoyuki Yamakami
2017	—	`conf`	Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report). RP Tomoyuki Yamakami
2017	B	`conf`	The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. MFCS Tomoyuki Yamakami
2017	J	`jnl`	The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. CoRR Tomoyuki Yamakami
2016	J	`jnl`	Complexity Bounds of Constant-Space Quantum Computation. CoRR Tomoyuki Yamakami
2016	J	`jnl`	Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions. CoRR Tomoyuki Yamakami
2016	J	`jnl`	Pseudorandom generators against advised context-free languages. Theor. Comput. Sci. Tomoyuki Yamakami
2016	J	`jnl`	Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords. Balt. J. Mod. Comput. Tomoyuki Yamakami
2016	J	`jnl`	Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems. CoRR Tomoyuki Yamakami
2015	C	`conf`	Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract). DLT Tomoyuki Yamakami
2015	J	`jnl`	Counting List Matrix Partitions of Graphs. SIAM J. Comput. Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2015	J	`jnl`	Interactive proofs with quantum finite automata. Theor. Comput. Sci. Harumichi Nishimura, Tomoyuki Yamakami
2015	—	`conf`	Quantum State Complexity of Formal Languages. DCFS Marcos Villagra, Tomoyuki Yamakami
2015	—	`conf`	Straight Construction of Non-Interactive Quantum Bit Commitment Schemes from Indistinguishable Quantum State Ensembles. TPNC Tomoyuki Yamakami
2015	J	`jnl`	Structural Complexity of Multi-Valued Partial Functions Computed by Nondeterministic Pushdown Automata. CoRR Tomoyuki Yamakami
2015	J	`jnl`	The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms. CoRR Tomoyuki Yamakami
2014	J	`jnl`	Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems. Theory Comput. Syst. Tomoyuki Yamakami
2014	J	`jnl`	Constant-space quantum interactive proofs against multiple provers. Inf. Process. Lett. Tomoyuki Yamakami
2014	A	`conf`	Counting List Matrix Partitions of Graphs. CCC Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2014	J	`jnl`	Interactive Proofs with Quantum Finite Automata. CoRR Harumichi Nishimura, Tomoyuki Yamakami
2014	—	`conf`	Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract). IFIP TCS Tomoyuki Yamakami
2014	J	`jnl`	One-way reversible and quantum finite automata with advice. Inf. Comput. Tomoyuki Yamakami
2014	B	`conf`	Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. SOFSEM Tomoyuki Yamakami
2014	—	`conf`	Quantum and Reversible Verification of Proofs Using Constant Memory Space. TPNC Marcos Villagra, Tomoyuki Yamakami
2014	—	`conf`	Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata. ICTCS Tomoyuki Yamakami
2014	—	`conf`	The world of combinatorial fuzzy problems and the efficiency of fuzzy approximation algorithms. SCIS&ISIS Tomoyuki Yamakami
2013	J	`jnl`	A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction. CoRR Tomoyuki Yamakami
2013	J	`jnl`	Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems CoRR Tomoyuki Yamakami
2013	J	`jnl`	Constant-Space Quantum Interactive Proofs Against Multiple Provers. CoRR Tomoyuki Yamakami
2013	J	`jnl`	Counting list matrix partitions of graphs. CoRR Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2013	J	`jnl`	Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages CoRR Tomoyuki Yamakami
2013	J	`jnl`	The dissecting power of regular languages. Inf. Process. Lett. Tomoyuki Yamakami, Yuichi Kato
2013	C	`conf`	Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems. COCOA Tomoyuki Yamakami
2012	J	`jnl`	A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs. Theor. Comput. Sci. Tomoyuki Yamakami
2012	J	`jnl`	Approximate counting for complex-weighted Boolean constraint satisfaction problems. Inf. Comput. Tomoyuki Yamakami
2012	J	`jnl`	Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. Theor. Comput. Sci. Tomoyuki Yamakami
2012	J	`jnl`	Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
2012	B	`conf`	Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. ISAAC Tomoyuki Yamakami
2012	J	`jnl`	One-Way Reversible and Quantum Finite Automata with Advice CoRR Tomoyuki Yamakami
2012	C	`conf`	One-Way Reversible and Quantum Finite Automata with Advice. LATA Tomoyuki Yamakami
2012	J	`jnl`	The Dissecting Power of Regular Languages CoRR Tomoyuki Yamakami, Yuichi Kato
2011	J	`jnl`	Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems CoRR Tomoyuki Yamakami
2011	Misc	`conf`	Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems. COCOON Tomoyuki Yamakami
2011	J	`jnl`	Immunity and pseudorandomness of context-free languages. Theor. Comput. Sci. Tomoyuki Yamakami
2011	J	`jnl`	Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems CoRR Tomoyuki Yamakami
2011	B	`conf`	Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. ISAAC Tomoyuki Yamakami
2010	J	`jnl`	A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs CoRR Tomoyuki Yamakami
2010	—	`conf`	A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs. COCOA (1) Tomoyuki Yamakami
2010	J	`jnl`	Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems CoRR Tomoyuki Yamakami
2010	B	`conf`	Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems. WAOA Tomoyuki Yamakami
2010	J	`jnl`	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. SIAM J. Comput. Akinori Kawachi, Tomoyuki Yamakami
2010	J	`jnl`	The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata CoRR Tomoyuki Yamakami
2010	J	`jnl`	The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata. Int. J. Found. Comput. Sci. Tomoyuki Yamakami
2010	J	`jnl`	Theory of one-tape linear-time Turing machines. Theor. Comput. Sci. Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
2009	J	`jnl`	An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. Harumichi Nishimura, Tomoyuki Yamakami
2009	J	`jnl`	Immunity and Pseudorandomness of Context-Free Languages CoRR Tomoyuki Yamakami
2009	J	`jnl`	Pseudorandom Generators against CFL/n CoRR Tomoyuki Yamakami
2009	J	`jnl`	Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Chic. J. Theor. Comput. Sci. Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
2009	B	`conf`	The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract). ISAAC Tomoyuki Yamakami
2008	J	`jnl`	Swapping Lemmas for Regular and Context-Free Languages with Advice CoRR Tomoyuki Yamakami
2007	—	`conf`	Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. CATS Tomoyuki Yamakami
2006	J	`jnl`	Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
2006	J	`jnl`	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding CoRR Akinori Kawachi, Tomoyuki Yamakami
2006	—	`conf`	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. ICALP (2) Akinori Kawachi, Tomoyuki Yamakami
2006	J	`jnl`	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. Electron. Colloquium Comput. Complex. Akinori Kawachi, Tomoyuki Yamakami
2006	J	`jnl`	Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords. CoRR Tomoyuki Yamakami
2005	B	`conf`	Collapsing Recursive Oracles for Relativized Polynomial Hierarchies. FCT Tomoyuki Yamakami
2005	A*	`conf`	Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
2005	J	`jnl`	Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks CoRR Harumichi Nishimura, Tomoyuki Yamakami
2005	J	`jnl`	Resource bounded immunity and simplicity. Theor. Comput. Sci. Tomoyuki Yamakami, Toshio Suzuki
2004	B	`conf`	An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). MFCS Harumichi Nishimura, Tomoyuki Yamakami
2004	J	`jnl`	An Application of Quantum Finite Automata to Interactive Proof Systems CoRR Harumichi Nishimura, Tomoyuki Yamakami
2004	J	`jnl`	An Application of Quantum Finite Automata to Interactive Proof Systems Electron. Colloquium Comput. Complex. Tomoyuki Yamakami, Harumichi Nishimura
2004	C	`conf`	An Application of Quantum Finite Automata to Interactive Proof Systems. CIAA Harumichi Nishimura, Tomoyuki Yamakami
2004	J	`jnl`	Polynomial time quantum computation with advice. Inf. Process. Lett. Harumichi Nishimura, Tomoyuki Yamakami
2004	J	`jnl`	Resource Bounded Immunity and Simplicity CoRR Tomoyuki Yamakami, Toshio Suzuki
2004	J	`jnl`	Resource Bounded Immunity and Simplicity Electron. Colloquium Comput. Complex. Tomoyuki Yamakami, Toshio Suzuki
2004	—	`conf`	Resource Bounded Immunity and Simplicity. IFIP TCS Toshio Suzuki, Tomoyuki Yamakami
2004	B	`conf`	Theory of One Tape Linear Time Turing Machines. SOFSEM Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
2003	J	`jnl`	An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation CoRR Harumichi Nishimura, Tomoyuki Yamakami
2003	J	`jnl`	Analysis Of Quantum Functions. Int. J. Found. Comput. Sci. Tomoyuki Yamakami
2003	J	`jnl`	Computational Complexity Measures of Multipartite Quantum Entanglement CoRR Tomoyuki Yamakami
2003	B	`conf`	Computational Complexity Measures of Multipartite Quantum Entanglement. ISAAC Tomoyuki Yamakami
2003	C	`conf`	Nearly Bounded Error Probabilistic Sets. CIAC Tomoyuki Yamakami
2003	J	`jnl`	Polynomial time quantum computation with advice CoRR Harumichi Nishimura, Tomoyuki Yamakami
2003	J	`jnl`	Polynomial time quantum computation with advice Electron. Colloquium Comput. Complex. Harumichi Nishimura, Tomoyuki Yamakami
2003	B	`conf`	Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? ISAAC Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
2003	J	`jnl`	Theory of One Tape Linear Time Turing Machines CoRR Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
2002	Misc	`conf`	Quantum DNF Learnability Revisited. COCOON Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami
2002	—	`conf`	Quantum NP and Quantum Hierarchy. IFIP TCS Tomoyuki Yamakami
2002	—	`conf`	Quantum Optimization Problems. UMC Tomoyuki Yamakami
2001	J	`jnl`	Quantum Certificate Verification: Single versus Multiple Quantum Certificates CoRR Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
2000	—	`conf`	Quantum Computation Relative to Oracles. UMC Christino Tamon, Tomoyuki Yamakami
1999	J	`jnl`	A Foundation of Programming a Multi-Tape Quantum Turing machine CoRR Tomoyuki Yamakami
1999	B	`conf`	A Foundation of Programming a Multi-tape Quantum Turing Machine. MFCS Tomoyuki Yamakami
1999	J	`jnl`	Analysis of Quantum Functions CoRR Tomoyuki Yamakami
1999	—	`conf`	Analysis of Quantum Functions (Preliminary Version). FSTTCS Tomoyuki Yamakami
1999	J	`jnl`	NQP Inf. Process. Lett. Tomoyuki Yamakami, Andrew Chi-Chih Yao
1999	J	`jnl`	Polynomial Time Samplable Distributions. J. Complex. Tomoyuki Yamakami
1998	J	`jnl`	NQP CoRR Tomoyuki Yamakami, Andrew Chi-Chih Yao
1998	J	`jnl`	NQP = co-C Electron. Colloquium Comput. Complex. Tomoyuki Yamakami, Andrew Chi-Chih Yao
1997	J	`jnl`	A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. Inf. Comput. Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami
1997	—	`—`	Average case computational complexity theory. Tomoyuki Yamakami
1996	J	`jnl`	Generic Separations. J. Comput. Syst. Sci. Lance Fortnow, Tomoyuki Yamakami
1996	J	`jnl`	Polynomial Games and Determinacy. Ann. Pure Appl. Log. Tomoyuki Yamakami
1996	B	`conf`	Polynomial Time Samplable Distributions. MFCS Tomoyuki Yamakami
1996	J	`jnl`	Structural Average Case Complexity. J. Comput. Syst. Sci. Rainer Schuler, Tomoyuki Yamakami
1995	J	`jnl`	Feasible Computability and Resource Bounded Topology Inf. Comput. Tomoyuki Yamakami
1995	J	`jnl`	Polynomial Time Samplable Distributions Electron. Colloquium Comput. Complex. Tomoyuki Yamakami
1995	Misc	`conf`	Sets Computable in Polynomial Time on Average. COCOON Rainer Schuler, Tomoyuki Yamakami
1994	—	`conf`	Generic Separations. SCT Lance Fortnow, Tomoyuki Yamakami
1992	—	`conf`	Structural Average Case Complexity. FSTTCS Rainer Schuler, Tomoyuki Yamakami
1992	J	`jnl`	Structural Properties for Feasibly Computable Classes of Type Two. Math. Syst. Theory Tomoyuki Yamakami