Leonard H. Soicher

Orcid: 0000-0001-5836-8914

According to our database1, Leonard H. Soicher authored at least 18 papers between 1982 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
There is no McLaughlin geometry.
J. Comb. Theory, Ser. A, 2018

On the Clique Number of a Strongly Regular Graph.
Electron. J. Comb., 2018

2017
The uniqueness of a distance-regular graph with intersection array {32, 27, 8, 1;1, 4, 27, 32} and related results.
Des. Codes Cryptogr., 2017

2011
On generalised t-designs and their parameters.
Discret. Math., 2011

2010
More on block intersection polynomials and new applications to graphs and block designs.
J. Comb. Theory, Ser. A, 2010

2007
Constructing t-designs from t-wise balanced designs.
Eur. J. Comb., 2007

On balanced incomplete-block designs with repeated blocks.
Eur. J. Comb., 2007

2006
Designs on the web.
Discret. Math., 2006

2000
An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes.
J. Symb. Comput., 2000

1999
On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares.
Electron. J. Comb., 1999

1998
Symbolic Collection using Deep Thought.
LMS J. Comput. Math., 1998

1995
The Primitive Distance-Transitive Representations of the Fischer Groups.
Exp. Math., 1995

Yet Another Distance-Regular Graph Related to a Golay Code.
Electron. J. Comb., 1995

1993
Three New Distance-regular Graphs.
Eur. J. Comb., 1993

1991
Computing with Group Homomorphisms.
J. Symb. Comput., 1991

GRAPE: A System for Computing with Graphs and Groups.
Proceedings of the Groups And Computation, 1991

1990
Collection from the Left and Other Strategies.
J. Symb. Comput., 1990

1982
Three New Combination Algorithms with the Minimal Change Property.
Commun. ACM, 1982


  Loading...