Professor

288 Bachelor Hall
Oxford, OH 45056
513-529-3520
millerz@MiamiOH.edu
Curriculum Vitae [PDF]

Education

• B.S. (Honors Mathematics) University of Michigan, 1972
• Ph.D. (Mathematics) University of Michigan, 1979

Research Interests

• graph theory
• graph embeddings
• combinatorics
• theoretical computer science

Academic Work History

• University of Michigan, Department of Mathematics, Teaching Fellow, 1972-1978.
• Miami University, Department of Mathematics
  • Assistant Professor, 1978 - 1982.
  • Associate Professor, 1982 - 1988.
  • Full Professor, 1988 - present.
• University of Texas - Dallas, Visiting Professor, Dept. of Computer Science, Fall 1985.
• University of California, Berkeley - Visiting Scholar, Dept. of Electrical Engineering and Computer Science, and participant at the Mathematical Sciences Research Institute (at Berkeley) year of concentration in complexity theory, Spring 1986.

Selected Publications

• S. Bereg, Z. Miller, L. Mojica, L. Morales, I.H. Sudborough, New Lower Bounds for Permutation Arrays Using Contraction, Designs, Codes and Cryptography 87 (2019)2105-2128.
• T. Jiang, Z. Miller, and D. Yager, On the Bandwidth of the Kneser graph, Discrete Applied Mathematics, 227 (2017) 84-94.
• Z. Miller, D. Pritikin, and I.H. Sudborough, Embedding multidimensional grids into optimal hypercubes , Theoretical Computer Science 552 (2014) 52-82.
• T. Jiang, Z. Miller, and D.Pritikin, Near optimal bounds for Steiner trees in the hypercube, SIAM Journal on Computing 40 (2011), no. 5, 1340-1360.
• T. Jiang, Z. Miller, and D. Pritikin, Separation numbers of trees, Theoretical Computer Science 410 (2009), 3769-3781.
• D.Craft, Z. Miller, and D. Pritikin, A Solitaire Game Played on 2-Colored Graphs, Figure Discrete Math. 309 (2009), no. 1, 188-201.