Don Coppersmith

Publication Activity (10 Years)

Years Active: 1974-2023
Publications (10 Years): 1

Top Venues

Math. Comput.

Publications

Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman, Jeffrey M. Vanderkam
Ideal solutions in the Prouhet-Tarry-Escott problem. Math. Comput. 93 (349) (2023)
Don Coppersmith, Victor S. Miller
Binary Nontiles. SIAM J. Discret. Math. 26 (1) (2012)
Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu
The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Trans. Algorithms 7 (3) (2011)
Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60 (2) (2011)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6 (3) (2010)
Don Coppersmith, Victor S. Miller
Binary Non-tiles CoRR (2009)
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin
Robust reductions from ranking to classification. Mach. Learn. 72 (1-2) (2008)
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) (2008)
Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj
Divisors in residue classes, constructively. Math. Comput. 77 (261) (2008)
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. Cryptol. 21 (1) (2008)
Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38 (3) (2008)
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin
Robust Reductions from Ranking to Classification. COLT (2007)
Don Coppersmith, Michael Elkin
Sparse Sourcewise and Pairwise Distance Preservers. SIAM J. Discret. Math. 20 (2) (2006)
Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4 (2) (2006)
Nikhil Bansal, Don Coppersmith, Baruch Schieber
Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM (2006)
Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
Improved approximation algorithms for broadcast scheduling. SODA (2006)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA (2006)
Béla Bollobás, Don Coppersmith, Michael Elkin
Sparse Distance Preservers and Additive Spanners. SIAM J. Discret. Math. 19 (4) (2005)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments Electron. Colloquium Comput. Complex. (131) (2005)
Don Coppersmith, Moshe Lewenstein
Constructive Bounds on Ordered Factorizations. SIAM J. Discret. Math. 19 (2) (2005)
Don Coppersmith, Michael Elkin
Sparse source-wise and pair-wise distance preservers. SODA (2005)
Don Coppersmith, Jon Lee
Parsimonious binary-encoding in integer programming. Discret. Optim. 2 (3) (2005)
Don Coppersmith, Atri Rudra
On the Robust Testability of Product of Codes Electron. Colloquium Comput. Complex. (104) (2005)
Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. APPROX-RANDOM (2004)
Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj
Divisors in Residue Classes, Constructively. IACR Cryptol. ePrint Arch. 2004 (2004)
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) (2004)
Don Coppersmith, Ravi Kumar
An improved data stream algorithm for frequency moments. SODA (2004)
Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions Electron. Colloquium Comput. Complex. (052) (2004)
Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
Random MAX SAT, random MAX CUT, and their phase transitions. SODA (2003)
Don Coppersmith, Madhu Sudan
Reconstructing curves in three (and higher) dimensional space from noisy data. STOC (2003)
Béla Bollobás, Don Coppersmith, Michael Elkin
Sparse distance preservers and additive spanners. SODA (2003)
Don Coppersmith, Shai Halevi, Charanjit S. Jutla
Cryptanalysis of stream ciphers with linear masking. IACR Cryptol. ePrint Arch. 2002 (2002)
Don Coppersmith, Markus Jakobsson
Almost Optimal Hash Sequence Traversal. IACR Cryptol. ePrint Arch. 2002 (2002)
Don Coppersmith, David Gamarnik, Maxim Sviridenko
The diameter of a long-range percolation graph. Random Struct. Algorithms 21 (1) (2002)
Don Coppersmith, David Gamarnik, Maxim Sviridenko
The diameter of a long range percolation graph. SODA (2002)
Shai Halevi, Don Coppersmith, Charanjit S. Jutla
Scream: A Software-Efficient Stream Cipher. FSE (2002)
Don Coppersmith, Markus Jakobsson
Almost Optimal Hash Sequence Traversal. Financial Cryptography (2002)
Shai Halevi, Don Coppersmith, Charanjit S. Jutla
Scream: a software-efficient stream cipher. IACR Cryptol. ePrint Arch. 2002 (2002)
Don Coppersmith, Shai Halevi, Charanjit S. Jutla
Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO (2002)
Don Coppersmith
Weakness in Quaternion Signatures. J. Cryptol. 14 (2) (2001)
Don Coppersmith
Finding Small Solutions to Small Degree Polynomials. CaLC (2001)
Don Coppersmith
L Infinity Embeddings. RANDOM-APPROX (2001)
Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin
Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. 104 (1-3) (2000)
Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm. CRYPTO (2000)
Don Coppersmith, Rosario Gennaro, Shai Halevi, Charanjit S. Jutla, Stephen M. Matyas, Mohammad Peyravian, David Safford, Nevenko Zunic
IBM Comments. AES Candidate Conference (2000)
Don Coppersmith, Igor E. Shparlinski
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptol. 13 (3) (2000)
Don Coppersmith
Cryptography. IBM J. Res. Dev. 44 (1) (2000)
Don Coppersmith, Se June Hong, Jonathan R. M. Hosking
Partitioning Nominal Attributes in Decision Trees. Data Min. Knowl. Discov. 3 (2) (1999)
Don Coppersmith
Weakness in Quaternion Signatures. CRYPTO (1999)
Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29 (3) (1999)
Don Coppersmith, Gregory B. Sorkin
Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algorithms 15 (2) (1999)
Don Coppersmith, Frederick C. Mintzer, Charles Philippe Tresser, Chai Wah Wu, Minerva M. Yeung
Fragile imperceptible digital watermark with privacy control. Security and Watermarking of Multimedia Contents (1999)
Don Coppersmith, Baruch Schieber
Lower Bounds on the Depth of Monotone Arithmetic Computations. J. Complex. 15 (1) (1999)
Mohammad Peyravian, Don Coppersmith
A structured symmetric-key block cipher. Comput. Secur. 18 (2) (1999)
Don Coppersmith
Specialized Integer Factorization. EUROCRYPT (1998)
Don Coppersmith, James B. Shearer
New Bounds for Union-free Families of Sets. Electron. J. Comb. 5 (1998)
Don Coppersmith
Attacking Four-Round Luby-Rackoff Ciphers. Cryptologia 22 (3) (1998)
Don Coppersmith, David A. Wagner, Bruce Schneier, John Kelsey
Cryptanalysis of TWOPRIME. FSE (1998)
Don Coppersmith, Gregory B. Sorkin
Constructive Bounds and Exact Expectations for the Random Assignment Problem. RANDOM (1998)
Phillip Rogaway, Don Coppersmith
A Software-Optimized Encryption Algorithm. J. Cryptol. 11 (4) (1998)
Don Coppersmith, Chris L. Holloway, Stephen M. Matyas, Nevenko Zunic
The data encryption standard. Inf. Secur. Tech. Rep. 2 (2) (1997)
Don Coppersmith, Adi Shamir
Lattice Attacks on NTRU. EUROCRYPT (1997)
Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
The Angular-Metric Traveling Salesman Problem. SODA (1997)
Don Coppersmith
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. J. Cryptol. 10 (4) (1997)
Don Coppersmith
Rectangular Matrix Multiplication Revisited. J. Complex. 13 (1) (1997)
Don Coppersmith, Jacques Stern, Serge Vaudenay
The Security of the Birational Permutation Signature Schemes. J. Cryptol. 10 (3) (1997)
Don Coppersmith
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. EUROCRYPT (1996)
Don Coppersmith
Finding a Small Root of a Univariate Modular Equation. EUROCRYPT (1996)
Robert J. Cimikowski, Don Coppersmith
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discret. Math. 149 (1-3) (1996)
Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
Linearity testing in characteristic two. IEEE Trans. Inf. Theory 42 (6) (1996)
Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter
Low-Exponent RSA with Related Messages. EUROCRYPT (1996)
Don Coppersmith, Steven J. Phillips
On a Question of Erdös on Subsequence Sums. SIAM J. Discret. Math. 9 (2) (1996)
Don Coppersmith, Don B. Johnson, Stephen M. Matyas
A proposed mode for triple-DES encryption. IBM J. Res. Dev. 40 (2) (1996)
Don Coppersmith, Uriel Feige, James B. Shearer
Random Walks on Regular and Irregular Graphs. SIAM J. Discret. Math. 9 (2) (1996)
Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
Efficient Routing in Optical Networks. J. ACM 43 (6) (1996)
Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
Linearity Testing in Characteristic Two. FOCS (1995)
Don Coppersmith, Ephraim Feig, Elliot N. Linzer
Hadamard transforms on multiply/add architectures. IEEE Trans. Signal Process. 42 (4) (1994)
Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
Efficient Routing and Scheduling Algorithms for Optical Networks. SODA (1994)
Don Coppersmith
The Data Encryption Standard (DES) and its strength against attacks. IBM J. Res. Dev. 38 (3) (1994)
Don Coppersmith, C. Andrew Neff
Roots of a Polynomial and its Derivatives. SODA (1994)
Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan
The minimum latency problem. STOC (1994)
Don Coppersmith
Attack on the Cryptographic Scheme NIKS-TAS. CRYPTO (1994)
Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan
On the minimum latency problem. CoRR (1994)
Don Coppersmith, Hugo Krawczyk, Yishay Mansour
The Shrinking Generator. CRYPTO (1993)
Don Coppersmith, Jacques Stern, Serge Vaudenay
Attacks on the Birational Permutation Signature Schemes. CRYPTO (1993)
Don Coppersmith
Modifications to the Number Field Sieve. J. Cryptol. 6 (3) (1993)
Phillip Rogaway, Don Coppersmith
A Software-Optimised Encryption Algorithm. FSE (1993)
Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. ACM 40 (3) (1993)
Don Coppersmith, Prasad Tetali, Peter Winkler
Collisions Among Random Walks on a Graph. SIAM J. Discret. Math. 6 (3) (1993)
Don Coppersmith, Baruch Schieber
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) FOCS (1992)
Don Coppersmith, Shmuel Winograd
Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9 (3) (1990)
Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) STOC (1990)
Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman
A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30 (4) (1989)
Don Coppersmith, Prabhakar Raghavan, Martin Tompa
Parallel Graph Algorithms That Are Efficient on Average Inf. Comput. 81 (3) (1989)
Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
Balancing sets of vectors. IEEE Trans. Inf. Theory 34 (1) (1988)
Don Coppersmith, Prabhakar Raghavan, Martin Tompa
Parallel Graph Algorithms that Are Efficient on Average FOCS (1987)
Don Coppersmith
Cryptography. IBM J. Res. Dev. 31 (2) (1987)
Don Coppersmith, Shmuel Winograd
Matrix Multiplication via Arithmetic Progressions STOC (1987)
Don Coppersmith, Maria M. Klawe, Nicholas Pippenger
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15 (1) (1986)
Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel
Discrete Logarithms in GF(p). Algorithmica 1 (1) (1986)

Don Coppersmith.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Don Coppersmith