The following pages link to Don Coppersmith (Q181984):
Displayed 50 items.
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Conditions for weak ergodicity of inhomogeneous Markov chains (Q956398) (← links)
- Robust reductions from ranking to classification (Q1009271) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- Each four-celled animal tiles the plane (Q1078572) (← links)
- An application of factoring (Q1081302) (← links)
- Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- New bounds for union-free families of sets (Q1130439) (← links)
- On two criteria for infinite random sequences (Q1214757) (← links)
- A software-optimized encryption algorithm (Q1281787) (← links)
- Lower bounds on the depth of monotone arithmetic computations (Q1288530) (← links)
- Modifications to the number field sieve (Q1310453) (← links)
- Solving linear equations over GF(2): Block Lanczos algorithm (Q1311312) (← links)
- Rectangular matrix multiplication revisited (Q1361875) (← links)
- The security of the birational permutation signature schemes (Q1364903) (← links)
- Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices (Q1368768) (← links)
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities (Q1382143) (← links)
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. (Q1573770) (← links)
- Random walk on upper triangular matrices mixes rapidly (Q1579894) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- About the optimal density associated to the chiral index of a sample from a bivariate distribution (Q1780709) (← links)
- A generalized model for understanding evasiveness (Q1825645) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- The sizes of maximal planar, outerplanar, and bipartite planar subgraphs (Q1910589) (← links)
- Testing set proportionality and the Ádám isomorphism of circulant graphs (Q2458932) (← links)
- Cryptanalysis of ISO/IEC 9796-1 (Q2482334) (← links)
- On the singularity of matrices (Q2575014) (← links)
- Parsimonious binary-encoding in integer programming (Q2581315) (← links)
- The minimum latency problem (Q2817608) (← links)
- Low-Exponent RSA with Related Messages (Q2876882) (← links)
- Finding a Small Root of a Univariate Modular Equation (Q2876895) (← links)
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known (Q2876898) (← links)
- Binary Nontiles (Q2902885) (← links)
- (Q2921725) (← links)
- Almost Optimal Hash Sequence Traversal (Q2995365) (← links)
- (Q3046355) (← links)
- (Q3128886) (← links)
- (Q3128902) (← links)
- Linearity testing in characteristic two (Q3129465) (← links)
- Collisions Among Random Walks on a Graph (Q3136609) (← links)
- Random walks on weighted graphs and applications to on-line algorithms (Q3140012) (← links)
- The diameter of a long-range percolation graph (Q3150196) (← links)
- The optimality of the online greedy algorithm in carpool and chairman assignment problems (Q3189021) (← links)
- Fast evaluation of logarithms in fields of characteristic two (Q3216753) (← links)
- On the minimum distance of some quadratic residue codes (Corresp.) (Q3329382) (← links)
- Polynomials whose powers are sparse (Q3353091) (← links)
- (Q3415012) (← links)
- Sparse Sourcewise and Pairwise Distance Preservers (Q3440267) (← links)