Latest revision as of 19:32, 16 November 2019

Home * People * Ayumu Nagai

Ayumu Nagai,
a Japanese computer scientist and professor at the department of computer science at Gunmma University. His research interests include artificial intelligence and software verification. He holds a M.Sc. and Ph.D. from University of Tokyo on depth-first and-or tree search algorithms, in particular depth-first Proof-number search, and was member of Hiroshi Imai's research laboratory ^[1]. In the 90s, along with Yasushi Tanase, Akihiro Kishimoto and Norifumi Gotou, Ayumu Nagai was co-author of the Shogi program ISshogi ^[2] ^[3], multiple winner and top finisher of CSA tournaments ^[4] and Computer Olympiads.

Selected Publications

Ayumu Nagai (1998). A new AND/OR Tree Search Algorithm Using Proof Number and Disproof Number. Complex Games Lab Workshop, Tsukuba
Ayumu Nagai (1999). A New Depth-First-Search Algorithm for AND/OR Trees. M.Sc. thesis, University of Tokyo
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
Ayumu Nagai, Hiroshi Imai (1999). Application of df-pn+ to Othello endgames. 5th Game Programming Workshop » Othello

@@ Line 17: / Line 17: @@
 ==2000 ...==
 * [[Ayumu Nagai]] ('''2002'''). ''Df-pn Algorithm for Searching AND/OR Trees and Its Applications''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo]
-* [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [IEICE transactions on information and systems IEICE transactions on information and systems]
+* [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [https://www.ieice.org/eng/index.html IEICE transactions on information and systems]
 * [https://dblp.uni-trier.de/pers/hd/m/Moriyama:Sonoko Sonoko Moriyama], [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://www.worldscientific.com/doi/abs/10.1142/9789812777171_0009 Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments]''. [http://www.mmrc.iss.ac.cn/icms/toc.html ICMS 2002]
 * [[Ayumu Nagai]] ('''2007'''). ''[https://dl.acm.org/citation.cfm?id=1290393 Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters]''. [https://en.wikipedia.org/wiki/Pattern_Recognition_Letters Pattern Recognition Letters], Vol. 28, No. 15