| Introduction to algorithms TH Cormen, CE Leiserson, RL Rivest, C Stein MIT press, 2009 | 49320 | 2009 |
| A method for obtaining digital signatures and public-key cryptosystems RL Rivest, A Shamir, L Adleman Communications of the ACM 21 (2), 120-126, 1978 | 19830 | 1978 |
| The MD5 message-digest algorithm R Rivest | 6616 | 1992 |
| The MD5 message-digest algorithm R Rivest | 6143 | 1992 |
| A digital signature scheme secure against adaptive chosen-message attacks S Goldwasser, S Micali, RL Rivest SIAM Journal on Computing 17 (2), 281-308, 1988 | 2980 | 1988 |
| Security and privacy aspects of low-cost radio frequency identification systems SA Weis, SE Sarma, RL Rivest, DW Engels Security in pervasive computing, 201-212, 2004 | 2028 | 2004 |
| On data banks and privacy homomorphisms RL Rivest, L Adleman, ML Dertouzos Foundations of secure computation 4 (11), 169-180, 1978 | 1604 | 1978 |
| Cryptographic communications system and method RL Rivest, A Shamir, LM Adleman US Patent 4,405,829, 1983 | 1479 | 1983 |
| How to leak a secret RL Rivest, A Shamir, Y Tauman International Conference on the Theory and Application of Cryptology and …, 2001 | 1441 | 2001 |
| The RC5 encryption algorithm RL Rivest International Workshop on Fast Software Encryption, 86-96, 1994 | 1409 | 1994 |
| Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973 | 1380 | 1973 |
| SPKI CM Ellison Encyclopedia of Cryptography and Security, 1243-1245, 2011 | 1329 | 2011 |
| The blocker tag: Selective blocking of RFID tags for consumer privacy A Juels, RL Rivest, M Szydlo Proceedings of the 10th ACM conference on Computer and communications …, 2003 | 1205 | 2003 |
| The MD4 message-digest algorithm R Rivest | 1169 | 1992 |
| Learning decision lists RL Rivest Machine learning 2 (3), 229-246, 1987 | 1052 | 1987 |
| PayWord and MicroMint: Two simple micropayment schemes RL Rivest, A Shamir International Workshop on Security Protocols, 69-87, 1996 | 927 | 1996 |
| Inferring decision trees using the minimum description lenght principle JR Quinlan, RL Rivest Information and computation 80 (3), 227-248, 1989 | 923 | 1989 |
| Constructing optimal binary decision trees is NP-complete H Laurent, RL Rivest Information processing letters 5 (1), 15-17, 1976 | 921 | 1976 |
| Training a 3-node neural network is NP-complete A Blum, RL Rivest Advances in neural information processing systems, 494-501, 1989 | 820 | 1989 |
| Orthogonal packings in two dimensions BS Baker, EG Coffman, Jr, RL Rivest SIAM Journal on computing 9 (4), 846-855, 1980 | 723 | 1980 |
Charles E. LeisersonMITVerified email at mit.edu