松原 渉 (Wataru Matsubara)

OBOG

博士課程後期 2011年度

Publications / 研究業績

英語 journal (3件)

最新順

  1. Detecting regularities on grammar-compressed strings
    Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
    Inf. Comput., Vol.240, pp.74-89 (2015) , [peer-reviewed]
  2. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    Chic. J. Theor. Comput. Sci., Vol.2010 (2010) , [peer-reviewed]
  3. Average Value of Sum of Exponents of Runs in a String
    Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Int. J. Found. Comput. Sci., Vol.20, pp.1135-1146 (2009) , [peer-reviewed]

英語 conference, workshop 論文 (9件)

最新順

  1. Inferring Strings from Runs
    Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010, pp.150-160 (2010) , [peer-reviewed]
    Event Date: September 1-1, 2010
  2. The Number of Runs in a Ternary Word
    Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson
    Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010, pp.178-181 (2010) , [peer-reviewed]
    Event Date: September 1-1, 2010
  3. Bit-parallel Algorithms for Computing all the Runs in a String
    Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009, pp.203-213 (2009) , [peer-reviewed]
    Event Date: September 2-2, 2009
  4. A Series of Run-Rich Strings
    Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
    Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp.578-587 (2009) , [peer-reviewed]
    Event Date: April 2-8, 2009
  5. Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    CATS, CRPIT, Vol.94, pp.19-28 (2009) , [peer-reviewed]
残り 4 件を表示
  1. New Lower Bounds for the Maximum Number of Runs in a String
    Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008, pp.140-145 (2008) , [peer-reviewed]
    Event Date: September 1-3, 2008
  2. Average Value of Sum of Exponents of Runs in Strings
    Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008, pp.185-192 (2008) , [peer-reviewed]
    Event Date: September 1-3, 2008
  3. Computing Longest Common Substring and All Palindromes from Compressed Strings
    Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
    SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp.364-375 (2008) , [peer-reviewed]
    Event Date: January 19-25, 2008
  4. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    Structure-Based Compression of Complex Massive Data, Dagstuhl Seminar Proceedings, Vol.08261 (2008) , [peer-reviewed]

和文 conference, workshop 論文 (6件)

最新順

  1. 移調を許した圧縮文字列照合アルゴリズム
    松原 渉, 篠原 歩
    電子情報通信学会 コンピュテーション研究会,COMP, (2010)
    開催日: 2010年4月22-22日 @ 立命館大学
  2. 繰り返し構造からの文字列推測の困難さ
    松原 渉, 篠原 歩
    http://www.nishizeki.ecei.tohoku.ac.jp/LA.7, (2009)
    開催日: 2009年7月22-20日
  3. 平衡直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム
    松原 渉, 稲永 俊介, 篠原 歩
    電子通信情報学会 コンピュテーション研究会, COMP, (2009)
    開催日: 2009年3月2-2日
  4. 連を多く含む文字列発見のための探索的手法,
    松原 渉, 草野 一彦, 坂内 英夫, 石野 明, 篠原 歩
    http://www.lab2.kuis.kyoto-u.ac.jp/LA2008/winter-program.html, pp. 13.1-13.10, (2009)
    開催日: 2009年2月1-1日
  5. 文字列の繰り返し構造の平均解析,
    草野 一彦, 松原 渉, 石野 明, 篠原 歩
    http://www.lab2.kuis.kyoto-u.ac.jp/LA.11, (2009)
    開催日: 2009年2月1-1日
残り 1 件を表示
  1. 圧縮文字列における最長共通部分文字列および回文を求める多項式時間アルゴリズム
    松原 渉, 稲永 俊介, 石野 明, 篠原 歩, 中村 智将, 橋本 和夫
    コンピュテーション研究会,電子情報通信学会技術研究報告, Vol 107, No. 537, (COP, (2008)
    開催日: 2008年3月1-1日