Don Coppersmith

According to our database, Don Coppersmith authored at least 99 papers between 1974 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2012

Binary Nontiles.

Don Coppersmith, Victor S. Miller

SIAM J. Discret. Math., 2012

2011

The optimality of the online greedy algorithm in carpool and chairman assignment problems.

Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu

ACM Trans. Algorithms, 2011

Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy.

Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang

Algorithmica, 2011

2010

Ordering by weighted number of wins gives a good ranking for weighted tournaments.

Don Coppersmith, Lisa Fleischer, Atri Rudra

ACM Trans. Algorithms, 2010

2009

Binary Non-tiles

Don Coppersmith, Victor S. Miller

CoRR, 2009

2008

Improved Approximation Algorithms for Broadcast Scheduling.

Nikhil Bansal, Don Coppersmith, Maxim Sviridenko

SIAM J. Comput., 2008

Divisors in residue classes, constructively.

Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj

Math. Comput., 2008

Robust reductions from ranking to classification.

Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin

Mach. Learn., 2008

Cryptanalysis of ISO/IEC 9796-1.

Don Coppersmith, Jean-Sébastien Coron, François Grieu, Shai Halevi, Charanjit S. Jutla, David Naccache, Julien P. Stern

J. Cryptol., 2008

2006

Sparse Sourcewise and Pairwise Distance Preservers.

Don Coppersmith, Michael Elkin

SIAM J. Discret. Math., 2006

Testing set proportionality and the Ádám isomorphism of circulant graphs.

Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski

J. Discrete Algorithms, 2006

Minimizing Setup and Beam-On Times in Radiation Therapy.

Nikhil Bansal, Don Coppersmith, Baruch Schieber

Proceedings of the Approximation, 2006

2005

Constructive Bounds on Ordered Factorizations.

Don Coppersmith, Moshe Lewenstein

SIAM J. Discret. Math., 2005

Sparse Distance Preservers and Additive Spanners.

Béla Bollobás, Don Coppersmith, Michael Elkin

SIAM J. Discret. Math., 2005

On the Robust Testability of Product of Codes

Don Coppersmith, Atri Rudra

Electron. Colloquium Comput. Complex., 2005

Parsimonious binary-encoding in integer programming.

Don Coppersmith, Jon Lee

Discret. Optim., 2005

Sparse source-wise and pair-wise distance preservers.

Don Coppersmith, Michael Elkin

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Random MAX SAT, random MAX CUT, and their phase transitions.

Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin

Random Struct. Algorithms, 2004

Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions

Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld

Electron. Colloquium Comput. Complex., 2004

An improved data stream algorithm for frequency moments.

Don Coppersmith, Ravi Kumar

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Reconstructing curves in three (and higher) dimensional space from noisy data.

Don Coppersmith, Madhu Sudan

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

The diameter of a long-range percolation graph.

Don Coppersmith, David Gamarnik, Maxim Sviridenko

Random Struct. Algorithms, 2002

Scream: a software-efficient stream cipher.

Shai Halevi, Don Coppersmith, Charanjit S. Jutla

IACR Cryptol. ePrint Arch., 2002

Almost Optimal Hash Sequence Traversal.

Don Coppersmith, Markus Jakobsson

IACR Cryptol. ePrint Arch., 2002

Cryptanalysis of stream ciphers with linear masking.

Don Coppersmith, Shai Halevi, Charanjit S. Jutla

IACR Cryptol. ePrint Arch., 2002

2001

Weakness in Quaternion Signatures.

Don Coppersmith

J. Cryptol., 2001

L Infinity Embeddings.

Don Coppersmith

Proceedings of the Approximation, 2001

Finding Small Solutions to Small Degree Polynomials.

Don Coppersmith

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.

Don Coppersmith, Igor E. Shparlinski

J. Cryptol., 2000

Euler circuits and DNA sequencing by hybridization.

Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin

Discret. Appl. Math., 2000

Key Recovery and Forgery Attacks on the MacDES MAC Algorithm.

Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell

Proceedings of the Advances in Cryptology, 2000

