What is he best known for?
The fields of study he is best known for:
- Algorithm
- Algebra
- Cryptography
Don Coppersmith spends much of his time researching Discrete mathematics, Combinatorics, Encryption, Matrix multiplication and Authentication.
His Discrete mathematics research is multidisciplinary, incorporating elements of Travelling salesman problem, Latency and Approximation algorithm.
Don Coppersmith has researched Combinatorics in several fields, including Logarithm, Polynomial, Function field sieve and Constant.
The Public-key cryptography and Plaintext research Don Coppersmith does as part of his general Encryption study is frequently linked to other disciplines of science, such as Signal processing, therefore creating a link between diverse domains of science.
His research integrates issues of Block matrix and Diagonal matrix in his study of Matrix multiplication.
The various areas that Don Coppersmith examines in his Diagonal matrix study include Involutory matrix, Nonnegative matrix and Invertible matrix.
His most cited work include:
- Matrix multiplication via arithmetic progressions (2068 citations)
- Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities (589 citations)
- Matrix multiplication via arithmetic progressions (424 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Algorithm, Encryption and Stream cipher.
His Discrete mathematics study incorporates themes from Computation, Polynomial, Matrix multiplication and Prime.
As a part of the same scientific family, Don Coppersmith mostly works in the field of Matrix multiplication, focusing on Block matrix and, on occasion, Diagonal matrix.
His work in the fields of Combinatorics, such as Random graph, Integer and Conjecture, intersects with other areas such as Bounded function.
Don Coppersmith interconnects Hash function, Code and Arithmetic in the investigation of issues within Algorithm.
Don Coppersmith works mostly in the field of Encryption, limiting it down to concerns involving Authentication and, occasionally, Public-key cryptography, Watermark, Image and Encoder.
He most often published in these fields:
- Discrete mathematics (38.27%)
- Combinatorics (36.42%)
- Algorithm (24.07%)
What were the highlights of his more recent work (between 2002-2011)?
- Combinatorics (36.42%)
- Discrete mathematics (38.27%)
- Mathematical optimization (3.70%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Discrete mathematics, Mathematical optimization, Function and IBM are his primary areas of study.
His Combinatorics study frequently links to related topics such as Satisfiability.
His work carried out in the field of Discrete mathematics brings together such families of science as Abelian group and Distribution.
The Distribution study combines topics in areas such as Algebra homomorphism and Prime.
His work in Mathematical optimization addresses issues such as Scheduling, which are connected to fields such as Log-log plot and Linear programming.
His Binary logarithm study deals with Rounding intersecting with Algorithm.
Between 2002 and 2011, his most popular works were:
- An improved data stream algorithm for frequency moments (75 citations)
- Reconstructing curves in three (and higher) dimensional space from noisy data (69 citations)
- Sparse Sourcewise and Pairwise Distance Preservers (60 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Cryptography
Don Coppersmith mostly deals with Combinatorics, Discrete mathematics, Graph, Bound graph and Euclidean geometry.
His Combinatorics study integrates concerns from other disciplines, such as Algorithm and Simple.
While working on this project, Don Coppersmith studies both Discrete mathematics and Bounded function.
His research on Graph frequently connects to adjacent areas such as Digraph.
His Euclidean geometry research incorporates themes from Embedding, Independent set, Discrete geometry, Pairwise comparison and Vertex.
The study incorporates disciplines such as Directed graph and Constant factor in addition to Distance labeling.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
