"渡辺 治","計算複雑さの理論とその進展","東北大学数学教室談話会",,,,,,2013,Dec.
"渡辺 治","計算限界解明：なぜ限界を？＆なぜ今？","FIT13，鳥取大学",,,,,,2013,Sept.
"Osamu Watanabe","Message passing algorithms for MLS-3LIN problem",,"Algorithmica",,"Vol. 66","No. 4","pp. 848-868",2013,Aug.
"渡辺 治","計算限界への挑戦：Ｐ＝ＮＰの世界を目指して","e-サイエンスシンポジウム，京都大学",,,,,,2013,June
"Holger Dell,Valentine Kabanets,Dieter van Melkebeek,Osamu Watanabe","Is Valiant-Vazirani's isolation probability improvable?",,"computational complexity",,"Vol. 22","No. 2","pp. 345-383",2013,June
"Tatsuya Imai,Kotaro Nakagawa,Aduri Pavan,Variyam Vinochandran,Osamu Watanabe","An O(sqrt(n)+eps})-Space Algorithm for Directed Planar Reachability with Polynomial Running Time","アルゴリズム研，情報処理学会","情処研報 AL",,,,,2013,May
"河内 亮周,ロスマン ベンジャミン,渡辺 治","NP-解探索における質問計算量について(一般)",,"電子情報通信学会技術研究報告. COMP, コンピュテーション","一般社団法人電子情報通信学会","Vol. 113","No. 50",,2013,Apr.
"河内 亮周,ロスマン ベンジャミン,渡辺 治","NP-解探索における質問計算量について",,"研究報告アルゴリズム（AL）","一般社団法人情報処理学会","Vol. 2013","No. 7",,2013,Apr.
"O. Watanabe","Introduction of the ELC project","ELC Tokyo Complexity Workshop",,,,,,2013,Mar.
"遊佐 俊彦,渡辺 治","DS-1-5 正規化圧縮距離の妥当性解析(DS-1.COMP学生シンポジウム,シンポジウムセッション)",,"電子情報通信学会総合大会講演論文集","一般社団法人電子情報通信学会","Vol. 2013","No. 1",,2013,Feb.
"Tatsuya Imai,Kotaro Nakagawa,A. Pavan,N.V. Vinodchandran,Osamu Watanabe","An O(n^{{1/2}+epsilon}})-space and polynomial-time algorithm for directed planar reachability","Proc. of the 28th Conference on Computational Complexity (CCC'13)","Computational Complexity (CCC), 2013 IEEE Conference on","IEEE",,,"pp. 277-286",2013,
"渡辺 治","P≠NP予想って？",,"数学セミナー","日本評論社","Vol. 52","No. 12","pp. 8-12",2013,
"渡辺 治","P≠NP予想最前線",,"数学セミナー","日本評論社","Vol. 52","No. 12","pp. 8-43",2013,