- J.H. Dinitz, D.R. Stinson and L. Zhu, On the spectra of certain classes of Room frames.
- J.H. Dinitz and E.R. Lamken, HOPs and COPs: Frames with partitionable transversals
- J.H. Dinitz and E.R. Lamken, Room Square Patterns
- C.J. Colbourn, J.H. Dinitz, D.R. Stinson, Quorum Systems Constructed from Combinatorial Designs
- J.H. Dinitz and N. Shalaby, Block Disjoint Difference Families for Steiner Triple Systems: v= 3 mod 6
- C.J. Colbourn, J.H. Dinitz, D.R. Stinson, Applications of Combinatorial Designs to Communications, Cryptography, and Networking
- C.J. Colbourn, J.H. Dinitz, Mutually Orthogonal Latin Squares: A Brief Survey of Constructions
- I. Anderson, J. Dinitz, C. Rodger, and B. Webb, Combinatorics in Undergraduate Courses
- P. Dukes and J. Dinitz, New lower bounds on the Maximum number of mutually orthogonal Steiner triple systems
- J. Dinitz and M. Dinitz, Enumeration of balanced tournament designs on 10 points
- J.H. Dinitz and D.R. Stinson, On the maximum number of different ordered pairs of symbols in sets of latin squares
- J.H. Dinitz, Designing schedules for leagues and tournaments
- J. Dinitz and P. Dukes On the structure of uniform one-factorizations from starters in finite fields
- J.H. Dinitz, A.C.H. Ling D.R. Stinson, Fault tolerant routings with minimum optical index
- J.H. Dinitz, A.C.H. Ling D.R. Stinson, Perfect hash families from transversal designs

Back to Jeff Dinitz Home Page.