Paul J. Schellenberg

According to our database, Paul J. Schellenberg authored at least 10 papers between 1977 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2003

Construction of Symmetric Balanced Squares with Blocksize More than One.

Palash Sarkar, Paul J. Schellenberg

Des. Codes Cryptogr., 2003

2002

A Parallelizable Design Principle for Cryptographic Hash Functions.

Palash Sarkar, Paul J. Schellenberg

IACR Cryptol. ePrint Arch., 2002

2001

A Parallel Algorithm for Extending Cryptographic Hash Functions.

Palash Sarkar, Paul J. Schellenberg

Proceedings of the Progress in Cryptology, 2001

2000

Symmetric Graph Designs.

Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg

Graphs Comb., 2000

1991

The existence of C_k-factorizations of K_2n-F.

Dean G. Hoffman, Paul J. Schellenberg

Discret. Math., 1991

1989

The Oberwolfach problem and factors of uniform odd length cycles.

Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David G. Wagner

J. Comb. Theory A, 1989

1984

The Existence of Howell Designs of Even Side.

B. A. Anderson, Paul J. Schellenberg, Douglas R. Stinson

J. Comb. Theory A, 1984

1981

On the existence of frames.

Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis

Discret. Math., 1981

The existence of Howell designs of side n+1 and order 2n.

Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates

Comb., 1981

1977

A Construction for Equidistant Permutation Arrays of Index One.

Scott A. Vanstone, Paul J. Schellenberg

J. Comb. Theory A, 1977