Tomoyuki Yamakami
Orcid: 0009-0002-4842-4841
According to our database1,
Tomoyuki Yamakami
authored at least 103 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions.
Math. Struct. Comput. Sci., 2024
Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits.
CoRR, 2024
Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization.
CoRR, 2024
Proceedings of the Logic, Language, Information, and Computation, 2024
Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters.
Proceedings of the Theory and Applications of Models of Computation, 2024
Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems.
Proceedings of the Intelligent Computing, 2024
Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024
2023
Inf. Comput., December, 2023
Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-<i>k</i> storage automata.
Int. J. Comput. Math. Comput. Syst. Theory, January, 2023
J. Comput. Syst. Sci., 2023
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
2022
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice.
Inf. Comput., 2022
Inf. Comput., 2022
Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata.
CoRR, 2022
Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability.
Proceedings of the Logic, Language, Information, and Computation, 2022
Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata.
Proceedings of the Reachability Problems - 16th International Conference, 2022
Proceedings of the New Trends in Computer Technologies and Applications, 2022
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022
Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis.
Proceedings of the Future Technologies Conference, 2022
Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022
Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract).
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022
2021
Parameterizations of Logarithmic-Space Reductions, Stack-State Complexity of Nonuniform Families of Pushdown Automata, and a Road to the LOGCFL⊆LOGDCFL/poly Question.
CoRR, 2021
Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum Finite-State Transducers (Preliminary Report).
Proceedings of the Unconventional Computation and Natural Computation, 2021
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021
Synchronizing Words for Real-Time Deterministic Pushdown Automata - Extended Abstract.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021
Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
Fuzzy Kolmogorov Complexity Based on Fuzzy Decompression Algorithms and Its Application to Fuzzy Data Mining - (Preliminary Report).
Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021
2020
One-Way Topological Automata and the Tantalizing Effects of Their Topological Features.
J. Autom. Lang. Comb., 2020
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas.
Proceedings of the Language and Automata Theory and Applications, 2020
2019
State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis.
Theor. Comput. Sci., 2019
Proceedings of the Unconventional Computation and Natural Computation, 2019
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P.
Proceedings of the Theory and Applications of Models of Computation, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
2017
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report).
Proceedings of the Reachability Problems - 11th International Workshop, 2017
A recursive definition of quantum polynomial time computability (extended abstract).
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report).
Proceedings of the Developments in Language Theory - 21st International Conference, 2017
2016
Theor. Comput. Sci., 2016
CoRR, 2016
Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords.
Balt. J. Mod. Comput., 2016
2015
Straight Construction of Non-Interactive Quantum Bit Commitment Schemes from Indistinguishable Quantum State Ensembles.
Proceedings of the Theory and Practice of Natural Computing, 2015
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
Proceedings of the Descriptional Complexity of Formal Systems, 2015
2014
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems.
Theory Comput. Syst., 2014
Inf. Process. Lett., 2014
Proceedings of the Theory and Practice of Natural Computing, 2014
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
The world of combinatorial fuzzy problems and the efficiency of fuzzy approximation algorithms.
Proceedings of the 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS), 2014
Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract).
Proceedings of the Theoretical Computer Science, 2014
Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014
2013
A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction.
CoRR, 2013
Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems.
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems.
Theor. Comput. Sci., 2012
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs.
Theor. Comput. Sci., 2012
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
J. Cryptol., 2012
Inf. Comput., 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
2010
SIAM J. Comput., 2010
Int. J. Found. Comput. Sci., 2010
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs.
Proceedings of the Combinatorial Optimization and Applications, 2010
2009
J. Comput. Syst. Sci., 2009
Chic. J. Theor. Comput. Sci., 2009
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract).
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
2007
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007
2005
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
CoRR, 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
2004
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
2003
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
CoRR, 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2001
CoRR, 2001
2000
Quantum Computation Relative to Oracles.
Proceedings of the Unconventional Models of Computation, 2000
1999
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999
1998
1997
Inf. Comput., 1997
1996
1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1992
Math. Syst. Theory, 1992