IBM Comments.

Don Coppersmith, Rosario Gennaro, Shai Halevi, Charanjit S. Jutla, Stephen M. Matyas, Mohammad Peyravian, David Safford, Nevenko Zunic

Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999

The Angular-Metric Traveling Salesman Problem.

Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber

SIAM J. Comput., 1999

Constructive bounds and exact expectations for the random assignment problem.

Don Coppersmith, Gregory B. Sorkin

Random Struct. Algorithms, 1999

Lower Bounds on the Depth of Monotone Arithmetic Computations.

Don Coppersmith, Baruch Schieber

J. Complex., 1999

Partitioning Nominal Attributes in Decision Trees.

Don Coppersmith, Se June Hong, Jonathan R. M. Hosking

Data Min. Knowl. Discov., 1999

A structured symmetric-key block cipher.

Mohammad Peyravian, Don Coppersmith

Comput. Secur., 1999

Fragile imperceptible digital watermark with privacy control.

Don Coppersmith, Frederick C. Mintzer, Charles Philippe Tresser, Chai Wah Wu, Minerva M. Yeung

Proceedings of the Security and Watermarking of Multimedia Contents, 1999

1998

A Software-Optimized Encryption Algorithm.

Phillip Rogaway, Don Coppersmith

J. Cryptol., 1998

Attacking Four-Round Luby-Rackoff Ciphers.

Don Coppersmith

Cryptologia, 1998

New Bounds for Union-free Families of Sets.

Don Coppersmith, James B. Shearer

Electron. J. Comb., 1998

Cryptanalysis of TWOPRIME.

Don Coppersmith, David A. Wagner, Bruce Schneier, John Kelsey

Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Specialized Integer Factorization.

Don Coppersmith

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997

The Security of the Birational Permutation Signature Schemes.

Don Coppersmith, Jacques Stern, Serge Vaudenay

J. Cryptol., 1997

Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities.

Don Coppersmith

J. Cryptol., 1997

Rectangular Matrix Multiplication Revisited.

Don Coppersmith

J. Complex., 1997

The data encryption standard.

Don Coppersmith, Chris L. Holloway, Stephen M. Matyas, Nevenko Zunic

Inf. Secur. Tech. Rep., 1997

Lattice Attacks on NTRU.

Don Coppersmith, Adi Shamir

Proceedings of the Advances in Cryptology, 1997

1996

Linearity testing in characteristic two.

Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan

IEEE Trans. Inf. Theory, 1996

On a Question of Erdös on Subsequence Sums.

Don Coppersmith, Steven J. Phillips

SIAM J. Discret. Math., 1996

Random Walks on Regular and Irregular Graphs.

Don Coppersmith, Uriel Feige, James B. Shearer

SIAM J. Discret. Math., 1996

Efficient Routing in Optical Networks.

Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan

J. ACM, 1996

A proposed mode for triple-DES encryption.

Don Coppersmith, Don B. Johnson, Stephen M. Matyas

IBM J. Res. Dev., 1996

The sizes of maximal planar, outerplanar, and bipartite planar subgraphs.

Robert J. Cimikowski, Don Coppersmith

Discret. Math., 1996

Low-Exponent RSA with Related Messages.

Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter

Proceedings of the Advances in Cryptology, 1996

Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1996

Finding a Small Root of a Univariate Modular Equation.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1996

1994

Hadamard transforms on multiply/add architectures.

Don Coppersmith, Ephraim Feig, Elliot N. Linzer

IEEE Trans. Signal Process., 1994

The Data Encryption Standard (DES) and its strength against attacks.

Don Coppersmith

IBM J. Res. Dev., 1994

The minimum latency problem.

Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Roots of a Polynomial and its Derivatives.

Don Coppersmith, C. Andrew Neff

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.

Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Attack on the Cryptographic Scheme NIKS-TAS.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1994

1993

Collisions Among Random Walks on a Graph.

Don Coppersmith, Prasad Tetali, Peter Winkler

SIAM J. Discret. Math., 1993

Modifications to the Number Field Sieve.

Don Coppersmith

