Masaki Yamamoto

The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring.

Australas. J Comb., 81 208-232, 2021  

Approximately counting paths and cycles in a graph.

Discret. Appl. Math., 217 381-387, 2017  Peer-reviewed

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.

CoRR, abs/1406.0373, 2014  Peer-reviewed

A Combinatorial Analysis for the Critical Clause Tree.

Theory Comput. Syst., 52(2) 271-284, 2013  Peer-reviewed

Derandomizing the HSSW Algorithm for 3-SAT.

Algorithmica, 67(2) 112-124, 2013  Peer-reviewed

Probabilistic models of state estimation predict visuomotor transformations during prism adaptation

Visual Neuroscience, 29(2) 119-129, Mar, 2012  Peer-reviewed

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.

SIAM J. Comput., 41(4) 1074-1093, 2012  Peer-reviewed

A tighter lower bound on the circuit size of the hardest Boolean functions.

Electronic Colloquium on Computational Complexity (ECCC), 18 86-86, 2011  Peer-reviewed

Derandomizing HSSW Algorithm for 3-SAT

CoRR, abs/1102.3766 1-12, 2011  Peer-reviewed

Derandomizing HSSW Algorithm for 3-SAT.

Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, abs/1102.3766 1-12, 2011  Peer-reviewed

An exact algorithm for the Boolean connectivity problem for k-CNF.

Theor. Comput. Sci., 412(35) 4613-4618, 2011  Peer-reviewed

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise.

J. Comb. Optim., 22(3) 392-408, 2011  Peer-reviewed

Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.

J. Comput. Biol., 18(10) 1275-1290, 2011  Peer-reviewed

Spectral Analysis of Random Sparse Matrices.

IEICE Transactions, 94-A(6) 1247-1256, 2011  Peer-reviewed

A method for function dividing in conceptual design by focusing on linguistic hierarchal relations

Journal of Computing and Information Science in Engineering, 10(3), 2010  Peer-reviewed

A combinatorial analysis for the critical clause tree.

Electronic Colloquium on Computational Complexity (ECCC), 17 95-95, 2010  Peer-reviewed

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.

Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, 172-180, 2010  Peer-reviewed

Average-case analysis for the MAX-2SAT problem.

Theor. Comput. Sci., 411(16-18) 1685-1697, 2010  Peer-reviewed

On the Boolean connectivity problem for Horn relations.

Discret. Appl. Math., 158(18) 2024-2030, 2010  Peer-reviewed

An improved constant-time approximation algorithm for maximum matchings.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, 225-234, 2009  Peer-reviewed

A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise.

Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, 328-337, 2009  Peer-reviewed

A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.

Electron. Colloquium Comput. Complex., 14(029), 2007  

On the Boolean connectivity problem for horn relations

THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2007, PROCEEDINGS, 4501 187-+, 2007  Peer-reviewed

A Spectral Method for MAX2SAT in the Planted Solution Model.

Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, 112-123, 2007  Peer-reviewed

An improved exact algorithm for the domatic number problem.

Inf. Process. Lett., 101(3) 101-106, 2007  Peer-reviewed

Generating instances for MAX2SAT with optimal solutions

Theory of Computing Systems, 39(5) 723-742, Sep, 2006  Peer-reviewed

An improved exact algorithm for the domatic number problem

Proceedings - 2006 International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA 2006, 2 2792-2797, 2006  Peer-reviewed

Average-case analysis for the MAX-2SAT problem

THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 4121 277-282, 2006  Peer-reviewed

An improved Õ(1.234 m)-time deterministic algorithm for SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 644-653, 2005  Peer-reviewed