R. Rivest
Artificial Intelligence · 1973–2016
A researcher in the Science corpus: 22 papers; trusts 20 researchers and is trusted by 190 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 37 citations into it; #2,199 of 36,961 by trust here, #4,247 by citations
- Information Systems — 16 citations into it; #589 of 9,233 by trust here, #576 by citations
- Computational Theory and Mathematics — 15 citations into it; #553 of 12,489 by trust here, #310 by citations
- Computer Vision and Pattern Recognition — 12 citations into it; #10,347 of 21,973 by trust here, #18,648 by citations
- Statistical Learning Theory — 9 citations into it; #71 of 1,040 by trust here, #91 by citations
- Algorithms & Complexity — 8 citations into it; #66 of 516 by trust here, #39 by citations
- Signal Processing — 5 citations into it
Whom R. Rivest trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- J. Ross Quinlan
- Leslie G. Valiant
- Temple F. Smith
- Michael Kearns
- Nick Littlestone
- Phillip Rogaway
- Mihir Bellare
- Whitfield Diffie
- Jorma Rissanen
- Ming Li
Who trusts R. Rivest overall
- Cynthia Rudin
- Mario Marchand
- Adrian Perrig
- Kush R. Varshney
- Johannes Fürnkranz
- Benjamin Letham
- Frank J. Balbach
- Ş. Ertekin
- Pedro M. Domingos
- David Pointcheval
Papers from R. Rivest's perspective
Ordered by how strongly the researchers R. Rivest trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Random oracles are practical: a paradigm for designing efficient protocols
- A theory of the learnable
- A method for obtaining digital signatures and public-key cryptosystems
- Untraceable electronic mail, return addresses, and digital pseudonyms
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
- Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
- A theory of the learnable
- Pseudo-random generation from one-way functions
- OCB: a block-cipher mode of operation for efficient authenticated encryption (Conference on Computer and Communications Security)
Their papers
- Original Contribution: Training a 3-node neural network is NP-complete (1992)
- Learning decision lists (2004) — 515 citations
- Constructing Optimal Binary Decision Trees is NP-Complete (1976)
- The Optimality of Correlated Sampling (2016) — 13 citations
- Certificate chain discovery in SPKI/SDSI (2001) — 371 citations
- Introduction to Algorithms, third edition (2009) — 2,936 citations
- The blocker tag: selective blocking of RFID tags for consumer privacy (2003) — 963 citations
- Honeywords: making password-cracking detectable (2013) — 350 citations
- An Optimal Single-Winner Preferential Voting System Based on Game Theory (2010) — 61 citations
- Introduction to Algorithms, 3rd Edition (2009) — 1,012 citations
- Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems (2003) — 1,516 citations
- Tweakable Block Ciphers (2002) — 597 citations
- Introduction to Algorithms, 2nd edition. (2001) — 3,838 citations
- Introduction to Algorithms, Second Edition (2001) — 2,867 citations
- Permutation Polynomials Modulo 2w (2001) — 106 citations
- How to Leak a Secret: Theory and Applications of Ring Signatures (2001) — 1,379 citations
- Being taught can be faster than asking questions (1995)
- Training a 3-node neural network is NP-complete (1988)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988)
- Learning Decision Lists (1987)