Born in Tôkyô, Takunari Miyazaki spent his early years in Braunschweig and Nagoya. He received his B.S. in mathematics from the University of Kansas. He then received his Ph.D. in computer and information science from the University of Oregon, with a dissertation in computational group theory written under the direction of Professor Eugene M. Luks. He began his academic career at Bucknell University. He joined the Trinity faculty in 2001.

Miyazaki's research interests are algebraic algorithms, computational complexity and symbolic computation. He is particularly interested in the rich interplay amongst these three areas involving group-theoretic problems. At Trinity, he strives to challenge students to become better problem-solvers in his courses at all levels. In addition to introductory courses, he has taught advanced courses on algorithms, the theory of computation and foundations of programming languages. He has also recently developed and taught a first-year seminar on the life and work of Alan M. Turing.

• Luks, Eugene M., and Takunari Miyazaki. "Polynomial-Time Normalizers." Special issue in honor of Laci Babai's 60th birthday, Discrete Mathematics & Theoretical Computer Science 13, no. 4 (2011): 61–96.
• Miyazaki, Takunari. "On the Asymmetric Complexity of the Group-Intersection Problem." Information Processing Letters 107 (2008): 188–193.
• Luks, Eugene M., and Takunari Miyazaki. "Polynomial-Time Normalizers for Permutation Groups with Restricted Composition Factors." In Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, Villeneuve d'Ascq, July 7–10, 2002, edited by Teo Mora, 176-183. New York: Association for Computing Machinery, 2002.
• Miyazaki, Takunari. "Deterministic Algorithms for Management of Matrix Groups." In Groups and Computation III, Columbus, Ohio, June 15–19, 1999, edited by William M. Kantor and Ákos Seress, 265-280. Ohio State University Mathematical Research Institute Publications, vol. 8. Berlin: de Gruyter, 2001.
• Miyazaki, Takunari. "The Complexity of McKay's Canonical Labeling Algorithm." In Groups and Computation II, Piscataway, N.J., June 7–10, 1995, edited by Larry Finkelstein and William M. Kantor, 239-256. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 28. Providence, R.I.: American Mathematical Society, 1997.  

Selected Conference Presentations:

• Miyazaki, Takunari. "On Testing Isomorphism of Graphs of Bounded Eigenvalue Multiplicity." Mathematical Aspects of Computer and Information Sciences, 7th International Conference, Vienna, November 15–17, 2017.
• Miyazaki, Takunari. "On the Complexities of Intersection Problems in Permutation Groups." First International Conference on Mathematical Aspects of Computer and Information Sciences, Beijing, July 24–26, 2006.
• Miyazaki, Takunari. "Polynomial-Time Normalizers for Permutation Groups with Restricted Composition Factors." 2002 International Symposium on Symbolic and Algebraic Computation, Villeneuve d'Ascq, July 7–10, 2002.
• Miyazaki, Takunari. "Deterministic Polynomial-Time Algorithms for Certain Matrix-Group Problems." Groups and Computation, Columbus, Ohio, June 15–19, 1999.
• Miyazaki, Takunari. "Canonical Labeling of Graphs: Experiments with nauty." Groups and Computation, Piscataway, N.J., June 7–10, 1995.

• Faculty Associate. "Can Humanitarian Open-Source Software Development Help Revitalize Undergraduate Computing Education?" National Science Foundation Grant CCF-0722137, 2007-2009.
• Principal Investigator. "On the Relative Complexities of Group-Theoretic Problems." One-Year Research Expense Grant, Trinity College, 2007–2008.
• Principal Investigator. "Group-Theoretic Computation: Algorithms and Implementations." One-Year Research Expense Grant, Trinity College, 2004–2005.
• Principal Investigator. "Computational Complexity in Finite Groups." One-Year Research Expense Grant, Trinity College, 2002–2003.