25,161
edits
Changes
Created page with "'''Home * People * Hiroshi Imai''' FILE:HiroshiImai.jpg|border|right|thumb|link=https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml | Hiroshi Imai <ref>[..."
'''[[Main Page|Home]] * [[People]] * Hiroshi Imai'''
[[FILE:HiroshiImai.jpg|border|right|thumb|link=https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml
| Hiroshi Imai <ref>[https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml Graduate School of Information Science and Technology, The University of Tokyo - Professor Hiroshi Imai]</ref>
]]
'''Hiroshi Imai''',<br/>
a Japanese mathematician, computer scientist and professor at Graduate School of Information Science and Technology, [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo], and head of the ''Imai Laboratory''. His research interests include [https://en.wikipedia.org/wiki/Computational_geometry computational geometry], [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory], [https://en.wikipedia.org/wiki/Quantum_computer quantum computation], [https://en.wikipedia.org/wiki/Cryptography cryptography] and [[Search|tree search]].
Along with [[Ayumu Nagai]], he worked on [[Depth-First|depth-first]] [[Proof-Number Search|Proof-number search]] applied to [[Shogi]] and [[Othello]].
=Selected Publications=
<ref>[http://www-imai.is.s.u-tokyo.ac.jp/~imai/cv0210/node5.html Hiroshi Imai - Papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/i/Imai:Hiroshi dblp: Hiroshi Imai]</ref>
==1982 ...==
* [[Hiroshi Imai]] ('''1982'''). ''[https://www.sciencedirect.com/science/article/pii/0020019082900448 Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 15, No. 3
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1983'''). ''[https://www.sciencedirect.com/science/article/pii/0196677483900123 Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane]''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 4, No. 4
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1984'''). ''[https://ieeexplore.ieee.org/abstract/document/715940/ Dynamic Segment Intersection Search with Applications]''. [https://dblp.uni-trier.de/db/conf/focs/focs84.html FOCS 1984]
* [[Hiroshi Imai]] ('''1985'''). ''[https://www.sciencedirect.com/science/article/pii/0166218X85900605 On combinatorial structures of line drawings of polyhedra]''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 10, No. 1
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1986'''). ''[https://www.semanticscholar.org/paper/Efficient-Algorithms-for-Geometric-Graph-Search-Imai-Asano/854cb8c4e1c75ffef990d3fdacfe8ff0a24e5bc7 Efficient Algorithms for Geometric Graph Search Problems]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 2
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1987'''). ''[https://www.sciencedirect.com/science/article/pii/0196677487900241 Dynamic Orthogonal Segment Intersection Search]''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 8, No. 1
* [[Hiroshi Imai]] ('''1988'''). ''[https://link.springer.com/article/10.1007/BF01580721 On the convexity of the multiplicative version of Karmarkar's potential function]''. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Programming], Vol. 40, Nos. 1-3 <ref>[https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm Karmarkar's algorithm from Wikipedia], [[Mathematician#NKarmarkar|Narendra Karmarkar]]</ref>
==1990 ...==
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/i/Iwano:Kazuo Kazuo Iwano] ('''1990'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-52921-7_52 Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow]''. [https://dblp.uni-trier.de/db/conf/sigal/sigal1990.html SIGAL 1990]
* [[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''. [[Conferences#GPW|5th Game Programming Workshop]] ยป [[Othello]]
* [https://dblp.uni-trier.de/pers/hd/i/Ikeda:Takahiro Takahiro Ikeda], [[Hiroshi Imai]] ('''1999'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397598000930 Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 210, No. 2
==2000 ...==
* [https://dblp.uni-trier.de/pers/hd/y/Yamasaki:Tomohiro Tomohiro Yamasaki], [https://dblp.uni-trier.de/pers/hd/k/Kobayashi:Hirotada Hirotada Kobayashi], [[Hiroshi Imai]] ('''2001'''). ''Two-way Quantum One-counter Automata''. [https://arxiv.org/abs/cs/0110005 arXiv:cs/0110005]
* [[Mathematician#JGruska|Jozef Gruska]], [[Hiroshi Imai]] ('''2001'''). ''[https://link.springer.com/chapter/10.1007/3-540-45132-3_3 Power, Puzzles and Properties of Entanglement]''. [https://dblp.uni-trier.de/db/conf/mcu/mcu2001.html MCU 2001]
* [[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]
* [https://dblp.uni-trier.de/pers/hd/y/Yamasaki:Tomohiro Tomohiro Yamasaki], [https://dblp.uni-trier.de/pers/hd/k/Kobayashi:Hirotada Hirotada Kobayashi], [[Hiroshi Imai]] ('''2005'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397504005122 Quantum versus deterministic counter automata]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 334, No. 1-3
* [[Hiroshi Imai]], [https://scholar.google.com/citations?user=GGHbquQAAAAJ&hl=en Masahito Hayashi] (eds.) ('''2006'''). ''[https://link.springer.com/book/10.1007/3-540-33133-6 Quantum Computation and Information: From Theory to Experiment]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [https://dblp.uni-trier.de/pers/hd/k/Kato:Kimikazu Kimikazu Kato], [https://dblp.uni-trier.de/pers/hd/o/Oto:Mayumi Mayumi Oto], [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/i/Imai:Keiko Keiko Imai] ('''2008'''). ''[https://link.springer.com/chapter/10.1007%2F978-3-540-85126-4_4 Computational Geometry Analysis of Quantum State Space and Its Applications]''. [https://dblp.uni-trier.de/db/series/sci/sci158.html Generalized Voronoi Diagram 2008]
==2010 ...==
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2010'''). ''[https://www.semanticscholar.org/paper/Optimal-Average-Joint-Hamming-Weight-and-Minimal-of-Suppakitpaisarn-Edahiro/3534f856816ccbbd42598ccca4ce36dc1ad555fb Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers]''. [https://en.wikipedia.org/wiki/Cryptology_ePrint_Archive IACR Cryptology ePrint Archive], 2010
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2011'''). ''[https://www.semanticscholar.org/paper/Fast-Elliptic-Curve-Cryptography-Using-Optimal-Suppakitpaisarn-Edahiro/16d5f4fae5fb5ec96b9f3c753ffb0cc55cb5e43d Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains]''. [https://en.wikipedia.org/wiki/Cryptology_ePrint_Archive IACR Cryptology ePrint Archive], 2011
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Fast-Elliptic-Curve-Cryptography-Using-Minimal-of-d-Suppakitpaisarn-Edahiro/3033f5ddcdff648a5b5de5694b7c713745aa409f Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers]''. [https://dblp.uni-trier.de/db/conf/auisc/auisc2012.html AISC 2012]
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [[Hiroshi Imai]] ('''2014'''). ''[https://www.semanticscholar.org/paper/Worst-case-computation-time-for-minimal-joint-Suppakitpaisarn-Imai/edd29141908022c7cf332a0bcfdf4b12c3a3b6ee Worst case computation time for minimal joint Hamming weight numeral system].''. [https://dblp.uni-trier.de/db/conf/isita/isita2014.html ISITA 2014]
=External Links=
* [http://www-imai.is.s.u-tokyo.ac.jp/~imai/ Home Page of Hiroshi Imai]
* [http://www-imai.is.s.u-tokyo.ac.jp/members.html Imai Laboratory]
* [https://www.s.u-tokyo.ac.jp/en/people/imai_hiroshi/ IMAI Hiroshi - School of Science, the University of Tokyo]
* [https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml Graduate School of Information Science and Technology, The University of Tokyo - Professor Hiroshi Imai]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Imai]]
[[Category:Researcher|Imai]]
[[FILE:HiroshiImai.jpg|border|right|thumb|link=https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml
| Hiroshi Imai <ref>[https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml Graduate School of Information Science and Technology, The University of Tokyo - Professor Hiroshi Imai]</ref>
]]
'''Hiroshi Imai''',<br/>
a Japanese mathematician, computer scientist and professor at Graduate School of Information Science and Technology, [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo], and head of the ''Imai Laboratory''. His research interests include [https://en.wikipedia.org/wiki/Computational_geometry computational geometry], [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory], [https://en.wikipedia.org/wiki/Quantum_computer quantum computation], [https://en.wikipedia.org/wiki/Cryptography cryptography] and [[Search|tree search]].
Along with [[Ayumu Nagai]], he worked on [[Depth-First|depth-first]] [[Proof-Number Search|Proof-number search]] applied to [[Shogi]] and [[Othello]].
=Selected Publications=
<ref>[http://www-imai.is.s.u-tokyo.ac.jp/~imai/cv0210/node5.html Hiroshi Imai - Papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/i/Imai:Hiroshi dblp: Hiroshi Imai]</ref>
==1982 ...==
* [[Hiroshi Imai]] ('''1982'''). ''[https://www.sciencedirect.com/science/article/pii/0020019082900448 Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 15, No. 3
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1983'''). ''[https://www.sciencedirect.com/science/article/pii/0196677483900123 Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane]''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 4, No. 4
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1984'''). ''[https://ieeexplore.ieee.org/abstract/document/715940/ Dynamic Segment Intersection Search with Applications]''. [https://dblp.uni-trier.de/db/conf/focs/focs84.html FOCS 1984]
* [[Hiroshi Imai]] ('''1985'''). ''[https://www.sciencedirect.com/science/article/pii/0166218X85900605 On combinatorial structures of line drawings of polyhedra]''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 10, No. 1
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1986'''). ''[https://www.semanticscholar.org/paper/Efficient-Algorithms-for-Geometric-Graph-Search-Imai-Asano/854cb8c4e1c75ffef990d3fdacfe8ff0a24e5bc7 Efficient Algorithms for Geometric Graph Search Problems]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 15, No. 2
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/a/Asano:Takao Takao Asano] ('''1987'''). ''[https://www.sciencedirect.com/science/article/pii/0196677487900241 Dynamic Orthogonal Segment Intersection Search]''. [https://www.journals.elsevier.com/journal-of-algorithms Journal of Algorithms], Vol. 8, No. 1
* [[Hiroshi Imai]] ('''1988'''). ''[https://link.springer.com/article/10.1007/BF01580721 On the convexity of the multiplicative version of Karmarkar's potential function]''. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Programming], Vol. 40, Nos. 1-3 <ref>[https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm Karmarkar's algorithm from Wikipedia], [[Mathematician#NKarmarkar|Narendra Karmarkar]]</ref>
==1990 ...==
* [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/i/Iwano:Kazuo Kazuo Iwano] ('''1990'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-52921-7_52 Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow]''. [https://dblp.uni-trier.de/db/conf/sigal/sigal1990.html SIGAL 1990]
* [[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''. [[Conferences#GPW|5th Game Programming Workshop]] ยป [[Othello]]
* [https://dblp.uni-trier.de/pers/hd/i/Ikeda:Takahiro Takahiro Ikeda], [[Hiroshi Imai]] ('''1999'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397598000930 Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 210, No. 2
==2000 ...==
* [https://dblp.uni-trier.de/pers/hd/y/Yamasaki:Tomohiro Tomohiro Yamasaki], [https://dblp.uni-trier.de/pers/hd/k/Kobayashi:Hirotada Hirotada Kobayashi], [[Hiroshi Imai]] ('''2001'''). ''Two-way Quantum One-counter Automata''. [https://arxiv.org/abs/cs/0110005 arXiv:cs/0110005]
* [[Mathematician#JGruska|Jozef Gruska]], [[Hiroshi Imai]] ('''2001'''). ''[https://link.springer.com/chapter/10.1007/3-540-45132-3_3 Power, Puzzles and Properties of Entanglement]''. [https://dblp.uni-trier.de/db/conf/mcu/mcu2001.html MCU 2001]
* [[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]
* [https://dblp.uni-trier.de/pers/hd/y/Yamasaki:Tomohiro Tomohiro Yamasaki], [https://dblp.uni-trier.de/pers/hd/k/Kobayashi:Hirotada Hirotada Kobayashi], [[Hiroshi Imai]] ('''2005'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397504005122 Quantum versus deterministic counter automata]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 334, No. 1-3
* [[Hiroshi Imai]], [https://scholar.google.com/citations?user=GGHbquQAAAAJ&hl=en Masahito Hayashi] (eds.) ('''2006'''). ''[https://link.springer.com/book/10.1007/3-540-33133-6 Quantum Computation and Information: From Theory to Experiment]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [https://dblp.uni-trier.de/pers/hd/k/Kato:Kimikazu Kimikazu Kato], [https://dblp.uni-trier.de/pers/hd/o/Oto:Mayumi Mayumi Oto], [[Hiroshi Imai]], [https://dblp.uni-trier.de/pers/hd/i/Imai:Keiko Keiko Imai] ('''2008'''). ''[https://link.springer.com/chapter/10.1007%2F978-3-540-85126-4_4 Computational Geometry Analysis of Quantum State Space and Its Applications]''. [https://dblp.uni-trier.de/db/series/sci/sci158.html Generalized Voronoi Diagram 2008]
==2010 ...==
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2010'''). ''[https://www.semanticscholar.org/paper/Optimal-Average-Joint-Hamming-Weight-and-Minimal-of-Suppakitpaisarn-Edahiro/3534f856816ccbbd42598ccca4ce36dc1ad555fb Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers]''. [https://en.wikipedia.org/wiki/Cryptology_ePrint_Archive IACR Cryptology ePrint Archive], 2010
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2011'''). ''[https://www.semanticscholar.org/paper/Fast-Elliptic-Curve-Cryptography-Using-Optimal-Suppakitpaisarn-Edahiro/16d5f4fae5fb5ec96b9f3c753ffb0cc55cb5e43d Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains]''. [https://en.wikipedia.org/wiki/Cryptology_ePrint_Archive IACR Cryptology ePrint Archive], 2011
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [https://dblp.uni-trier.de/pers/hd/e/Edahiro:Masato Masato Edahiro], [[Hiroshi Imai]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Fast-Elliptic-Curve-Cryptography-Using-Minimal-of-d-Suppakitpaisarn-Edahiro/3033f5ddcdff648a5b5de5694b7c713745aa409f Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers]''. [https://dblp.uni-trier.de/db/conf/auisc/auisc2012.html AISC 2012]
* [https://scholar.google.com/citations?user=lo0TdfoAAAAJ&hl=en Vorapong Suppakitpaisarn], [[Hiroshi Imai]] ('''2014'''). ''[https://www.semanticscholar.org/paper/Worst-case-computation-time-for-minimal-joint-Suppakitpaisarn-Imai/edd29141908022c7cf332a0bcfdf4b12c3a3b6ee Worst case computation time for minimal joint Hamming weight numeral system].''. [https://dblp.uni-trier.de/db/conf/isita/isita2014.html ISITA 2014]
=External Links=
* [http://www-imai.is.s.u-tokyo.ac.jp/~imai/ Home Page of Hiroshi Imai]
* [http://www-imai.is.s.u-tokyo.ac.jp/members.html Imai Laboratory]
* [https://www.s.u-tokyo.ac.jp/en/people/imai_hiroshi/ IMAI Hiroshi - School of Science, the University of Tokyo]
* [https://www.i.u-tokyo.ac.jp/news/focus_e/imai.shtml Graduate School of Information Science and Technology, The University of Tokyo - Professor Hiroshi Imai]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Imai]]
[[Category:Researcher|Imai]]
