Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Gordon, Dan - IDA Center For Communications Research, La Jolla
The Prime Power Conjecture is True for n < 2,000,000
Equidistant Arithmetic Codes and Character Sums
Fields Institute Communications Volume 00, 0000
1 Coverings Daniel M. Gordon and Douglas R. Stinson
Asymptotically Optimal Covering Designs Daniel M. Gordon
Optimal hash functions for approximate closest pairs on the n-cube
Perfect single error-correcting codes in the Johnson scheme
A Remark on Plotkin's Bound Warwick de Launey and Daniel M. Gordon
Massively Parallel Computation of Discrete Logarithms
A Comment on the Hadamard Conjecture Warwick de Launey
Minimum Degree Games for Graphs Daniel M. Gordon
Percolation in High Dimensions Daniel M. Gordon
MATHEMATICS OF COMPUTATION VOLUME 00, NUMBER 00
Some Restrictions on Orders of Abelian Planar Difference Sets
A survey of fast exponentiation methods Daniel M. Gordon
Computing the Mordell-Weil rank of Jacobians of curves of genus two.
New Constructions for Covering Designs Daniel M. Gordon
Factoring polynomials over p-adic fields David G. Cantor and Daniel M. Gordon
Minimum (12, 6, 3) Covers Daniel M. Gordon Oren Patashnik John Petro
Fast Exponentiation with Precomputation: Algorithms and Lower Bounds
The distribution of Lucas and elliptic pseudoprimes Daniel M. Gordon
Discrete Logarithms in GF(p) using the Number Field Sieve
Dense Admissible Sets Daniel M. Gordon and Gene Rodemich
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
