Ronald L. Rivest

Personal Homepage
Employer
()
Email

Publication Statistics

Publication period start
1975
Publication period end
2002
Number of co-authors
20

Co-authors
Number of publications with favourite co-authors

Productive Colleagues
Most productive colleagues in number of publications

Publications

Clarke, Dwaine E., Gassend, Blaise, Kotwal, Thomas, Burnside, Matt, Dijk, Marten van, Devadas, Srinivas, Rivest, Ronald L. (2002): The Untrusted Computer Problem and Camera-Based Authentication. In: Mattern, Friedemann, Naghshineh, Mahmoud (eds.) Pervasive 2002 - Pervasive Computing, First International Conference August 26-28, 2002, Zürich, Switzerland. pp. 114-124. http://link.springer.de/link/service/series/0558/bibs/2414/24140114.htm

Denning, Dorothy E., Godwin, Mike, Bayse, William A., Rotenberg, Marc, Branscomb, Lewis M., Branscomb, Anne M., Rivest, Ronald L., Grosso, Andrew, Marx, Gary T. (1993): To Tap or not to Tap. In Communications of the ACM, 36 (3) pp. 24-44.

Rivest, Ronald L., Hellman, Martin E., Anderson, John C., Lyons, John W. (1992): Responses to NIST\'s Proposal. In Communications of the ACM, 35 (7) pp. 41-54.

Rivest, Ronald L., Shamir, Adi (1984): How to Expose an Eavesdropper. In Communications of the ACM, 27 (4) pp. 393-395.

Rivest, Ronald L., Shamir, Adi, Adleman, Leonard M. (1983): A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). In Communications of the ACM, 26 (1) pp. 96-99.

Rivest, Ronald L., Shamir, Adi, Adleman, Leonard M. (1978): A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. In Communications of the ACM, 21 (2) pp. 120-126.

Rivest, Ronald L. (1976): On Self-Organizing Sequential Search Heuristics. In Communications of the ACM, 19 (2) pp. 63-67.

Floyd, Robert W., Rivest, Ronald L. (1975): Expected Time Bounds for Selection. In Communications of the ACM, 18 (3) pp. 165-172.

Floyd, Robert W., Rivest, Ronald L. (1975): The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489). In Communications of the ACM, 18 (3) pp. 173.