Kohei Noshita

14 papers Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2005 J jnl
Union-Connections and Straightforward Winning Strategies in Hex.
ICGA J.
Kohei Noshita
2004 J jnl
A fast image-gathering system from the World-Wide Web using a PC cluster.
Image Vis. Comput.
Keiji Yanai, Masaya Shindo, Kohei Noshita
2001 — conf
A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster.
Web Intelligence
Keiji Yanai, Masaya Shindo, Kohei Noshita
1996 J jnl
A Parallel Algorithm for Solving Hard Tsume-Shogi Problems.
ICCA J.
Yasuichi Nakayama, Tadafumi Akazawa, Kohei Noshita
1987 J jnl
A Fast Algorithm for Translating Combinator Expressions with BC-chains.
New Gener. Comput.
Kohei Noshita, Xiao-Xun He
1985 J jnl
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm.
J. Algorithms
Kohei Noshita
1985 J jnl
The BC-chain Method for Representing Combinators in Linear Space.
New Gener. Comput.
Kohei Noshita, Teruo Hikita
1985 J jnl
Translation of Turner Combinators in O(n log n) Space.
Inf. Process. Lett.
Kohei Noshita
1984 — conf
The BC-Chain Method for Representing Combinators in Linear Space.
RIMS Symposia on Software Science and Engineering
Kohei Noshita, Teruo Hikita
1982 J jnl
Predicting the Number of Distinct Elements in a Multiset.
SIAM J. Comput.
Kohei Noshita
1979 J jnl
A Technique for Implementing Backtrack Algorithms and its Application.
Inf. Process. Lett.
Hirosi Hitotumatu, Kohei Noshita
1978 J jnl
On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs.
Inf. Process. Lett.
Kohei Noshita, Etsuo Masuda, Hajime Machida
1974 J jnl
Median Selection of 9 Elements in 14 Comparisons.
Inf. Process. Lett.
Kohei Noshita
1971 J jnl
A Property of N-Graphs.
IEEE Trans. Computers
Akihiro Hashimoto, Kohei Noshita