TAKUNARI MIYAZAKI

BIBLIOGRAPHY

  1. The complexity of McKay's canonical labeling algorithm, Groups and Computation. II (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)
  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.
  3. Deterministic algorithms for management of matrix groups, Groups and Computation. III (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)
  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, ACM, New York, 2002, pp. 176–183. MR2035247 (2005d:20006)
  5. On the complexities of intersection problems in permutation groups, Proceedings of the First International Conference on Mathematical Aspects of Computer and Information Sciences (D. Wang and Z. Zheng, eds.), School of Science, Beijing University of Aeronautics & Astronautics, Beijing, 2006, pp. 175–180.
  6. On the asymmetric complexity of the group-intersection problem, Inform. Process. Lett. 107 (2008), 188–193.
  7. (with E. M. Luks) Polynomial-time normalizers, submitted.
Valid HTML 4.01!