Masaki Yamamoto

Profile Information

Affiliation: Associate Professor, Faculty of Science and Technology Department of Science and Technology , Seikei University

Degree: 博士（理学）(東京工業大学)

J-GLOBAL ID: 201401077382514859
researchmap Member ID: B000243008

External link: http://www.ci.seikei.ac.jp/yamamoto/index_j.html

Research Areas

Informatics / Information theory /

Research Interests

Research History

2012

Faculty of Science and Technology, Seikei University

Papers

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

Naoki Matsumoto, Masaki Yamamoto 0001, Masahito Yamazaki

Australas. J Comb., 81 208-232, 2021
Approximately counting paths and cycles in a graph.

Masaki Yamamoto 0001

Discret. Appl. Math., 217 381-387, 2017 Peer-reviewed
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.

Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe 0001, Masaki Yamamoto 0001

CoRR, abs/1406.0373, 2014 Peer-reviewed
A Combinatorial Analysis for the Critical Clause Tree.

Masaki Yamamoto 0001

Theory Comput. Syst., 52(2) 271-284, 2013 Peer-reviewed
Derandomizing the HSSW Algorithm for 3-SAT.

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

Algorithmica, 67(2) 112-124, 2013 Peer-reviewed
Probabilistic models of state estimation predict visuomotor transformations during prism adaptation

Masaki Yamamoto, Hiroshi Ando

Visual Neuroscience, 29(2) 119-129, Mar, 2012 Peer-reviewed
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.

Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito

SIAM J. Comput., 41(4) 1074-1093, 2012 Peer-reviewed
A tighter lower bound on the circuit size of the hardest Boolean functions.

Masaki Yamamoto 0001

Electronic Colloquium on Computational Complexity (ECCC), 18 86-86, 2011 Peer-reviewed
Derandomizing HSSW Algorithm for 3-SAT

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

CoRR, abs/1102.3766 1-12, 2011 Peer-reviewed
Derandomizing HSSW Algorithm for 3-SAT.

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

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.

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

Theor. Comput. Sci., 412(35) 4613-4618, 2011 Peer-reviewed
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise.

Masaki Yamamoto 0001, Shuji Kijima, Yasuko Matsui

J. Comb. Optim., 22(3) 392-408, 2011 Peer-reviewed
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto 0001

J. Comput. Biol., 18(10) 1275-1290, 2011 Peer-reviewed
Spectral Analysis of Random Sparse Matrices.

Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe 0001, Masaki Yamamoto 0001

IEICE Transactions, 94-A(6) 1247-1256, 2011 Peer-reviewed
A method for function dividing in conceptual design by focusing on linguistic hierarchal relations

Eiko Yamamoto, Toshiharu Taura, Shota Ohashi, Masaki Yamamoto

Journal of Computing and Information Science in Engineering, 10(3), 2010 Peer-reviewed
A combinatorial analysis for the critical clause tree.

Masaki Yamamoto 0001

Electronic Colloquium on Computational Complexity (ECCC), 17 95-95, 2010 Peer-reviewed
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

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.

Osamu Watanabe 0001, Masaki Yamamoto 0001

Theor. Comput. Sci., 411(16-18) 1685-1697, 2010 Peer-reviewed
On the Boolean connectivity problem for Horn relations.

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001

Discret. Appl. Math., 158(18) 2024-2030, 2010 Peer-reviewed
An improved constant-time approximation algorithm for maximum matchings.

Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito

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

Misc.

A Polynomial-time Perfect Sampler for the Q-Ising with local fields (Mathematical Foundation of Algorithms and Computer Science)

Yamamoto Masaki, Kijima Shuji, Matsui Yasuko

RIMS Kokyuroku, 1691 78-84, Jun, 2010
DS-1-1 Improved Constant-Time Approximation Algorithms for Maximum Independent Sets and Maximum Matchings

Yoshida Yuichi, Yamamoto Masaki, Ito Hiro

Proceedings of the IEICE General Conference, 2009(1) "S-21"-"S-22", Mar 4, 2009
A Planted Solution Model for the MAX-2SAT Problem(Mathematical Structure of Information Physics)

Watanabe Osamu, Yamamoto Masaki

RIMS Kokyuroku, 1532 19-31, Feb, 2007
Average-case Analysis for the MAX-2SAT Problem

WATANABE Osamu, YAMAMOTO Masaki

電子情報通信学会技術研究報告. COMP, コンピュテーション, 106(63) 25-32, May 17, 2006
A Message Passing Algorithm for MAX2SAT(New Trends in Theory of Computation and Algorithm)

Watanabe Osamu, Yamamoto Masaki

RIMS Kokyuroku, 1489 106-113, May, 2006

Research Projects

Exploring the Limits of Computation from the Statistical Physics

Grants-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area), Japan Society for the Promotion of Science, 2012 - 2016

Watanabe Osamu, KABASHIMA Yoshiyuki, HUKUSHIMA Koji, Krzakala Florent, Zdeborova Lenka, Zhou Haijun
Proposing new sapmling algorithms

Grants-in-Aid for Scientific Research(若手研究(B)), 若手研究(B), Ministry of Education, Culture, Sports, Science and Technology, 2011 - 2013

Yamamoto MASAKI

Profile Information

Research Areas

Research Interests

Research History

Papers

Misc.

Research Projects

Menu

Coauthors