Hiroshi+Imai

a Japanese computer scientist and professor at Graduate School of Information Science and Technology, [|University of Tokyo], and head of the //Imai Laboratory//. His research interests include [|discrete mathematics], [|computational complexity theory], [|quantum computation], [|cryptography] and game tree search. Along with Ayumu Nagai, he worked on depth-first Proof-number search applied to Shogi and Othello. || toc =Selected Publications=
 * Home * People * Hiroshi Imai**
 * [[image:imai.jpg link="http://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml"]] ||~ || **Hiroshi Imai**,
 * Hiroshi Imai ||~ ||^ ||
 * Ayumu Nagai, Hiroshi Imai (**1999**). //Application of df-pn+ to Othello endgames//. 5th Game Programming Workshop » Othello
 * Ayumu Nagai, Hiroshi Imai (**1999**). //Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees//. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation
 * [|Sonoko Moriyama], Ayumu Nagai, Hiroshi Imai (**2002**). //Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments//. [|First International Congress of Mathematical Software]
 * Ayumu Nagai, Hiroshi Imai (**2002**). //[|Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]//. [|IEICE transactions on information and systems]

=External Links=
 * [|Home Page of Hiroshi Imai]
 * [|Graduate School of Information Science and Technology, The University of Tokyo - Professor Hiroshi Imai]

=References= =What links here?= include page="Hiroshi Imai" component="backlinks" limit="40"
 * Up one level**