Search the dblp DataBase
Daniel M. Gordon :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David G. Cantor , Daniel M. Gordon Factoring Polynominals over p -Adic Fields. [Citation Graph (0, 0)][DBLP ] ANTS, 2000, pp:185-208 [Conf ] Daniel M. Gordon , Eugene R. Rodemich Dense Admissible Sets. [Citation Graph (0, 0)][DBLP ] ANTS, 1998, pp:216-225 [Conf ] Daniel M. Gordon Designing and Detecting Trapdoors for Discrete Log Cryptosystems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1992, pp:66-75 [Conf ] Daniel M. Gordon , Kevin S. McCurley Massively Parallel Computation of Discrete Logarithms. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1992, pp:312-323 [Conf ] Ernest F. Brickell , Daniel M. Gordon , Kevin S. McCurley , David Bruce Wilson Fast Exponentiation with Precomputation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1992, pp:200-207 [Conf ] Daniel M. Gordon Parallel Sorting on Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:554-564 [Journal ] Daniel M. Gordon The Prime Power Conjecture is True for n < 2, 000, 000. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1994, v:1, n:, pp:- [Journal ] Daniel M. Gordon A Survey of Fast Exponentiation Methods. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:1, pp:129-146 [Journal ] Daniel M. Gordon , Oren Patashnik , Greg Kuperberg , Joel Spencer Asymptotically Optimal Covering Designs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:75, n:2, pp:270-280 [Journal ] Warwick de Launey , Daniel M. Gordon A Comment on the Hadamard Conjecture. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:180-184 [Journal ] Brienne E. Brown , Daniel M. Gordon On sequences without geometric progressions. [Citation Graph (0, 0)][DBLP ] Math. Comput., 1996, v:65, n:216, pp:1749-1754 [Journal ] Daniel M. Gordon Discrete Logarithms in GF(P) Using the Number Field Sieve. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1993, v:6, n:1, pp:124-138 [Journal ] Daniel M. Gordon Minimal permutation sets for decoding the binary Golay codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1982, v:28, n:3, pp:541-0 [Journal ] Warwick de Launey , Daniel M. Gordon A remark on Plotkin's bound. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:352-355 [Journal ] Daniel M. Gordon , Robert W. Robinson , Frank Harary Minimum degree games for graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:128, n:1-3, pp:151-163 [Journal ] Optimal hash functions for approximate closest pairs on the n-cube [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.002secs