25,161
edits
Changes
no edit summary
==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 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