J. Cryptol., 1993

Random Walks on Weighted Graphs and Applications to On-line Algorithms.

Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir

J. ACM, 1993

A Software-Optimised Encryption Algorithm.

Phillip Rogaway, Don Coppersmith

Proceedings of the Fast Software Encryption, 1993

Attacks on the Birational Permutation Signature Schemes.

Don Coppersmith, Jacques Stern, Serge Vaudenay

Proceedings of the Advances in Cryptology, 1993

The Shrinking Generator.

Don Coppersmith, Hugo Krawczyk, Yishay Mansour

Proceedings of the Advances in Cryptology, 1993

1992

Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)

Don Coppersmith, Baruch Schieber

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

Matrix Multiplication via Arithmetic Progressions.

Don Coppersmith, Shmuel Winograd

J. Symb. Comput., 1990

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)

Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Parallel Graph Algorithms That Are Efficient on Average

Don Coppersmith, Prabhakar Raghavan, Martin Tompa

Inf. Comput., June, 1989

A Generalized Model for Understanding Evasiveness.

Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman

Inf. Process. Lett., 1989

1988

Balancing sets of vectors.

Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko

IEEE Trans. Inf. Theory, 1988

1987

Cryptography.

Don Coppersmith

IBM J. Res. Dev., 1987

1986

Alphabetic Minimax Trees of Degree at Most t.

Don Coppersmith, Maria M. Klawe, Nicholas Pippenger

SIAM J. Comput., 1986

Discrete Logarithms in GF(p).

Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel

Algorithmica, 1986

1985

An Application of Factoring.

Don Coppersmith, James H. Davenport

J. Symb. Comput., 1985

Each Four-Celled Animal Tiles the Plane.

Don Coppersmith

J. Comb. Theory, Ser. A, 1985

Solving NP-hard problems in 'almost trees': Vertex cover.

Don Coppersmith, Uzi Vishkin

Discret. Appl. Math., 1985

The Real Reason for Rivest's Phenomenon.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1985

Cheating at Mental Poker.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1985

Another Birthday Attack.

Don Coppersmith

Proceedings of the Advances in Cryptology, 1985

1984

On the minimum distance of some quadratic residue codes.

Don Coppersmith, Gadiel Seroussi

IEEE Trans. Inf. Theory, 1984

Fast evaluation of logarithms in fields of characteristic two.

Don Coppersmith

IEEE Trans. Inf. Theory, 1984

Evaluating Logarithms in GF(2^n)

Don Coppersmith

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Algorithms for sliding block codes - An application of symbolic dynamics to information theory.

Roy L. Adler, Don Coppersmith, Martin Hassner

IEEE Trans. Inf. Theory, 1983

Optimal Wiring of Movable Terminals.

Inder S. Gopal, Don Coppersmith, C. K. Wong

IEEE Trans. Computers, 1983

Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.

Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg

IEEE Trans. Computers, 1983

1982

Minimizing Packet Waiting Time in a Multibeam Satellite System.

Inder S. Gopal, Don Coppersmith, C. K. Wong

IEEE Trans. Commun., 1982

On the Asymptotic Complexity of Matrix Multiplication.

Don Coppersmith, Shmuel Winograd

SIAM J. Comput., 1982

Analysis of a General Mass Storage System.

Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong

SIAM J. Comput., 1982

Rapid Multiplication of Rectangular Matrices.

Don Coppersmith

SIAM J. Comput., 1982

1981

An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders.

Giancarlo Bongiovanni, Don Coppersmith, C. K. Wong

IEEE Trans. Commun., 1981

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)

Don Coppersmith, Shmuel Winograd

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1976

The Generation of Permutations in Magnetic Bubble Memories.

C. K. Wong, Don Coppersmith

IEEE Trans. Computers, 1976

1975

The Complement of Certain Recursively Defined Sets.

Don Coppersmith

J. Comb. Theory, Ser. A, 1975

1974

A Combinatorial Problem Related to Multimodule Memory Organizations.

C. K. Wong, Don Coppersmith

J. ACM, 1974