| 2008 |
|---|
| 103 | EE | Don Coppersmith,
Jean-Sébastien Coron,
François Grieu,
Shai Halevi,
Charanjit S. Jutla,
David Naccache,
Julien P. Stern:
Cryptanalysis of ISO/IEC 9796-1.
J. Cryptology 21(1): 27-51 (2008) |
| 102 | EE | Maria-Florina Balcan,
Nikhil Bansal,
Alina Beygelzimer,
Don Coppersmith,
John Langford,
Gregory B. Sorkin:
Robust reductions from ranking to classification.
Machine Learning 72(1-2): 139-153 (2008) |
| 101 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions.
Random Struct. Algorithms 32(1): 49-70 (2008) |
| 100 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM J. Comput. 38(3): 1157-1174 (2008) |
| 2007 |
|---|
| 99 | EE | Maria-Florina Balcan,
Nikhil Bansal,
Alina Beygelzimer,
Don Coppersmith,
John Langford,
Gregory B. Sorkin:
Robust Reductions from Ranking to Classification.
COLT 2007: 604-619 |
| 2006 |
|---|
| 98 | EE | Nikhil Bansal,
Don Coppersmith,
Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy.
APPROX-RANDOM 2006: 27-38 |
| 97 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling.
SODA 2006: 344-353 |
| 96 | EE | Don Coppersmith,
Lisa Fleischer,
Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments.
SODA 2006: 776-782 |
| 95 | EE | Don Coppersmith,
Nick Howgrave-Graham,
Phong Q. Nguyen,
Igor Shparlinski:
Testing set proportionality and the Ádám isomorphism of circulant graphs.
J. Discrete Algorithms 4(2): 324-335 (2006) |
| 94 | EE | Don Coppersmith,
Michael Elkin:
Sparse Sourcewise and Pairwise Distance Preservers.
SIAM J. Discrete Math. 20(2): 463-501 (2006) |
| 2005 |
|---|
| 93 | EE | Don Coppersmith,
Michael Elkin:
Sparse source-wise and pair-wise distance preservers.
SODA 2005: 660-669 |
| 92 | EE | Don Coppersmith,
Jon Lee:
Parsimonious binary-encoding in integer programming.
Discrete Optimization 2(3): 190-200 (2005) |
| 91 | EE | Don Coppersmith,
Atri Rudra:
On the Robust Testability of Product of Codes
Electronic Colloquium on Computational Complexity (ECCC)(104): (2005) |
| 90 | EE | Don Coppersmith,
Lisa Fleischer,
Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments
Electronic Colloquium on Computational Complexity (ECCC)(131): (2005) |
| 89 | EE | Don Coppersmith,
Moshe Lewenstein:
Constructive Bounds on Ordered Factorizations.
SIAM J. Discrete Math. 19(2): 301-303 (2005) |
| 88 | EE | Béla Bollobás,
Don Coppersmith,
Michael Elkin:
Sparse Distance Preservers and Additive Spanners.
SIAM J. Discrete Math. 19(4): 1029-1055 (2005) |
| 2004 |
|---|
| 87 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.
APPROX-RANDOM 2004: 273-285 |
| 86 | EE | Don Coppersmith,
Ravi Kumar:
An improved data stream algorithm for frequency moments.
SODA 2004: 151-156 |
| 85 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions
Electronic Colloquium on Computational Complexity (ECCC)(052): (2004) |
| 84 | EE | Don Coppersmith,
David Gamarnik,
Mohammad Taghi Hajiaghayi,
Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions.
Random Struct. Algorithms 24(4): 502-545 (2004) |
| 2003 |
|---|
| 83 | EE | Don Coppersmith,
David Gamarnik,
Mohammad Taghi Hajiaghayi,
Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions.
SODA 2003: 364-373 |
| 82 | EE | Béla Bollobás,
Don Coppersmith,
Michael Elkin:
Sparse distance preservers and additive spanners.
SODA 2003: 414-423 |
| 81 | EE | Don Coppersmith,
Madhu Sudan:
Reconstructing curves in three (and higher) dimensional space from noisy data.
STOC 2003: 136-142 |
| 2002 |
|---|
| 80 | EE | Don Coppersmith,
Shai Halevi,
Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking.
CRYPTO 2002: 515-532 |
| 79 | EE | Shai Halevi,
Don Coppersmith,
Charanjit S. Jutla:
Scream: A Software-Efficient Stream Cipher.
FSE 2002: 195-209 |
| 78 | EE | Don Coppersmith,
Markus Jakobsson:
Almost Optimal Hash Sequence Traversal.
Financial Cryptography 2002: 102-119 |
| 77 | EE | Don Coppersmith,
David Gamarnik,
Maxim Sviridenko:
The diameter of a long range percolation graph.
SODA 2002: 329-337 |
| 76 | EE | Don Coppersmith,
David Gamarnik,
Maxim Sviridenko:
The diameter of a long-range percolation graph.
Random Struct. Algorithms 21(1): 1-13 (2002) |
| 2001 |
|---|
| 75 | EE | Don Coppersmith:
Finding Small Solutions to Small Degree Polynomials.
CaLC 2001: 20-31 |
| 74 | EE | Don Coppersmith:
L Infinity Embeddings.
RANDOM-APPROX 2001: 223-228 |
| 73 | EE | Don Coppersmith:
Weakness in Quaternion Signatures.
J. Cryptology 14(2): 77-85 (2001) |
| 2000 |
|---|
| 72 | | Don Coppersmith,
Rosario Gennaro,
Shai Halevi,
Charanjit S. Jutla,
Stephen M. Matyas,
Mohammad Peyravian,
David Safford,
Nevenko Zunic:
IBM Comments.
AES Candidate Conference 2000: 333-336 |
| 71 | EE | Don Coppersmith,
Lars R. Knudsen,
Chris J. Mitchell:
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm.
CRYPTO 2000: 184-196 |
| 70 | | Richard Arratia,
Béla Bollobás,
Don Coppersmith,
Gregory B. Sorkin:
Euler circuits and DNA sequencing by hybridization.
Discrete Applied Mathematics 104(1-3): 63-96 (2000) |
| 69 | EE | Don Coppersmith:
Cryptography.
IBM Journal of Research and Development 44(1): 246-250 (2000) |
| 68 | EE | Don Coppersmith,
Igor Shparlinski:
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.
J. Cryptology 13(3): 339-360 (2000) |
| 1999 |
|---|
| 67 | EE | Don Coppersmith:
Weakness in Quaternion Signatures.
CRYPTO 1999: 305-314 |
| 66 | EE | Mohammad Peyravian,
Don Coppersmith:
A structured symmetric-key block cipher.
Computers & Security 18(2): 134-147 (1999) |
| 65 | | Don Coppersmith,
Se June Hong,
Jonathan R. M. Hosking:
Partitioning Nominal Attributes in Decision Trees.
Data Min. Knowl. Discov. 3(2): 197-217 (1999) |
| 64 | EE | Don Coppersmith,
Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations.
J. Complexity 15(1): 17-29 (1999) |
| 63 | | Don Coppersmith,
Gregory B. Sorkin:
Constructive bounds and exact expectations for the random assignment problem.
Random Struct. Algorithms 15(2): 113-144 (1999) |
| 62 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SIAM J. Comput. 29(3): 697-711 (1999) |
| 1998 |
|---|
| 61 | EE | Don Coppersmith:
Specialized Integer Factorization.
EUROCRYPT 1998: 542-545 |
| 60 | EE | Don Coppersmith,
David Wagner,
Bruce Schneier,
John Kelsey:
Cryptanalysis of TWOPRIME.
FSE 1998: 32-48 |
| 59 | EE | Don Coppersmith,
Gregory B. Sorkin:
Constructive Bounds and Exact Expectations for the Random Assignment Problem.
RANDOM 1998: 319-330 |
| 58 | EE | Don Coppersmith,
James B. Shearer:
New Bounds for Union-free Families of Sets.
Electr. J. Comb. 5: (1998) |
| 57 | EE | Phillip Rogaway,
Don Coppersmith:
A Software-Optimized Encryption Algorithm.
J. Cryptology 11(4): 273-287 (1998) |
| 1997 |
|---|
| 56 | EE | Don Coppersmith,
Adi Shamir:
Lattice Attacks on NTRU.
EUROCRYPT 1997: 52-61 |
| 55 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SODA 1997: 221-229 |
| 54 | EE | Don Coppersmith:
Rectangular Matrix Multiplication Revisited.
J. Complexity 13(1): 42-49 (1997) |
| 53 | | Don Coppersmith,
Jacques Stern,
Serge Vaudenay:
The Security of the Birational Permutation Signature Schemes.
J. Cryptology 10(3): 207-221 (1997) |
| 52 | EE | Don Coppersmith:
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities.
J. Cryptology 10(4): 233-260 (1997) |
| 1996 |
|---|
| 51 | EE | Don Coppersmith,
Matthew K. Franklin,
Jacques Patarin,
Michael K. Reiter:
Low-Exponent RSA with Related Messages.
EUROCRYPT 1996: 1-9 |
| 50 | EE | Don Coppersmith:
Finding a Small Root of a Univariate Modular Equation.
EUROCRYPT 1996: 155-165 |
| 49 | EE | Don Coppersmith:
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known.
EUROCRYPT 1996: 178-189 |
| 48 | EE | Robert J. Cimikowski,
Don Coppersmith:
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs.
Discrete Mathematics 149(1-3): 303-309 (1996) |
| 47 | | Don Coppersmith,
Donald Byron Johnson,
Stephen M. Matyas:
A proposed mode for triple-DES encryption.
IBM Journal of Research and Development 40(2): 253-262 (1996) |
| 46 | | Mihir Bellare,
Don Coppersmith,
Johan Håstad,
Marcos A. Kiwi,
Madhu Sudan:
Linearity testing in characteristic two.
IEEE Transactions on Information Theory 42(6): 1781-1795 (1996) |
| 45 | EE | Alok Aggarwal,
Amotz Bar-Noy,
Don Coppersmith,
Rajiv Ramaswami,
Baruch Schieber,
Madhu Sudan:
Efficient Routing in Optical Networks.
J. ACM 43(6): 973-1001 (1996) |
| 44 | EE | Don Coppersmith,
Steven Phillips:
On a Question of Erdös on Subsequence Sums.
SIAM J. Discrete Math. 9(2): 173-177 (1996) |
| 43 | EE | Don Coppersmith,
Uriel Feige,
James B. Shearer:
Random Walks on Regular and Irregular Graphs.
SIAM J. Discrete Math. 9(2): 301-308 (1996) |
| 1995 |
|---|
| 42 | | Don Coppersmith:
Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings
Springer 1995 |
| 41 | | Mihir Bellare,
Don Coppersmith,
Johan Håstad,
Marcos A. Kiwi,
Madhu Sudan:
Linearity Testing in Characteristic Two.
FOCS 1995: 432-441 |
| 1994 |
|---|
| 40 | EE | Don Coppersmith:
Attack on the Cryptographic Scheme NIKS-TAS.
CRYPTO 1994: 294-307 |
| 39 | | Don Coppersmith,
C. Andrew Neff:
Roots of a Polynomial and its Derivatives.
SODA 1994: 271-279 |
| 38 | | Alok Aggarwal,
Amotz Bar-Noy,
Don Coppersmith,
Rajiv Ramaswami,
Baruch Schieber,
Madhu Sudan:
Efficient Routing and Scheduling Algorithms for Optical Networks.
SODA 1994: 412-423 |
| 37 | EE | Avrim Blum,
Prasad Chalasani,
Don Coppersmith,
William R. Pulleyblank,
Prabhakar Raghavan,
Madhu Sudan:
The minimum latency problem.
STOC 1994: 163-171 |
| 36 | | Don Coppersmith:
The Data Encryption Standard (DES) and its strength against attacks.
IBM Journal of Research and Development 38(3): 243-250 (1994) |
| 1993 |
|---|
| 35 | EE | Don Coppersmith,
Hugo Krawczyk,
Yishay Mansour:
The Shrinking Generator.
CRYPTO 1993: 22-39 |
| 34 | EE | Don Coppersmith,
Jacques Stern,
Serge Vaudenay:
Attacks on the Birational Permutation Signature Schemes.
CRYPTO 1993: 435-443 |
| 33 | | Phillip Rogaway,
Don Coppersmith:
A Software-Optimised Encryption Algorithm.
FSE 1993: 56-63 |
| 32 | EE | Don Coppersmith,
Peter Doyle,
Prabhakar Raghavan,
Marc Snir:
Random Walks on Weighted Graphs and Applications to On-line Algorithms.
J. ACM 40(3): 421-453 (1993) |
| 31 | | Don Coppersmith:
Modifications to the Number Field Sieve.
J. Cryptology 6(3): 169-180 (1993) |
| 30 | | Don Coppersmith,
Prasad Tetali,
Peter Winkler:
Collisions Among Random Walks on a Graph.
SIAM J. Discrete Math. 6(3): 363-374 (1993) |
| 1992 |
|---|
| 29 | | Don Coppersmith,
Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)
FOCS 1992: 288-295 |
| 1990 |
|---|
| 28 | | Don Coppersmith,
Peter Doyle,
Prabhakar Raghavan,
Marc Snir:
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)
STOC 1990: 369-378 |
| 27 | | Don Coppersmith,
Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions.
J. Symb. Comput. 9(3): 251-280 (1990) |
| 1989 |
|---|
| 26 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average
Inf. Comput. 81(3): 318-333 (1989) |
| 25 | | Alok Aggarwal,
Don Coppersmith,
Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness.
Inf. Process. Lett. 30(4): 205-208 (1989) |
| 1988 |
|---|
| 24 | | Noga Alon,
E. E. Bergmann,
Don Coppersmith,
Andrew M. Odlyzko:
Balancing sets of vectors.
IEEE Transactions on Information Theory 34(1): 128- (1988) |
| 1987 |
|---|
| 23 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average
FOCS 1987: 260-269 |
| 22 | | Don Coppersmith,
Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions
STOC 1987: 1-6 |
| 21 | | Don Coppersmith:
Cryptography.
IBM Journal of Research and Development 31(2): 244-248 (1987) |
| 1986 |
|---|
| 20 | | Don Coppersmith,
Andrew M. Odlyzko,
Richard Schroeppel:
Discrete Logarithms in GF(p).
Algorithmica 1(1): 1-15 (1986) |
| 19 | | Don Coppersmith,
Maria M. Klawe,
Nicholas Pippenger:
Alphabetic Minimax Trees of Degree at Most t.
SIAM J. Comput. 15(1): 189-192 (1986) |
| 1985 |
|---|
| 18 | EE | Don Coppersmith:
Cheating at Mental Poker.
CRYPTO 1985: 104-107 |
| 17 | EE | Don Coppersmith:
Another Birthday Attack.
CRYPTO 1985: 14-17 |
| 16 | EE | Don Coppersmith:
The Real Reason for Rivest's Phenomenon.
CRYPTO 1985: 535-536 |
| 15 | | Don Coppersmith:
Each Four-Celled Animal Tiles the Plane.
J. Comb. Theory, Ser. A 40(2): 444-449 (1985) |
| 14 | | Don Coppersmith,
James H. Davenport:
An Application of Factoring.
J. Symb. Comput. 1(2): 241-243 (1985) |
| 1984 |
|---|
| 13 | | Don Coppersmith:
Evaluating Logarithms in GF(2^n)
STOC 1984: 201-207 |
| 12 | | Don Coppersmith,
Gadiel Seroussi:
On the minimum distance of some quadratic residue codes.
IEEE Transactions on Information Theory 30(2): 407- (1984) |
| 11 | | Don Coppersmith:
Fast evaluation of logarithms in fields of characteristic two.
IEEE Transactions on Information Theory 30(4): 587-593 (1984) |
| 1983 |
|---|
| 10 | | Zeev Barzilai,
Don Coppersmith,
Arnold L. Rosenberg:
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.
IEEE Trans. Computers 32(2): 190-194 (1983) |
| 9 | | Inder S. Gopal,
Don Coppersmith,
C. K. Wong:
Optimal Wiring of Movable Terminals.
IEEE Trans. Computers 32(9): 845-858 (1983) |
| 8 | | Roy L. Adler,
Don Coppersmith,
Martin Hassner:
Algorithms for sliding block codes - An application of symbolic dynamics to information theory.
IEEE Transactions on Information Theory 29(1): 5-22 (1983) |
| 1982 |
|---|
| 7 | | Don Coppersmith,
Douglas Stott Parker Jr.,
C. K. Wong:
Analysis of a General Mass Storage System.
SIAM J. Comput. 11(1): 94-116 (1982) |
| 6 | | Don Coppersmith:
Rapid Multiplication of Rectangular Matrices.
SIAM J. Comput. 11(3): 467-471 (1982) |
| 5 | | Don Coppersmith,
Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication.
SIAM J. Comput. 11(3): 472-492 (1982) |
| 1981 |
|---|
| 4 | | Don Coppersmith,
Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)
FOCS 1981: 82-90 |
| 1976 |
|---|
| 3 | | C. K. Wong,
Don Coppersmith:
The Generation of Permutations in Magnetic Bubble Memories.
IEEE Trans. Computers 25(3): 254-262 (1976) |
| 1975 |
|---|
| 2 | | Don Coppersmith:
The Complement of Certain Recursively Defined Sets.
J. Comb. Theory, Ser. A 18(3): 243-251 (1975) |
| 1974 |
|---|
| 1 | EE | C. K. Wong,
Don Coppersmith:
A Combinatorial Problem Related to Multimodule Memory Organizations.
J. ACM 21(3): 392-402 (1974) |
