Researcher List Masaki Yamamoto Masaki Yamamoto (山本 真基) Please select the form format to download from below 「Education and research environment」format 「No. 4, the Ministry of Education document style ①Outline for Vitae」format 「No. 4, the Ministry of Education document style ②Education and research environment」format Profile Information AffiliationAssociate Professor, Faculty of Science and Technology Department of Science and Technology , Seikei UniversityDegree博士(理学)(東京工業大学)J-GLOBAL ID201401077382514859researchmap Member IDB000243008External linkhttp://www.ci.seikei.ac.jp/yamamoto/index_j.html Research Interests 3 design and anallysis of algorithms computational complexity theory of computation Research Areas 1 Informatics / Information theory / Research History 1 2012 Faculty of Science and Technology, Seikei University Papers 29 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 More Misc. 5 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 2 Exploring the Limits of Computation from the Statistical Physics Grants-in-Aid for Scientific Research, 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)), Ministry of Education, Culture, Sports, Science and Technology, 2011 - 2013 Yamamoto MASAKI
Masaki Yamamoto (山本 真基) Please select the form format to download from below 「Education and research environment」format 「No. 4, the Ministry of Education document style ①Outline for Vitae」format 「No. 4, the Ministry of Education document style ②Education and research environment」format Profile Information AffiliationAssociate Professor, Faculty of Science and Technology Department of Science and Technology , Seikei UniversityDegree博士(理学)(東京工業大学)J-GLOBAL ID201401077382514859researchmap Member IDB000243008External linkhttp://www.ci.seikei.ac.jp/yamamoto/index_j.html Research Interests 3 design and anallysis of algorithms computational complexity theory of computation Research Areas 1 Informatics / Information theory / Research History 1 2012 Faculty of Science and Technology, Seikei University Papers 29 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 More Misc. 5 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 2 Exploring the Limits of Computation from the Statistical Physics Grants-in-Aid for Scientific Research, 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)), Ministry of Education, Culture, Sports, Science and Technology, 2011 - 2013 Yamamoto MASAKI
【連絡事項】 成蹊大学専任教員各位 Ufinityにログイン後、「編集」ボタンを押した際に「権限が不正」というエラーメッセージが生じた際は、総合企画課までご連絡ください。 総合企画課:kikaku@jim.seikei.ac.jp