default search action
Daniel M. Gordon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Daniel M. Gordon
:
Signed difference sets. Des. Codes Cryptogr. 91(5): 2107-2115 (2023) - 2021
- [j15]K. T. Arasu, Daniel M. Gordon
New nonexistence results on circulant weighing matrices. Cryptogr. Commun. 13(5): 775-789 (2021)
2010 – 2019
- 2016
- [j14]Daniel M. Gordon, Bernhard Schmidt:
A survey of the multiplier conjecture. Des. Codes Cryptogr. 78(1): 221-236 (2016) - 2011
- [r2]Daniel M. Gordon:
Discrete Logarithm Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 352-353 - [r1]Daniel M. Gordon:
Generic Attacks Against DLP. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 510-512 - 2010
- [j13]Warwick de Launey, Daniel M. Gordon:
On the density of the set of known Hadamard orders. Cryptogr. Commun. 2(2): 233-246 (2010) - [j12]Daniel M. Gordon, Victor S. Miller, Peter Ostapenko:
Optimal hash functions for approximate matches on the n-cube. IEEE Trans. Inf. Theory 56(3): 984-991 (2010)
2000 – 2009
- 2008
- [i1]Daniel M. Gordon, Victor S. Miller, Peter Ostapenko:
Optimal hash functions for approximate closest pairs on the n-cube. CoRR abs/0806.3284 (2008) - 2006
- [j11]Daniel M. Gordon:
Perfect Single Error-Correcting Codes in the Johnson Scheme. IEEE Trans. Inf. Theory 52(10): 4670-4672 (2006) - 2001
- [j10]Warwick de Launey, Daniel M. Gordon:
A Comment on the Hadamard Conjecture. J. Comb. Theory A 95(1): 180-184 (2001) - [j9]Warwick de Launey, Daniel M. Gordon:
A remark on Plotkin's bound. IEEE Trans. Inf. Theory 47(1): 352-355 (2001) - 2000
- [c5]David G. Cantor, Daniel M. Gordon:
Factoring Polynominals over p-Adic Fields. ANTS 2000: 185-208
1990 – 1999
- 1998
- [j8]Daniel M. Gordon:
A Survey of Fast Exponentiation Methods. J. Algorithms 27(1): 129-146 (1998) - [c4]Daniel M. Gordon, Eugene R. Rodemich:
Dense Admissible Sets. ANTS 1998: 216-225 - 1996
- [j7]Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer:
Asymptotically Optimal Covering Designs. J. Comb. Theory A 75(2): 270-280 (1996) - [j6]Brienne E. Brown, Daniel M. Gordon:
On sequences without geometric progressions. Math. Comput. 65(216): 1749-1754 (1996) - 1994
- [j5]Daniel M. Gordon:
The Prime Power Conjecture is True for n < 2, 000, 000. Electron. J. Comb. 1 (1994) - [j4]Daniel M. Gordon, Robert W. Robinson, Frank Harary:
Minimum degree games for graphs. Discret. Math. 128(1-3): 151-163 (1994) - 1993
- [j3]Daniel M. Gordon:
Discrete Logarithms in GF(P) Using the Number Field Sieve. SIAM J. Discret. Math. 6(1): 124-138 (1993) - 1992
- [c3]Daniel M. Gordon:
Designing and Detecting Trapdoors for Discrete Log Cryptosystems. CRYPTO 1992: 66-75 - [c2]Daniel M. Gordon, Kevin S. McCurley
Massively Parallel Computation of Discrete Logarithms. CRYPTO 1992: 312-323 - [c1]Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley
Fast Exponentiation with Precomputation (Extended Abstract). EUROCRYPT 1992: 200-207 - 1991
- [j2]Daniel M. Gordon:
Parallel Sorting on Cayley Graphs. Algorithmica 6(4): 554-564 (1991)
1980 – 1989
- 1982
- [j1]Daniel M. Gordon:
Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inf. Theory 28(3): 541-543 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: