Revision as of 22:00, 30 April 2019

Home * People * Ronald L. Rivest

Ronald L. Rivest ^[1]

Ronald (Ron) Linn Rivest,
an American mathematician, computer scientist and cryptographer, Andrew and Erna Viterbi Professor of Computer Science and Engineering in MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). Ron Rivest is one of the inventors of the RSA algorithm (with Adi Shamir and Leonard Adleman) ^[2], and inventor of the symmetric key encryption algorithms RC2, RC4, RC5, co-inventor of RC6, designer of the cryptographic hash functions MD2, MD4 and MD5 message-digest algorithms, co-designer of MD6, and co-author (with Charles Leiserson et al.) of Introduction to Algorithms. He further researched and published on machine learning and game tree search by Min/Max approximation ^[3].

Photos

Adi, Ron, and Len ^[4] ^[5]

Ronald L. Rivest (1987). Game Tree Searching by Min/Max Approximation. Artificial Intelligence, Vol. 34, No. 1, pdf 1995
Ronald L. Rivest (1987). Learning Decision Lists. Machine Learning, Vol. 2, pdf
Ronald L. Rivest, Robert Schapire (1987). Diversity-Based Inference of Finite Automata. (Extended Abstract) FOCS 1987, pdf
Ronald L. Rivest, Robert Schapire (1989). Inference of Finite Automata Using Homing Sequences. (Extended Abstract) STOC 1989, pdf

Ronald L. Rivest, Robert Schapire (1990). A new approach to unsupervised learning in deterministic environments. in Machine learning: an artificial intelligence approach volume III, pdf preprint
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest (1990). Introduction to Algorithms. (1st edition). MIT Press and McGraw-Hill. ISBN 0-262-03141-8.
Ronald L. Rivest, Robert Schapire (1994). Diversity-Based Inference of Finite Automata. Journal of the ACM, Vol. 41, No. 3, pdf

@@ Line 29: / Line 29: @@
 ==2010 ...==
 * [[Ronald L. Rivest]] ('''2011'''). ''The invertibility of the XOR of rotations of a binary word''. [https://dblp1.uni-trier.de/db/journals/ijcm/ijcm88.html International Journal of Computer Mathematics, Vol. 88], [https://pdfs.semanticscholar.org/8177/7b0bb30aa7ca12f9a1aea57691a6fb1e1249.pdf 2009 pdf preprint]
-* [[Erik D. Demaine]], [[Martin L. Demaine]], [https://en.wikipedia.org/wiki/Yair_Minsky Yair N. Minsky], [[Mathematician#JSBMitchell|Joseph S. B. Mitchell]], [[Ronald L. Rivest]], [https://en.wikipedia.org/wiki/Mihai_P%C4%83tra%C8%99cu Mihai Pătrașcu] ('''2012'''). ''Picture-Hanging Puzzles.''. [https://arxiv.org/abs/1203.3602 arXiv:1203.3602]
+* [[Erik D. Demaine]], [[Martin L. Demaine]], [https://en.wikipedia.org/wiki/Yair_Minsky Yair N. Minsky], [[Mathematician#JSBMitchell|Joseph S. B. Mitchell]], [[Ronald L. Rivest]], [[Mathematician#MPatrascu|Mihai Pătrașcu]] ('''2012'''). ''Picture-Hanging Puzzles.''. [https://arxiv.org/abs/1203.3602 arXiv:1203.3602]
 * [[Ronald L. Rivest]], [https://scholar.google.com/citations?user=5EMVIoEAAAAJ&hl=en Philip B. Stark] ('''2017'''). ''[https://www.computer.org/csdl/mags/sp/2017/03/msp2017030048-abs.html When Is an Election Verifiable]''? [[IEEE]] Security & Privacy
 * [[Ronald L. Rivest]] ('''2018'''). ''Consistent Sampling with Replacement.'' [https://arxiv.org/abs/1808.10016 arXiv:1808.10016]