Daniel M. Gordon

Publication Activity (10 Years)

Years Active: 1982-2023
Publications (10 Years): 3

Top Topics

Projection Matrices

Top Venues

Des. Codes Cryptogr.

Cryptogr. Commun.

Publications

Daniel M. Gordon
Signed difference sets. Des. Codes Cryptogr. 91 (5) (2023)
K. T. Arasu, Daniel M. Gordon, Yiran Zhang
New nonexistence results on circulant weighing matrices. Cryptogr. Commun. 13 (5) (2021)
Daniel M. Gordon, Bernhard Schmidt
A survey of the multiplier conjecture. Des. Codes Cryptogr. 78 (1) (2016)
Warwick de Launey, Daniel M. Gordon
On the density of the set of known Hadamard orders. Cryptogr. Commun. 2 (2) (2010)
Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
Optimal hash functions for approximate matches on the n-cube. IEEE Trans. Inf. Theory 56 (3) (2010)
Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
Optimal hash functions for approximate closest pairs on the n-cube CoRR (2008)
Warwick de Launey, Daniel M. Gordon
A remark on Plotkin's bound. IEEE Trans. Inf. Theory 47 (1) (2001)
Warwick de Launey, Daniel M. Gordon
A Comment on the Hadamard Conjecture. J. Comb. Theory, Ser. A 95 (1) (2001)
David G. Cantor, Daniel M. Gordon
-Adic Fields. ANTS (2000)
Daniel M. Gordon
A Survey of Fast Exponentiation Methods. J. Algorithms 27 (1) (1998)
Daniel M. Gordon, Eugene R. Rodemich
Dense Admissible Sets. ANTS (1998)
Brienne E. Brown, Daniel M. Gordon
On sequences without geometric progressions. Math. Comput. 65 (216) (1996)
Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75 (2) (1996)
Daniel M. Gordon, Robert W. Robinson, Frank Harary
Minimum degree games for graphs. Discret. Math. 128 (1-3) (1994)
Daniel M. Gordon
The Prime Power Conjecture is True for n < 2, 000, 000. Electron. J. Comb. 1 (1994)
Daniel M. Gordon
Using the Number Field Sieve. SIAM J. Discret. Math. 6 (1) (1993)
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
Fast Exponentiation with Precomputation (Extended Abstract). EUROCRYPT (1992)
Daniel M. Gordon, Kevin S. McCurley
Massively Parallel Computation of Discrete Logarithms. CRYPTO (1992)
Daniel M. Gordon
Designing and Detecting Trapdoors for Discrete Log Cryptosystems. CRYPTO (1992)
Daniel M. Gordon
Parallel Sorting on Cayley Graphs. Algorithmica 6 (4) (1991)
Daniel M. Gordon
Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inf. Theory 28 (3) (1982)