| 2008 |
|---|
| 16 | EE | Daniel M. Gordon,
Victor Miller,
Peter Ostapenko:
Optimal hash functions for approximate closest pairs on the n-cube
CoRR abs/0806.3284: (2008) |
| 2001 |
|---|
| 15 | | Warwick de Launey,
Daniel M. Gordon:
A remark on Plotkin's bound.
IEEE Transactions on Information Theory 47(1): 352-355 (2001) |
| 14 | EE | Warwick de Launey,
Daniel M. Gordon:
A Comment on the Hadamard Conjecture.
J. Comb. Theory, Ser. A 95(1): 180-184 (2001) |
| 2000 |
|---|
| 13 | | David G. Cantor,
Daniel M. Gordon:
Factoring Polynominals over p-Adic Fields.
ANTS 2000: 185-208 |
| 1998 |
|---|
| 12 | EE | Daniel M. Gordon,
Eugene R. Rodemich:
Dense Admissible Sets.
ANTS 1998: 216-225 |
| 11 | | Daniel M. Gordon:
A Survey of Fast Exponentiation Methods.
J. Algorithms 27(1): 129-146 (1998) |
| 1996 |
|---|
| 10 | EE | Daniel M. Gordon,
Oren Patashnik,
Greg Kuperberg,
Joel Spencer:
Asymptotically Optimal Covering Designs.
J. Comb. Theory, Ser. A 75(2): 270-280 (1996) |
| 9 | | Brienne E. Brown,
Daniel M. Gordon:
On sequences without geometric progressions.
Math. Comput. 65(216): 1749-1754 (1996) |
| 1994 |
|---|
| 8 | EE | Daniel M. Gordon,
Robert W. Robinson,
Frank Harary:
Minimum degree games for graphs.
Discrete Mathematics 128(1-3): 151-163 (1994) |
| 7 | EE | Daniel M. Gordon:
The Prime Power Conjecture is True for n < 2, 000, 000.
Electr. J. Comb. 1: (1994) |
| 1993 |
|---|
| 6 | | Daniel M. Gordon:
Discrete Logarithms in GF(P) Using the Number Field Sieve.
SIAM J. Discrete Math. 6(1): 124-138 (1993) |
| 1992 |
|---|
| 5 | EE | Daniel M. Gordon,
Kevin S. McCurley:
Massively Parallel Computation of Discrete Logarithms.
CRYPTO 1992: 312-323 |
| 4 | EE | Daniel M. Gordon:
Designing and Detecting Trapdoors for Discrete Log Cryptosystems.
CRYPTO 1992: 66-75 |
| 3 | EE | Ernest F. Brickell,
Daniel M. Gordon,
Kevin S. McCurley,
David Bruce Wilson:
Fast Exponentiation with Precomputation (Extended Abstract).
EUROCRYPT 1992: 200-207 |
| 1991 |
|---|
| 2 | | Daniel M. Gordon:
Parallel Sorting on Cayley Graphs.
Algorithmica 6(4): 554-564 (1991) |
| 1982 |
|---|
| 1 | | Daniel M. Gordon:
Minimal permutation sets for decoding the binary Golay codes.
IEEE Transactions on Information Theory 28(3): 541- (1982) |
