TAKUNARI MIYAZAKI

BIBLIOGRAPHY


PUBLICATIONS
  1. The complexity of McKay's canonical labeling algorithm, Groups and Computation. II, Piscataway, N.J., June 7–10, 1995 (L. Finkelstein and W. M. Kantor, eds.), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 28, Amer. Math. Soc., Providence, R.I., 1997, pp. 239–256. MR1444139 (98c:05119)  Zbl 0878.05063
  2. Polynomial-time computation in matrix groups, Ph.D. Dissertation, Tech. Rep. CIS-TR-99-11, Department of Computer and Information Science, University of Oregon, Eugene, 1999. MR2700147
  3. Deterministic algorithms for management of matrix groups, Groups and Computation. III, Columbus, Ohio, June 15–19, 1999 (W. M. Kantor and Á. Seress, eds.), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 265–280. MR1829486 (2002i:20022)  Zbl 1038.20006
  4. (with E. M. Luks) Polynomial-time normalizers for permutation groups with restricted composition factors, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, Villeneuve d'Ascq, July 7–10, 2002 (T. Mora, ed.), ACM, New York, 2002, pp. 176–183. MR2035247 (2005d:20006)  Zbl 1072.68683
  5. On the complexities of intersection problems in permutation groups, Proceedings of the First International Conference on Mathematical Aspects of Computer and Information Sciences, Běijīng, July 24–26, 2006 (D. Wang and Z. Zheng, eds.), Běijīng University of Aeronautics & Astronautics, Běijīng, 2006, pp. 175–180.
  6. On the asymmetric complexity of the group-intersection problem, Inform. Process. Lett. 107 (2008), 188–193. MR2436911 (2009k:68095)  Zbl 1186.68222
  7. (with N. Dragu, F. Elkhoury, R. A. Morelli and N. di Tada) Ontology-based text mining for predicting disease outbreaks, Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference, Daytona Beach Shores, Fla., May 19–21, 2010 (H. W. Guesgen and R. C. Murray, eds.), AAAI, Menlo Park, Calif., 2010, pp. 142–143.
  8. (with E. M. Luks) Polynomial-time normalizers, Special issue in honor of L. Babai's 60th birthday, Discrete Math. Theor. Comput. Sci. 13(4) (2011), 61–96. MR2862561 (2012j:20010)  Zbl 1286.68519
  9. グラフ同型性判定について——群論的手法の軌跡と成果——， LAシンポジウム会誌 66 (2016), 26–32.
  10. On testing isomorphism of graphs of bounded eigenvalue multiplicity, Mathematical Aspects of Computer and Information Sciences, 7th International Conference, Wien, Nov. 15–17, 2017, Proceedings (J. Blömer, I. S. Kotsireas, T. Kutsia and D. E. Simos, eds.), Lecture Notes in Comput. Sci., vol. 10693, Springer, Heidelberg, 2017, pp. 325–329. Zbl 07036065
  11. On the complexity of testing isomorphism of graphs of bounded eigenvalue multiplicity, Symmetry vs. Regularity, Plzeň, July 1–7, 2018 (A. A. Ivanov, M. Klin, A. Munemasa and R. Nedela, eds.), Jednota českých matematiků a fyziků a Západočeská univerzita v Plzni, Plzeň, 2018, p. 51.

COMMENTS
  1. Luks's reduction of graph isomorphism to code equivalence, Comment to W. E. Clark, 1996.

WORK IN PROGRESS
  1. (with J. B. Wilson) Linear-size reductions and completeness in algebra, preprint.
  2. (with P. A. Brooksbank and J. B. Wilson) On the futility of computational models of problems in NP, in preparation.
  3. (with P. Zeman) On the problem of computing canonical forms of graphs: limitations of individualization-refinement methods, in preparation.

Valid HTML 4.01!