معرفی
Zevi Miller is a Professor in the Department of Mathematics at Miami University, located in Oxford, Ohio. He holds a B.S. (Honors Mathematics) from the University of Michigan (1972) and a Ph.D. in Mathematics from the same institution (1979). His research focuses on Graph Theory, Combinatorics, Complexity Theory, and Theoretical Computer Science, with particular emphasis on graph embeddings, permutation arrays, and algorithm design.
Professional History: Miller began as a Teaching Fellow at the University of Michigan (1972–1978), then joined Miami University as Assistant Professor (1978–1982), progressing to Associate Professor (1982–1988) and Full Professor (1988–present). He has held visiting roles, including Visiting Professor at the University of Texas–Dallas (1985) and Visiting Scholar at UC Berkeley (1986), where he participated in the Mathematical Sciences Research Institute’s complexity theory program.
Research interests include graph theory applications, combinatorial optimization, and theoretical computer science challenges such as Steiner trees and hypercube embeddings. His work often intersects algorithm design and discrete mathematics, with contributions to bandwidth optimization, graph layouts, and permutation arrays.
Publications span over four decades, including foundational papers on graph embeddings, Steiner trees, and algorithmic graph theory. His collaborative research with scholars like I.H. Sudborough and D. Pritikin highlights interdisciplinary approaches to complex computational problems.
