The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Don Coppersmith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Don Coppersmith, Shmuel Winograd
    Matrix Multiplication via Arithmetic Progressions [Citation Graph (7, 0)][DBLP]
    STOC, 1987, pp:1-6 [Conf]
  2. Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel
    Discrete Logarithms in GF(p). [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:1-15 [Journal]
  3. Don Coppersmith, Shmuel Winograd
    On the Asymptotic Complexity of Matrix Multiplication. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:472-492 [Journal]
  4. Don Coppersmith, Rosario Gennaro, Shai Halevi, Charanjit S. Jutla, Stephen M. Matyas, Mohammad Peyravian, David Safford, Nevenko Zunic
    IBM Comments. [Citation Graph (0, 0)][DBLP]
    AES Candidate Conference, 2000, pp:333-336 [Conf]
  5. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:273-285 [Conf]
  6. Nikhil Bansal, Don Coppersmith, Baruch Schieber
    Minimizing Setup and Beam-On Times in Radiation Therapy. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:27-38 [Conf]
  7. Don Coppersmith
    Finding Small Solutions to Small Degree Polynomials. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:20-31 [Conf]
  8. Don Coppersmith
    Another Birthday Attack. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:14-17 [Conf]
  9. Don Coppersmith
    Cheating at Mental Poker. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:104-107 [Conf]
  10. Don Coppersmith
    The Real Reason for Rivest's Phenomenon. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:535-536 [Conf]
  11. Don Coppersmith
    Attack on the Cryptographic Scheme NIKS-TAS. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:294-307 [Conf]
  12. Don Coppersmith
    Weakness in Quaternion Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:305-314 [Conf]
  13. Don Coppersmith, Shai Halevi, Charanjit S. Jutla
    Cryptanalysis of Stream Ciphers with Linear Masking. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:515-532 [Conf]
  14. Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell
    Key Recovery and Forgery Attacks on the MacDES MAC Algorithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:184-196 [Conf]
  15. Don Coppersmith, Hugo Krawczyk, Yishay Mansour
    The Shrinking Generator. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:22-39 [Conf]
  16. Don Coppersmith, Jacques Stern, Serge Vaudenay
    Attacks on the Birational Permutation Signature Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:435-443 [Conf]
  17. Don Coppersmith
    Finding a Small Root of a Univariate Modular Equation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:155-165 [Conf]
  18. Don Coppersmith, Adi Shamir
    Lattice Attacks on NTRU. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:52-61 [Conf]
  19. Don Coppersmith
    Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:178-189 [Conf]
  20. Don Coppersmith
    Specialized Integer Factorization. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:542-545 [Conf]
  21. Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter
    Low-Exponent RSA with Related Messages. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:1-9 [Conf]
  22. Don Coppersmith, Markus Jakobsson
    Almost Optimal Hash Sequence Traversal. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2002, pp:102-119 [Conf]
  23. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity Testing in Characteristic Two. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:432-441 [Conf]
  24. Don Coppersmith, Prabhakar Raghavan, Martin Tompa
    Parallel Graph Algorithms that Are Efficient on Average [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:260-269 [Conf]
  25. Don Coppersmith, Baruch Schieber
    Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:288-295 [Conf]
  26. Don Coppersmith, Shmuel Winograd
    On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:82-90 [Conf]
  27. Don Coppersmith, David Wagner, Bruce Schneier, John Kelsey
    Cryptanalysis of TWOPRIME. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1998, pp:32-48 [Conf]
  28. Shai Halevi, Don Coppersmith, Charanjit S. Jutla
    Scream: A Software-Efficient Stream Cipher. [Citation Graph (0, 0)][DBLP]
    FSE, 2002, pp:195-209 [Conf]
  29. Phillip Rogaway, Don Coppersmith
    A Software-Optimised Encryption Algorithm. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1993, pp:56-63 [Conf]
  30. Don Coppersmith
    L Infinity Embeddings. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:223-228 [Conf]
  31. Don Coppersmith, Gregory B. Sorkin
    Constructive Bounds and Exact Expectations for the Random Assignment Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:319-330 [Conf]
  32. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing and Scheduling Algorithms for Optical Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:412-423 [Conf]
  33. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
    The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:221-229 [Conf]
  34. Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
    Improved approximation algorithms for broadcast scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:344-353 [Conf]
  35. Béla Bollobás, Don Coppersmith, Michael Elkin
    Sparse distance preservers and additive spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:414-423 [Conf]
  36. Don Coppersmith, Michael Elkin
    Sparse source-wise and pair-wise distance preservers. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:660-669 [Conf]
  37. Don Coppersmith, Lisa Fleischer, Atri Rudra
    Ordering by weighted number of wins gives a good ranking for weighted tournaments. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:776-782 [Conf]
  38. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:364-373 [Conf]
  39. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long range percolation graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:329-337 [Conf]
  40. Don Coppersmith, Ravi Kumar
    An improved data stream algorithm for frequency moments. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:151-156 [Conf]
  41. Don Coppersmith, C. Andrew Neff
    Roots of a Polynomial and its Derivatives. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:271-279 [Conf]
  42. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan
    The minimum latency problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:163-171 [Conf]
  43. Don Coppersmith
    Evaluating Logarithms in GF(2^n) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:201-207 [Conf]
  44. Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
    Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:369-378 [Conf]
  45. Don Coppersmith, Madhu Sudan
    Reconstructing curves in three (and higher) dimensional space from noisy data. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:136-142 [Conf]
  46. Don Coppersmith, James B. Shearer
    New Bounds for Union-free Families of Sets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  47. Mohammad Peyravian, Don Coppersmith
    A structured symmetric-key block cipher. [Citation Graph (0, 0)][DBLP]
    Computers & Security, 1999, v:18, n:2, pp:134-147 [Journal]
  48. Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin
    Euler circuits and DNA sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:63-96 [Journal]
  49. Don Coppersmith, Se June Hong, Jonathan R. M. Hosking
    Partitioning Nominal Attributes in Decision Trees. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 1999, v:3, n:2, pp:197-217 [Journal]
  50. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:052, pp:- [Journal]
  51. Don Coppersmith, Atri Rudra
    On the Robust Testability of Product of Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:104, pp:- [Journal]
  52. Don Coppersmith, Lisa Fleischer, Atri Rudra
    Ordering by weighted number of wins gives a good ranking for weighted tournaments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:131, pp:- [Journal]
  53. Don Coppersmith, Prabhakar Raghavan, Martin Tompa
    Parallel Graph Algorithms That Are Efficient on Average [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:318-333 [Journal]
  54. Don Coppersmith
    Cryptography. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 2000, v:44, n:1, pp:246-250 [Journal]
  55. Don Coppersmith
    Cryptography. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1987, v:31, n:2, pp:244-248 [Journal]
  56. Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman
    A Generalized Model for Understanding Evasiveness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:4, pp:205-208 [Journal]
  57. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:6, pp:973-1001 [Journal]
  58. Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
    Random Walks on Weighted Graphs and Applications to On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:421-453 [Journal]
  59. C. K. Wong, Don Coppersmith
    A Combinatorial Problem Related to Multimodule Memory Organizations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:392-402 [Journal]
  60. Don Coppersmith
    Rectangular Matrix Multiplication Revisited. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:42-49 [Journal]
  61. Don Coppersmith, Baruch Schieber
    Lower Bounds on the Depth of Monotone Arithmetic Computations. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:17-29 [Journal]
  62. Don Coppersmith
    The Complement of Certain Recursively Defined Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:3, pp:243-251 [Journal]
  63. Don Coppersmith
    Each Four-Celled Animal Tiles the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:444-449 [Journal]
  64. Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski
    Testing set proportionality and the Ádám isomorphism of circulant graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:324-335 [Journal]
  65. Don Coppersmith
    Weakness in Quaternion Signatures. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:2, pp:77-85 [Journal]
  66. Don Coppersmith
    Modifications to the Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:3, pp:169-180 [Journal]
  67. Don Coppersmith
    Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:4, pp:233-260 [Journal]
  68. Don Coppersmith, Igor Shparlinski
    On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:3, pp:339-360 [Journal]
  69. Don Coppersmith, Jacques Stern, Serge Vaudenay
    The Security of the Birational Permutation Signature Schemes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:3, pp:207-221 [Journal]
  70. Phillip Rogaway, Don Coppersmith
    A Software-Optimized Encryption Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1998, v:11, n:4, pp:273-287 [Journal]
  71. Don Coppersmith, James H. Davenport
    An Application of Factoring. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:2, pp:241-243 [Journal]
  72. Don Coppersmith, Shmuel Winograd
    Matrix Multiplication via Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:3, pp:251-280 [Journal]
  73. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:4, pp:502-545 [Journal]
  74. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long-range percolation graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:1, pp:1-13 [Journal]
  75. Don Coppersmith, Gregory B. Sorkin
    Constructive bounds and exact expectations for the random assignment problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:2, pp:113-144 [Journal]
  76. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
    The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:697-711 [Journal]
  77. Don Coppersmith
    Rapid Multiplication of Rectangular Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:467-471 [Journal]
  78. Don Coppersmith, Maria M. Klawe, Nicholas Pippenger
    Alphabetic Minimax Trees of Degree at Most t. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:189-192 [Journal]
  79. Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong
    Analysis of a General Mass Storage System. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:94-116 [Journal]
  80. Béla Bollobás, Don Coppersmith, Michael Elkin
    Sparse Distance Preservers and Additive Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:1029-1055 [Journal]
  81. Don Coppersmith, Uriel Feige, James B. Shearer
    Random Walks on Regular and Irregular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:301-308 [Journal]
  82. Don Coppersmith, Moshe Lewenstein
    Constructive Bounds on Ordered Factorizations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:301-303 [Journal]
  83. Don Coppersmith, Steven Phillips
    On a Question of Erdös on Subsequence Sums. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:173-177 [Journal]
  84. Don Coppersmith, Prasad Tetali, Peter Winkler
    Collisions Among Random Walks on a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:363-374 [Journal]
  85. Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg
    Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:2, pp:190-194 [Journal]
  86. Inder S. Gopal, Don Coppersmith, C. K. Wong
    Optimal Wiring of Movable Terminals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:9, pp:845-858 [Journal]
  87. C. K. Wong, Don Coppersmith
    The Generation of Permutations in Magnetic Bubble Memories. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:3, pp:254-262 [Journal]
  88. Roy L. Adler, Don Coppersmith, Martin Hassner
    Algorithms for sliding block codes - An application of symbolic dynamics to information theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:5-22 [Journal]
  89. Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
    Balancing sets of vectors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:128-0 [Journal]
  90. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity testing in characteristic two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1781-1795 [Journal]
  91. Don Coppersmith
    Fast evaluation of logarithms in fields of characteristic two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:587-593 [Journal]
  92. Don Coppersmith, Gadiel Seroussi
    On the minimum distance of some quadratic residue codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:407-0 [Journal]
  93. Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin
    Robust Reductions from Ranking to Classification. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:604-619 [Conf]
  94. Robert J. Cimikowski, Don Coppersmith
    The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:303-309 [Journal]

  95. Binary Non-tiles [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002