Master's students

1

P. A. Eggleston, M.S. (CS), ``Detection and Coding of Edges in Natural Scenes: Building a Fact Base for an Expert System'', 1986.

2

R. E. Hill, M.S. (CS), ``ACL: A Combinatorics Language'', 1986.

3

R. T. Salamone, M.S. (CS), ``An Implementation of the Chor-Rivest Knapsack Type Public Key Cryptosystem'', 1986.

4

R. Nenno, M.S. (CS), ``Nonlinear Error-correcting Codes'', 1987.

5

Wei Li, M.S. (CS), ``Algorithms for Constructing Multicolor Ramsey Graphs'', 1987.

6

A. Stankus, M.S. (CS), ``Implementing Ray Tracing with Techniques from Image Processing'', 1987.

7

J. E. Robinson, M.S. (CS), ``A Noiseless Data Compression Method Suitable for In-line Communication Channel Use'', 1988.

8

S. Metha, M.S. (CS), ``A Window-Oriented User-Interface for Image Processing on Unix Based Workstations'', 1988.

9

T. C. Frenz, M.S. (CS), ``Computing Techniques for the Enumeration of Cyclic Steiner Systems'', 1989.

10

N. M. Schornstein, M.S. (CS), ``Computing the Chromatic Number of t-(v,k,) Designs'', 1989.

11

W. J. Monroe, M.S. (CS), ``Computer Construction of (4,4,c)-Threshold Schemes using Steiner Quadruple Systems'', 1989.

12

C. A. Cusack, M.S. (Maths), ``PSL(2,) as an automorphism group of -designs with blocksize 4'', 1994.

13

L. M. Koehn, M.S. (Maths), ``The Bigraphical -Wise Balanced Designs of Index Two'', 1994.

14

Jun Meng, M.S. (Maths), ``Some new orthogonal arrays of strength 2'', 1995.

15

Hrsito S. Sendov, M.S. (Maths), ``A Graph Decomposition Theorem'', 1996.

16

Melissa S. Keranen, M.S. (Maths), ``An Infinite Class of Fibres In CURDs'' 2002.

17

Kimberly Lauinger, M.S. (Maths), ``Computing Transverse -designs'' 2003.

18

Lisa Thim, M.S. (Maths) ''A Unified Parallel C Implementation for the Maximum Clique Problem", 2005

19

Erik E. Westlund, M.S. (Maths), ``-Isofactorations of Circulant Graphs'', 2006

20

Artem Zurhalev, M.S. (Maths) ''Group Divisible Steiner Quadruple Systems'', 2007.