Parallei graph algorithms that are efficient on average
- Don Coppersmith
- Prabhakar Raghavan
- et al.
- 1989
- Information and Computation
Publications
Date
Featured collections
Popular topics
80 results for Don Coppersmith
Balancing Sets of Vectors
- N. Alon
- E.E. Bergmann
- et al.
- 1988
- IEEE Trans. Inf. Theory
Discrete logarithms in GF(p)
- Don Coppersmith
- Andrew M. Odlzyko
- et al.
- 1986
- Algorithmica
ALPHABETIC MINIMAX TREES OF DEGREE AT MOST t.
- D. Coppersmith
- M.M. Klawe
- et al.
- 1986
- SIAM Journal on Computing
An application of factoring
- D. Coppersmith
- J.H. Davenport
- 1985
- Journal of Symbolic Computation
Solving NP-hard problems in 'almost trees': Vertex cover
- Don Coppersmith
- Uzi Vishkin
- 1985
- Discrete Applied Mathematics
Each four-celled animal tiles the plane
- Don Coppersmith
- 1985
- Journal of Combinatorial Theory, Series A
Evaluating logarithms in GF(2n)
- Don Coppersmith
- 1984
- STOC 1984
On the Minimum Distance of Some Quadratic Residue Codes
- Don Coppersmith
- Gadiel Seroussi
- 1984
- IEEE Trans. Inf. Theory
Fast Evaluation of Logarithms in Fields of Characteristic Two
- Don Coppersmith
- 1984
- IEEE Trans. Inf. Theory