A Property of N-Graphs. - Akihiro Hashimoto; Kohei Noshita (IEEE Trans. Computers, 1971)

Median Selection of 9 Elements in 14 Comparisons. - Kohei Noshita (Inf. Process. Lett., 1974)

On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs. - Kohei Noshita; Etsuo Masuda; Hajime Machida (Inf. Process. Lett., 1978)

A Technique for Implementing Backtrack Algorithms and its Application. - Hirosi Hitotumatu; Kohei Noshita (Inf. Process. Lett., 1979)

Predicting the Number of Distinct Elements in a Multiset. - Kohei Noshita (SIAM J. Comput., 1982)

Translation of Turner Combinators in O(n log n) Space. - Kohei Noshita (Inf. Process. Lett., 1985)

A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. - Kohei Noshita (J. Algorithms, 1985)

The BC-chain Method for Representing Combinators in Linear Space. - Kohei Noshita; Teruo Hikita (New Gener. Comput., 1985)

A Fast Algorithm for Translating Combinator Expressions with BC-chains. - Kohei Noshita; Xiao-Xun He (New Gener. Comput., 1987)

A Parallel Algorithm for Solving Hard Tsume-Shogi Problems. - Yasuichi Nakayama; Tadafumi Akazawa; Kohei Noshita (J. Int. Comput. Games Assoc., 1996)

A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster. - Keiji Yanai; Masaya Shindo; Kohei Noshita (Web Intelligence, 2001)

A fast image-gathering system from the World-Wide Web using a PC cluster. - Keiji Yanai; Masaya Shindo; Kohei Noshita (Image Vis. Comput., 2004)

Union-Connections and Straightforward Winning Strategies in Hex. - Kohei Noshita (J. Int. Comput. Games Assoc., 2005)