Next: Contributed papers at Conferences
Up: Curriculem Vita
Previous: Software Distribution
- 1
- Algebraic Methods in the Theory of Combinatorial Designs.
- Drexel University, 1984.
- Lehigh University, 1984.
- University of Vermont, 1984.
- University of Southern Maine, 1984.
- Rochester Institute of Technology, 1984.
- 2
- Codes, Designs and Groups.
- Rochester Institute of Technology 1985.
- 3
- Search Algorithm for Ramsey Graphs.
- University of Nebraska, 1986.
- State University of New York at Oswego, 1986.
- 4
- Combinatorial Search Algorithms: A Demonstration.
- University of Vermont, 1987.
- 5
- Constructing 6-(14,7,4) designs.
- University of Waterloo, Waterloo, Ontario, 1987.
- The 307th meeting of the American Mathematical Society,
University of Nebraska, Lincoln Nebraska, November 1987.
- 6
- Computing Combinatorial Configurations.
- 3rd Ontario Combinatorics Workshop,
University of Waterloo, Waterloo, Ontario, 1987
- McMaster University, Hamilton Ontario, 1988.
- University of Wyoming, Laramie, Wyoming, 1988.
- Syracuse University, Syracuse, New York, 1988.
- Michigan Technological University, Houghton Michigan, 1991.
- University of West Virginia, Morgantown, West Virginia, 1991.
- 7
- A Design Theory Toolchest
- Eighteenth Annual Conference on Numerical Mathematics and Computing,
University of Manitoba, Winnipeg, Manitoba, September 1988.
- Institute for Mathematics and its Applications Workshops on Coding
Theory and Applications and on Design Theory and Applications,
University of Minnesota,
Minneapolis, Minnesota,
June 12-25, 1988.
- 8
- Large Sets of Disjoint -Designs
- The 859th meeting of the American Mathematical Society,
Columbus, Ohio, August 1990.
- The 97th Annual meeting of the American Mathematical Society,
San Francisco, California, January 1991.
- 9
- On Turán's Problem on Hypergraphs.
- University of Colorado, Denver, Colorado, December 1990.
- Auburn University , Auburn, Alabama , March 1991.
- University of Vermont, February 1999.
- 10
- -designs with Large : A survey.
- The Seventh Midwestern Conference on Combinatorics, Cryptography and Computing, Carbondale, Illinois, October, 1992.
- 11
- Large sets of quadruple systems from PSL.
- Auburn University, Auburn, Alabama, March 1993.
- 12
- Large sets of -designs from PSL(2,q), with block sizes 4 and 5,
- University of Nebraska, Lincoln, Nebraska, October 1993.
- 13
- Constructing -designs with .
- Twenty sixth Southeastern International Conference on
Combinatorics, Graph Theory and Computing,
Boca Raton, Florida, March 1995.
- 14
- On Orthogonal Arrays of strength 3.
- The R.C. Bose memorial conference,
Ft. Collins, Colorado, June 1995.
- 15
- Hunting -Designs with .
- The Twenty-second Australasian Conference on Combinatorial Mathematics
and Combinatorial Computing,
- Sydney, Australia, July, 1996.
University of Auckland, Auckland, New Zealand, July 1996.
- 16
- From -Wise Balanced Designs to Orthogonal Arrays.
- Central Michigan University, Mt. Pleasant Michigan, January 1997.
- CRM Workshop on Transversal Designs and Orthogonal Arrays,
Kitchener-Waterloo, Ontario, CANADA, April 1997.
- University of Nevada-Las Vegas, Las Vegas, Nevada, February 2002.
- 17
- Covering arrays of strength 3.
- University of Nebraska, February 1998.
- University of Vermont, February 1998.
- Center for Nonlinear Research at Los Alamos, July 1998.
- 18
- Graphical Designs
- University of Vermont, February 1998.
- 19
- Computing Cliques
- University of Vermont, May 1998.
- University of Nebraska, May 1998.
- Rochester Institute of Technology, Sept 1999.
- 20
- Constructing Arrays
- Second Pythagorean Conference, An Advanced Research Workshop in Geometry,
Combinatorial Designs & Related Structures.
Pythagoreion, Samos, Greece, June 1999.
- 21
- Covering Arrays of Strength 3
- University of Rochester, Sept 1999.
- Rochester Institute of Technology, Sept 1999.
- 22
- A Hole-size bound for incomplete t-wise balanced designs
- The XXVth Ohio State-Denison Mathematics Conference, May 2000.
- Optimal Discrete Structures and Algorithms - ODSA, Rostock (Germany),
September 2000.
- The Second Lethbridge Workshop on Designs, Codes, Cryptography and Graph Theory, June 2001.
- 23
- Magic Squares and Othorgonal Arrays
- University of Nevada-Las Vegas, Las Vegas, Nevada, February 2002.
- 24
- Computing Transverse t-Designs
- First Prairie Discrete Mathematics Workshop
Regina, Saskatchewan, October 2003.
- Eighteen Midwestern Conference on Combinatorics, Cryptogrphy and
Computing, Las Vegas, Nevada, October 2004.
- 25
- Isofactorization of circulant graphs
- Fourth Prairie Discrete Mathematics Workshop
Lethbridge, Alberta, August 2006.
- 26
- The hypergraph degree sequence problem
- Thirty nineth Southeastern International Conference on Combinatorics, Graph Theory and Computing,
Boca Raton, Florida, March 2008.
Next: Contributed papers at Conferences
Up: Curriculem Vita
Previous: Software Distribution
kreher
2010-04-05