( en | de | ru )

 

Disambiguation of "Gordon, Daniel M."

Author of the publication

copydeleteadd this publication to your clipboard
Optimal hash functions for approximate closest pairs on the n-cube

, , and . CoRR, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel M Böhi

Daniel M Blab

Daniel M Staub

Daniel M Frey

Daniel M Pircher

 

Other publications of authors with the same name

Optimal hash functions for approximate closest pairs on the n-cube, , and . CoRR, (2008)Parallel Sorting on Cayley Graphs.. Algorithmica, 6 (4): 554-564 (1991)Discrete Logarithm Problem.. Encyclopedia of Cryptography and Security (2nd Ed.), Springer, (2011)Factoring Polynominals over p-Adic Fields., and . ANTS, volume 1838 of Lecture Notes in Computer Science, page 185-208. Springer, (2000)Massively Parallel Computation of Discrete Logarithms., and . CRYPTO, volume 740 of Lecture Notes in Computer Science, page 312-323. Springer, (1992)Perfect Single Error-Correcting Codes in the Johnson Scheme.. IEEE Trans. Inf. Theory, 52 (10): 4670-4672 (2006)Generic Attacks Against DLP.. Encyclopedia of Cryptography and Security (2nd Ed.), Springer, (2011)Minimal permutation sets for decoding the binary Golay codes.. IEEE Trans. Inf. Theory, 28 (3): 541-543 (1982)Fast Exponentiation with Precomputation (Extended Abstract)., , , and . EUROCRYPT, volume 658 of Lecture Notes in Computer Science, page 200-207. Springer, (1992)The Prime Power Conjecture is True for n < 2, 000, 000.. Electron. J. Comb., (1994)