| 2005 |
|---|
| 11 | | Kohei Noshita:
Union-Connections and Straightforward Winning Strategies in Hex.
ICGA Journal 28(1): 3-12 (2005) |
| 2004 |
|---|
| 10 | EE | Keiji Yanai,
Masaya Shindo,
Kohei Noshita:
A fast image-gathering system from the World-Wide Web using a PC cluster.
Image Vision Comput. 22(1): 59-71 (2004) |
| 2001 |
|---|
| 9 | EE | Keiji Yanai,
Masaya Shindo,
Kohei Noshita:
A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster.
Web Intelligence 2001: 324-334 |
| 1987 |
|---|
| 8 | | Kohei Noshita,
Xiao-Xun He:
A Fast Algorithm for Translating Combinator Expressions with BC-chains.
New Generation Comput. 5(3): 249-257 (1987) |
| 1985 |
|---|
| 7 | | Kohei Noshita:
Translation of Turner Combinators in O(n log n) Space.
Inf. Process. Lett. 20(2): 71-74 (1985) |
| 6 | | Kohei Noshita:
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm.
J. Algorithms 6(3): 400-408 (1985) |
| 5 | | Kohei Noshita,
Teruo Hikita:
The BC-chain Method for Representing Combinators in Linear Space.
New Generation Comput. 3(2): 131-144 (1985) |
| 1984 |
|---|
| 4 | | Kohei Noshita,
Teruo Hikita:
The BC-Chain Method for Representing Combinators in Linear Space.
RIMS Symposia on Software Science and Engineering 1984: 292-306 |
| 1979 |
|---|
| 3 | | Hirosi Hitotumatu,
Kohei Noshita:
A Technique for Implementing Backtrack Algorithms and its Application.
Inf. Process. Lett. 8(4): 174-175 (1979) |
| 1978 |
|---|
| 2 | | Kohei Noshita,
Etsuo Masuda,
Hajime Machida:
On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs.
Inf. Process. Lett. 7(5): 237-243 (1978) |
| 1974 |
|---|
| 1 | | Kohei Noshita:
Median Selection of 9 Elements in 14 Comparisons.
Inf. Process. Lett. 3(1): 8-12 (1974) |
