論文

• Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe. Propagation connectivity of random hypergraphs, The Electronic Journal of Combinatorics, Vol. 19, pp. 1-25, 2012.
• Mikael Onsjö, OSAMU WATANABE. Finding most likely solutions, Theory of Computing Systems, Springer, Vol. 45, No. 4, pp. 926-942, Nov. 2009.

国際会議発表 (査読有り)

• Robert Berke, Mikael Onsjoe. Propagation connectivity of random hypergraphs, 5th International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA'10), Lecture Notes in Computer Science, Vol. 5792, pp. 117-126, Sept. 2009.
• Osamu Watanabe, Mikael Onsjoe. Finding most likely solutions, Proc. Computation and Logic in the Real World (CiE 2007), Lecture Notes in Computer Science, Springer, Vol. 4497, pp. 758-767, June 2007.

国際会議発表 (査読なし・不明)

• Mikael Onsjoe. Belief propagation and heavy connectivity in random graphs, 2nd Asian Association for Algorithms and Computation Annual Meeting (AAAC'09), Apr. 2009.
• Mikael Onsjoe. A graph partitioning algorithm on the planted partition model, StatPhys23 Satelite meeting: Statistical Mechanics of Distributed Information Systems, July 2007.

国内会議発表 (査読なし・不明)

• Mikael Onsjö, OSAMU WATANABE. Implementation of a bit-parallel approximate string matching algorithm, 情報処理学会アルゴリズム研究会, Information Processing Society of Japan, Vol. AL-124, No. 3, Mar. 2009.

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]