Learning from Examples with Typed Equational Programming. - Akira Ishino; Akihiro Yamamoto (AII/ALT, 1994)

Generalization in Typed Equational Programming and Their Application to Learning Functions. - Akira Ishino; Akihiro Yamamoto (New Gener. Comput., 1997)

Modelling Semi-structured Documents with Hedges for Deduction and Induction. - Akihiro Yamamoto; Kimihito Ito; Akira Ishino; Hiroki Arimura (ILP, 2001)

Musical Sequence Comparison for Melodic and Rhythmic Similarities. - T. Kadota; Masahiro Hirao; Akira Ishino; Masayuki Takeda; Ayumi Shinohara; Fumihiro Matsuo (SPIRE, 2001)

A Method of Extracting Related Words Using Standardized Mutual Information. - Tomohiko Sugimachi; Akira Ishino; Masayuki Takeda; Fumihiro Matsuo (Discovery Science, 2003)

A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. - Hisashi Tsuji; Akira Ishino; Masayuki Takeda (SPIRE, 2005)

Ball tracking with velocity based on Monte-Carlo localization. - Jun Inoue 004; Akira Ishino; Ayumi Shinohara (IAS, 2006)

A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. - Hayato Kobayashi; Akira Ishino; Ayumi Shinohara (IAS, 2006)

Autonomous Learning of Ball Trapping in the Four-Legged Robot League. - Hayato Kobayashi; Tsugutoyo Osaki; Eric Williams 003; Akira Ishino; Ayumi Shinohara (RoboCup, 2006)

Reducing Trials by Thinning-Out in Skill Discovery. - Hayato Kobayashi; Kohei Hatano; Akira Ishino; Ayumi Shinohara (Discovery Science, 2007)

Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. - Hayato Kobayashi; Tsugutoyo Osaki; Tetsuro Okuyama; Akira Ishino; Ayumi Shinohara (RoboCup, 2008)

Computing Longest Common Substring and All Palindromes from Compressed Strings. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (SOFSEM, 2008)

Average Value of Sum of Exponents of Runs in Strings. - Kazuhiko Kusano; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2008)

New Lower Bounds for the Maximum Number of Runs in a String. - Wataru Matsubara; Kazuhiko Kusano; Akira Ishino; Hideo Bannai; Ayumi Shinohara (Stringology, 2008)

Bit-parallel Algorithms for Computing all the Runs in a String. - Kazunori Hirashima; Hideo Bannai; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2009)

Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots. - Hayato Kobayashi; Tsugutoyo Osaki; Tetsuro Okuyama; Joshua Gramm; Akira Ishino; Ayumi Shinohara (IEICE Trans. Inf. Syst., 2009)

Average Value of Sum of Exponents of Runs in a String. - Kazuhiko Kusano; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Int. J. Found. Comput. Sci., 2009)

Efficient algorithms to compute compressed longest common substrings and compressed palindromes. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (Theor. Comput. Sci., 2009)

Inferring Strings from Runs. - Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2010)