Don Coppersmith

12.7k total citations · 1 hit paper
106 papers, 5.5k citations indexed

About

Don Coppersmith is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Don Coppersmith has authored 106 papers receiving a total of 5.5k indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Artificial Intelligence, 45 papers in Computational Theory and Mathematics and 25 papers in Computer Networks and Communications. Recurrent topics in Don Coppersmith's work include Coding theory and cryptography (27 papers), Complexity and Algorithms in Graphs (20 papers) and graph theory and CDMA systems (15 papers). Don Coppersmith is often cited by papers focused on Coding theory and cryptography (27 papers), Complexity and Algorithms in Graphs (20 papers) and graph theory and CDMA systems (15 papers). Don Coppersmith collaborates with scholars based in United States, Israel and United Kingdom. Don Coppersmith's co-authors include S. Winograd, Chris K.C. Wong, Prabhakar Raghavan, M. Hassner, Roy L. Adler, Madhu Sudan, Gregory B. Sorkin, Sze Chuen Cesar Wong, Madhu Sudan and Richard Schroeppel and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing and Mathematics of Computation.

In The Last Decade

Don Coppersmith

101 papers receiving 4.8k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Matrix multiplication via arithmetic progressions

1990 1.3k citations Don Coppersmith et al. profile →

Peers

Countries citing papers authored by Don Coppersmith

Since Specialization

Citations

This map shows the geographic impact of Don Coppersmith's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Don Coppersmith with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Don Coppersmith more than expected).

Fields of papers citing papers by Don Coppersmith

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Don Coppersmith. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Don Coppersmith. The network helps show where Don Coppersmith may publish in the future.

Co-authorship network of co-authors of Don Coppersmith

This figure shows the co-authorship network connecting the top 25 collaborators of Don Coppersmith. A scholar is included among the top collaborators of Don Coppersmith based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Don Coppersmith. Don Coppersmith is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Ideal solutions in the Prouhet–Tarry–Escott problem 2023 ·Mathematics of Computation ·Don Coppersmith, Michael J. Mossinghoff, (unknown), Jeffrey M. VanderKam	0
2	The optimality of the online greedy algorithm in carpool and chairman assignment problems 2011 ·ACM Transactions on Algorithms ·Don Coppersmith, Tomasz Nowicki, (unknown), Charles Tresser, Chai Wah Wu	12
3	Ordering by weighted number of wins gives a good ranking for weighted tournaments 2006 ·Symposium on Discrete Algorithms ·Don Coppersmith, Lisa Fleischer, Atri Rudra	74
4	On the Robust Testability of Product of Codes 2005 ·Electronic colloquium on computational complexity ·Don Coppersmith, Atri Rudra	9
5	Sparse source-wise and pair-wise distance preservers 2005 ·Symposium on Discrete Algorithms ·Don Coppersmith, Michael Elkin	15
6	Constructive Bounds on Ordered Factorizations 2005 ·SIAM Journal on Discrete Mathematics ·Don Coppersmith, Moshe Lewenstein	4
7	On the singularity of matrices 2004 ·Linear Algebra and its Applications ·Don Coppersmith, Alan J. Hoffman	2
8	Sparse distance preservers and additive spanners 2003 ·Symposium on Discrete Algorithms ·Béla Bollobás, Don Coppersmith, Michael Elkin	13
9	The diameter of a long‐range percolation graph 2002 ·Random Structures and Algorithms ·Don Coppersmith, David Gamarnik, Maxim Sviridenko	57
10	Euler circuits and DNA sequencing by hybridization 2000 ·Discrete Applied Mathematics ·Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin	23
11	Cryptanalysis of TWOPRIME 1998 ·Don Coppersmith, David Wagner, Bruce Schneier, John Kelsey	1
12	Rectangular Matrix Multiplication Revisited 1997 ·Journal of Complexity ·Don Coppersmith	75
13	Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices 1997 ·Linear Algebra and its Applications ·Don Coppersmith, Alan J. Hoffman, Uriel G. Rothblum	1
14	Roots of a polynomial and its derivatives 1994 ·Symposium on Discrete Algorithms ·Don Coppersmith, C. Andrew Neff	12
15	Efficient routing and scheduling algorithms for optical networks 1994 ·Symposium on Discrete Algorithms ·Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, R. Ramaswami, Baruch Schieber, Madhu Sudan	90
16	A Software-Optimised Encryption Algorithm 1993 ·Phillip Rogaway, Don Coppersmith	17
17	Solving linear equations over GF(2): block Lanczos algorithm 1993 ·Linear Algebra and its Applications ·Don Coppersmith	35
18	Balancing sets of vectors 1988 ·IEEE Transactions on Information Theory ·Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew Odlyzko	51
19	A family of Lie algebras not extendible to a family of Lie groups 1977 ·Proceedings of the American Mathematical Society ·Don Coppersmith	4
20	The Generation of Permutations in Magnetic Bubble Memories 1976 ·IEEE Transactions on Computers ·Chris K.C. Wong, Don Coppersmith	17

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact