 | 2007 |
|---|
| 10 |       | John P. McSorley,
Leonard H. Soicher:
Constructing t-designs from t-wise balanced designs.
Eur. J. Comb. 28(2): 567-571 (2007) |
| 9 | | Peter Dobcsányi,
Donald A. Preece,
Leonard H. Soicher:
On balanced incomplete-block designs with repeated blocks.
Eur. J. Comb. 28(7): 1955-1970 (2007) |
| 2006 |
|---|
| 8 | | R. A. Bailey,
Peter J. Cameron,
Peter Dobcsányi,
John P. Morgan,
Leonard H. Soicher:
Designs on the web.
Discrete Mathematics 306(23): 3014-3027 (2006) |
| 2000 |
|---|
| 7 |  | Sarah Rees,
Leonard H. Soicher:
An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes.
J. Symb. Comput. 29(1): 59-77 (2000) |
| 1999 |
|---|
| 6 | | Leonard H. Soicher:
On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares.
Electr. J. Comb. 6: (1999) |
| 1995 |
|---|
| 5 | | Leonard H. Soicher:
Yet Another Distance-Regular Graph Related to a Golay Code.
Electr. J. Comb. 2: (1995) |
| 1993 |
|---|
| 4 | | Leonard H. Soicher:
Three New Distance-regular Graphs.
Eur. J. Comb. 14(5): 501-505 (1993) |
| 1991 |
|---|
| 3 | | Charles R. Leedham-Green,
Cheryl E. Praeger,
Leonard H. Soicher:
Computing with Group Homomorphisms.
J. Symb. Comput. 12(4/5): 527-532 (1991) |
| 1990 |
|---|
| 2 | | Charles R. Leedham-Green,
Leonard H. Soicher:
Collection from the Left and Other Strategies.
J. Symb. Comput. 9(5/6): 665-675 (1990) |
| 1982 |
|---|
| 1 | | Clement W. H. Lam,
Leonard H. Soicher:
Three New Combination Algorithms with the Minimal Change Property.
Commun. ACM 25(8): 555-559 (1982) |
