| 2008 |
|---|
| 143 | | David Chaum,
Miroslaw Kutylowski,
Ronald L. Rivest,
Peter Y. A. Ryan:
Frontiers of Electronic Voting, 29.07. - 03.08.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 142 | EE | Javed A. Aslam,
Raluca A. Popa,
Ronald L. Rivest:
On Auditing Elections When Precincts Have Different Sizes.
EVT 2008 |
| 141 | EE | David Chaum,
Richard Carback,
Jeremy Clark,
Aleksander Essex,
Stefan Popoveniuc,
Ronald L. Rivest,
Peter Y. A. Ryan,
Emily Shen,
Alan T. Sherman:
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes.
EVT 2008 |
| 2007 |
|---|
| 140 | EE | Ran Canetti,
Ronald L. Rivest,
Madhu Sudan,
Luca Trevisan,
Salil P. Vadhan,
Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment.
CRYPTO 2007: 264-283 |
| 139 | EE | David Chaum,
Miroslaw Kutylowski,
Ronald L. Rivest,
Peter Y. A. Ryan:
07311 Abstracts Collection -- Frontiers of Electronic Voting.
Frontiers of Electronic Voting 2007 |
| 138 | EE | David Chaum,
Miroslaw Kutylowski,
Ronald L. Rivest,
Peter Y. A. Ryan:
07311 Executive Summary -- Frontiers of Electronic Voting.
Frontiers of Electronic Voting 2007 |
| 137 | EE | Ronald L. Rivest:
Security of Voting Systems.
NSDI 2007 |
| 2006 |
|---|
| 136 | EE | John G. Brainard,
Ari Juels,
Ronald L. Rivest,
Michael Szydlo,
Moti Yung:
Fourth-factor authentication: somebody you know.
ACM Conference on Computer and Communications Security 2006: 168-178 |
| 135 | EE | Ronald L. Rivest,
Adi Shamir,
Yael Tauman:
How to Leak a Secret: Theory and Applications of Ring Signatures.
Essays in Memory of Shimon Even 2006: 164-186 |
| 134 | EE | Ben Adida,
David Chaum,
Susan Hohenberger,
Ronald L. Rivest:
Lightweight Email Signatures (Extended Abstract).
SCN 2006: 288-302 |
| 133 | EE | Ben Adida,
Ronald L. Rivest:
Scratch & vote: self-contained paper-based cryptographic voting.
WPES 2006: 29-40 |
| 2005 |
|---|
| 132 | EE | Ronald L. Rivest,
Burton S. Kaliski Jr.:
RSA Problem.
Encyclopedia of Cryptography and Security 2005 |
| 2004 |
|---|
| 131 | EE | Ronald L. Rivest:
Peppercoin Micropayments.
Financial Cryptography 2004: 2-8 |
| 130 | EE | Ruby B. Lee,
Zhijie Shi,
Yiqun Lisa Yin,
Ronald L. Rivest,
Matthew J. B. Robshaw:
On Permutation Operations in Cipher Design.
ITCC (2) 2004: 569-577 |
| 129 | EE | Ronald L. Rivest:
On the Notion of Pseudo-Free Groups.
TCC 2004: 505-521 |
| 128 | EE | Sanjay Raman,
Dwaine E. Clarke,
Matt Burnside,
Srinivas Devadas,
Ronald L. Rivest:
Access-controlled resource discovery in pervasive networks.
Concurrency - Practice and Experience 16(11): 1099-1120 (2004) |
| 2003 |
|---|
| 127 | EE | Ari Juels,
Ronald L. Rivest,
Michael Szydlo:
The blocker tag: selective blocking of RFID tags for consumer privacy.
ACM Conference on Computer and Communications Security 2003: 103-111 |
| 126 | EE | Nicko van Someren,
Andrew M. Odlyzko,
Ronald L. Rivest,
Tim Jones,
Duncan Goldie-Scot:
Does Anyone Really Need MicroPayments?
Financial Cryptography 2003: 69-76 |
| 125 | | Sanjay Raman,
Dwaine E. Clarke,
Matt Burnside,
Srinivas Devadas,
Ronald L. Rivest:
Access-Controlled Resource Discovery for Pervasive Networks.
SAC 2003: 338-345 |
| 124 | EE | Stephen A. Weis,
Sanjay E. Sarma,
Ronald L. Rivest,
Daniel W. Engels:
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems.
SPC 2003: 201-212 |
| 2002 |
|---|
| 123 | EE | Moses Liskov,
Ronald L. Rivest,
David Wagner:
Tweakable Block Ciphers.
CRYPTO 2002: 31-46 |
| 122 | EE | Silvio Micali,
Ronald L. Rivest:
Micropayments Revisited.
CT-RSA 2002: 149-163 |
| 121 | EE | Silvio Micali,
Ronald L. Rivest:
Transitive Signature Schemes.
CT-RSA 2002: 236-243 |
| 120 | EE | Rebecca N. Wright,
L. Jean Camp,
Ian Goldberg,
Ronald L. Rivest,
Graham Wood:
Privacy Tradeoffs: Myth or Reality? Panel.
Financial Cryptography 2002: 147-151 |
| 119 | EE | Dwaine E. Clarke,
Blaise Gassend,
Thomas Kotwal,
Matt Burnside,
Marten van Dijk,
Srinivas Devadas,
Ronald L. Rivest:
The Untrusted Computer Problem and Camera-Based Authentication.
Pervasive 2002: 114-124 |
| 118 | EE | Matt Burnside,
Dwaine E. Clarke,
Todd Mills,
Andrew Maywah,
Srinivas Devadas,
Ronald L. Rivest:
Proxy-based security protocols in networked mobile devices.
SAC 2002: 265-272 |
| 117 | EE | Markus Jakobsson,
Ari Juels,
Ronald L. Rivest:
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking.
USENIX Security Symposium 2002: 339-353 |
| 2001 |
|---|
| 116 | | Thomas H. Cormen,
Charles E. Leiserson,
Ronald L. Rivest,
Clifford Stein:
Introduction to Algorithms, Second Edition
The MIT Press and McGraw-Hill Book Company 2001 |
| 115 | EE | Ronald L. Rivest,
Adi Shamir,
Yael Tauman:
How to Leak a Secret.
ASIACRYPT 2001: 552-565 |
| 114 | EE | Ed Gerck,
C. Andrew Neff,
Ronald L. Rivest,
Aviel D. Rubin,
Moti Yung:
The Business of Electronic Voting.
Financial Cryptography 2001: 234-259 |
| 113 | | Dwaine E. Clarke,
Jean-Emile Elien,
Carl M. Ellison,
Matt Fredette,
Alexander Morcos,
Ronald L. Rivest:
Certificate Chain Discovery in SPKI/SDSI.
Journal of Computer Security 9(4): 285-322 (2001) |
| 2000 |
|---|
| 112 | | Ronald L. Rivest,
Matthew J. B. Robshaw,
Yiqun Lisa Yin:
RC6 as the AES.
AES Candidate Conference 2000: 337-342 |
| 1999 |
|---|
| 111 | EE | Scott Contini,
Ronald L. Rivest,
Matthew J. B. Robshaw,
Yiqun Lisa Yin:
Improved Analysis of Some Simplified Variants of RC6.
FSE 1999: 1-15 |
| 110 | EE | Anna Lysyanskaya,
Ronald L. Rivest,
Amit Sahai,
Stefan Wolf:
Pseudonym Systems.
Selected Areas in Cryptography 1999: 184-199 |
| 109 | | Baruch Awerbuch,
Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot.
Inf. Comput. 152(2): 155-172 (1999) |
| 108 | EE | Mihir Bellare,
Ronald L. Rivest:
Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer.
J. Cryptology 12(2): 117-139 (1999) |
| 1998 |
|---|
| 107 | EE | Oded Goldreich,
Birgit Pfitzmann,
Ronald L. Rivest:
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.
CRYPTO 1998: 153-168 |
| 106 | EE | Lars R. Knudsen,
Vincent Rijmen,
Ronald L. Rivest,
Matthew J. B. Robshaw:
On the Design and Security of RC2.
FSE 1998: 206-221 |
| 105 | EE | Ronald L. Rivest:
Can We Eliminate Certificate Revocations Lists?
Financial Cryptography 1998: 178-183 |
| 1997 |
|---|
| 104 | EE | Ronald L. Rivest:
All-or-Nothing Encryption and the Package Transform.
FSE 1997: 210-218 |
| 103 | | Ronald L. Rivest:
Perspectives on Financial Cryptography.
Financial Cryptography 1997: 145-150 |
| 102 | | Ronald L. Rivest:
Electronic Lottery Tickets as Micropayments.
Financial Cryptography 1997: 307-314 |
| 1996 |
|---|
| 101 | | Ronald L. Rivest,
Adi Shamir:
PayWord and MicroMint: Two Simple Micropayment Schemes.
Security Protocols Workshop 1996: 69-87 |
| 100 | | D. W. Gillman,
M. Mohtashemi,
Ronald L. Rivest:
On breaking a Huffman code.
IEEE Transactions on Information Theory 42(3): 972-976 (1996) |
| 1995 |
|---|
| 99 | EE | Ronald L. Rivest,
Yiqun Lisa Yin:
Being Taught can be Faster than Asking Questions.
COLT 1995: 144-151 |
| 98 | EE | Baruch Awerbuch,
Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).
COLT 1995: 321-328 |
| 97 | | David Gillman,
Ronald L. Rivest:
Complete Variable-Length ``Fix-Free'' Codes.
Des. Codes Cryptography 5(2): 109-114 (1995) |
| 96 | | Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Learning of an Unknown Environment.
Machine Learning 18(2-3): 231-254 (1995) |
| 1994 |
|---|
| 95 | | Ronald L. Rivest:
The RC5 Encryption Algorithm.
FSE 1994: 86-96 |
| 94 | | Ronald L. Rivest,
Robert H. Sloan:
A Formal Model of Hierarchical Concept Learning
Inf. Comput. 114(1): 88-114 (1994) |
| 93 | EE | Ronald L. Rivest,
Robert E. Schapire:
Diversity-Based Inference of Finite Automata.
J. ACM 41(3): 555-589 (1994) |
| 1993 |
|---|
| 92 | | Stephen Jose Hanson,
Werner Remmele,
Ronald L. Rivest:
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT
Springer 1993 |
| 91 | | Hideki Imai,
Ronald L. Rivest,
Tsutomu Matsumoto:
Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings
Springer 1993 |
| 90 | EE | Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Learning of an Unknown Environment.
COLT 1993: 277-286 |
| 89 | | Stephen Jose Hanson,
Werner Remmele,
Ronald L. Rivest:
Strategic Directions in Machine Learning.
Machine Learning: From Theory to Applications 1993: 1-4 |
| 88 | | Ronald L. Rivest,
Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences.
Machine Learning: From Theory to Applications 1993: 51-73 |
| 87 | | Ronald L. Rivest:
Introduction.
Machine Learning: From Theory to Applications 1993: 7-7 |
| 86 | | Avrim Blum,
Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete.
Machine Learning: From Theory to Applications 1993: 9-28 |
| 85 | | Igal Galperin,
Ronald L. Rivest:
Scapegoat Trees.
SODA 1993: 165-174 |
| 84 | | Dorothy E. Denning,
Mike Godwin,
William A. Bayse,
Marc Rotenberg,
Lewis M. Branscomb,
Anne M. Branscomb,
Ronald L. Rivest,
Andrew Grosso,
Gary T. Marx:
To Tap or not to Tap.
Commun. ACM 36(3): 24-44 (1993) |
| 83 | | Ronald L. Rivest,
Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences
Inf. Comput. 103(2): 299-347 (1993) |
| 82 | | Ronald L. Rivest,
Robert H. Sloan:
On Choosing between Experimenting and Thinking when Learning
Inf. Comput. 106(1): 1-25 (1993) |
| 81 | | Sally A. Goldman,
Ronald L. Rivest,
Robert E. Schapire:
Learning Binary Relations and Total Orders.
SIAM J. Comput. 22(5): 1006-1034 (1993) |
| 1992 |
|---|
| 80 | | Ronald L. Rivest,
Martin E. Hellman,
John C. Anderson,
John W. Lyons:
Responses to NIST's Proposal.
Commun. ACM 35(7): 41-54 (1992) |
| 79 | EE | Avrim Blum,
Ronald L. Rivest:
Training a 3-node neural network is NP-complete.
Neural Networks 5(1): 117-127 (1992) |
| 1991 |
|---|
| 78 | | Ronald L. Rivest:
Cryptography and Machine Learning.
ASIACRYPT 1991: 427-439 |
| 77 | | Ronald L. Rivest:
On NIST's Proposed Digital Signature Standard.
ASIACRYPT 1991: 481-484 |
| 76 | EE | Anthony Kuh,
Thomas Petsche,
Ronald L. Rivest:
Incrementally Learning Time-Varying Half Planes.
NIPS 1991: 920-927 |
| 75 | | Nathan Linial,
Yishay Mansour,
Ronald L. Rivest:
Results on Learnability and the Vapnik-Chervonenkis Dimension
Inf. Comput. 90(1): 33-49 (1991) |
| 1990 |
|---|
| 74 | EE | Bonnie Eisenberg,
Ronald L. Rivest:
On the Sample Complexity of PAC-Learning Using Random and Chosen Examples.
COLT 1990: 154-162 |
| 73 | EE | Javed A. Aslam,
Ronald L. Rivest:
Inferring Graphs from Walks.
COLT 1990: 359-370 |
| 72 | EE | Ronald L. Rivest:
The MD4 Message Digest Algorithm.
CRYPTO 1990: 303-311 |
| 71 | EE | Ronald L. Rivest:
Finding Four Million Large Random Primes.
CRYPTO 1990: 625-626 |
| 70 | EE | Anthony Kuh,
Thomas Petsche,
Ronald L. Rivest:
Learning Time-Varying Concepts.
NIPS 1990: 183-189 |
| 69 | | Ronald L. Rivest:
Cryptography.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 717-755 |
| 68 | | Michael Ben-Or,
Oded Goldreich,
Silvio Micali,
Ronald L. Rivest:
A fair protocol for signing contracts.
IEEE Transactions on Information Theory 36(1): 40-46 (1990) |
| 1989 |
|---|
| 67 | | Thomas H. Cormen,
Charles E. Leiserson,
Ronald L. Rivest:
Introduction to Algorithms
The MIT Press and McGraw-Hill Book Company 1989 |
| 66 | | Sally A. Goldman,
Ronald L. Rivest,
Robert E. Schapire:
Learning Binary Relations and Total Orders (Extended Abstract)
FOCS 1989: 46-51 |
| 65 | | Ronald L. Rivest,
Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences (Extended Abstract)
STOC 1989: 411-420 |
| 64 | | J. Ross Quinlan,
Ronald L. Rivest:
Inferring Decision Trees Using the Minimum Description Length Principle
Inf. Comput. 80(3): 227-248 (1989) |
| 1988 |
|---|
| 63 | | Ronald L. Rivest,
Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully.
AAAI 1988: 635-640 |
| 62 | EE | Nathan Linial,
Yishay Mansour,
Ronald L. Rivest:
Results on Learnability and the Vapnick-Chervonenkis Dimension.
COLT 1988: 56-68 |
| 61 | EE | Ronald L. Rivest,
Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully.
COLT 1988: 69-79 |
| 60 | EE | Avrim Blum,
Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete.
COLT 1988: 9-18 |
| 59 | | Nathan Linial,
Yishay Mansour,
Ronald L. Rivest:
Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)
FOCS 1988: 120-129 |
| 58 | EE | Avrim Blum,
Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete.
NIPS 1988: 494-501 |
| 57 | | Ronald L. Rivest,
Robert H. Sloan:
A New Model for Inductive Inference.
TARK 1988: 13-28 |
| 56 | | Benny Chor,
Ronald L. Rivest:
A knapsack-type public key cryptosystem based on arithmetic in finite fields.
IEEE Transactions on Information Theory 34(5): 901-909 (1988) |
| 55 | | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES).
J. Cryptology 1(1): 3-36 (1988) |
| 54 | | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.
SIAM J. Comput. 17(2): 281-308 (1988) |
| 1987 |
|---|
| 53 | | Ronald L. Rivest,
Robert E. Schapire:
Diversity-Based Inference of Finite Automata (Extended Abstract)
FOCS 1987: 78-87 |
| 52 | | Richard M. Karp,
Frank Thomson Leighton,
Ronald L. Rivest,
Clark D. Thompson,
Umesh V. Vazirani,
Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays.
Algorithmica 2: 113-129 (1987) |
| 51 | | Ronald L. Rivest:
Game Tree Searching by Min/Max Approximation.
Artif. Intell. 34(1): 77-96 (1987) |
| 50 | | Ronald L. Rivest:
Network control by Bayesian broadcast.
IEEE Transactions on Information Theory 33(3): 323-328 (1987) |
| 49 | | Ronald L. Rivest:
Learning Decision Lists.
Machine Learning 2(3): 229-246 (1987) |
| 1986 |
|---|
| 48 | EE | Sally A. Goldman,
Ronald L. Rivest:
A non-iterative maximum entropy algorithm.
UAI 1986: 133-148 |
| 47 | | Frank Thomson Leighton,
Ronald L. Rivest:
Estimating a probability using finite memory.
IEEE Transactions on Information Theory 32(6): 733-742 (1986) |
| 46 | EE | Benny Chor,
Charles E. Leiserson,
Ronald L. Rivest,
James B. Shearer:
An application of number theory to the organization of raster-graphics memory.
J. ACM 33(1): 86-104 (1986) |
| 1985 |
|---|
| 45 | EE | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).
CRYPTO 1985: 212-226 |
| 44 | EE | Ronald L. Rivest,
Adi Shamir:
Efficient Factoring Based on Partial Information.
EUROCRYPT 1985: 31-34 |
| 43 | EE | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is the Data Encryption Standard a Group? (Preliminary Abstract).
EUROCRYPT 1985: 81-95 |
| 42 | | Michael Ben-Or,
Oded Goldreich,
Silvio Micali,
Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract).
ICALP 1985: 43-52 |
| 1984 |
|---|
| 41 | EE | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A "Paradoxical'"Solution to the Signature Problem (Abstract).
CRYPTO 1984: 467 |
| 40 | EE | Benny Chor,
Ronald L. Rivest:
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields.
CRYPTO 1984: 54-65 |
| 39 | EE | Ronald L. Rivest:
RSA Chips (Past/Present/Future).
EUROCRYPT 1984: 159-165 |
| 38 | | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract)
FOCS 1984: 441-448 |
| 37 | | Ronald L. Rivest,
Adi Shamir:
How to Expose an Eavesdropper.
Commun. ACM 27(4): 393-395 (1984) |
| 1983 |
|---|
| 36 | | Frank Thomson Leighton,
Ronald L. Rivest:
Estimating a Probability Using Finite Memory (Extended Abstract).
FCT 1983: 255-269 |
| 35 | | Richard M. Karp,
Frank Thomson Leighton,
Ronald L. Rivest,
Clark D. Thompson,
Umesh V. Vazirani,
Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)
FOCS 1983: 453-459 |
| 34 | | Ronald L. Rivest,
Adi Shamir,
Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).
Commun. ACM 26(1): 96-99 (1983) |
| 1982 |
|---|
| 33 | | Ronald L. Rivest,
Alan T. Sherman:
Randomized Encryption Techniques.
CRYPTO 1982: 145-163 |
| 32 | | Ronald L. Rivest:
A Short Report on the RSA Chip.
CRYPTO 1982: 327 |
| 31 | | Benny Chor,
Charles E. Leiserson,
Ronald L. Rivest:
An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)
FOCS 1982: 92-99 |
| 30 | | Ronald L. Rivest,
Adi Shamir:
How to Reuse a ``Write-Once'' Memory (Preliminary Version)
STOC 1982: 105-113 |
| 29 | | Ronald L. Rivest,
Adi Shamir:
How to Reuse a ``Write-Once'' Memory
Information and Control 55(1-3): 1-19 (1982) |
| 1980 |
|---|
| 28 | | Andrea S. LaPaugh,
Ronald L. Rivest:
The Subgraph Homeomorphism Problem.
J. Comput. Syst. Sci. 20(2): 133-149 (1980) |
| 27 | | Ronald L. Rivest,
Albert R. Meyer,
Daniel J. Kleitman,
Karl Winklmann,
Joel Spencer:
Coping with Errors in Binary Search Procedures.
J. Comput. Syst. Sci. 20(3): 396-404 (1980) |
| 26 | | Andrew Chi-Chih Yao,
Ronald L. Rivest:
On the Polyhedral Decision Problem.
SIAM J. Comput. 9(2): 343-347 (1980) |
| 25 | | Brenda S. Baker,
Edward G. Coffman Jr.,
Ronald L. Rivest:
Orthogonal Packings in Two Dimensions.
SIAM J. Comput. 9(4): 846-855 (1980) |
| 1979 |
|---|
| 24 | | Ronald L. Rivest,
Jean-Paul Van de Wiele:
An Omega(n/lg n)1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials.
Inf. Process. Lett. 8(4): 178-180 (1979) |
| 1978 |
|---|
| 23 | | Ronald L. Rivest,
Albert R. Meyer,
Daniel J. Kleitman,
Karl Winklmann,
Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report)
STOC 1978: 227-232 |
| 22 | | Andrea S. LaPaugh,
Ronald L. Rivest:
The Subgraph Homeomorphism Problem
STOC 1978: 40-50 |
| 21 | | Ronald L. Rivest,
Adi Shamir,
Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Commun. ACM 21(2): 120-126 (1978) |
| 20 | EE | Ronald L. Rivest:
Optimal Arrangement of Keys in a Hash Table.
J. ACM 25(2): 200-209 (1978) |
| 19 | EE | Andrew Chi-Chih Yao,
Ronald L. Rivest:
k+1 Heads Are Better than k.
J. ACM 25(2): 337-340 (1978) |
| 1977 |
|---|
| 18 | | Andrew Chi-Chih Yao,
David Avis,
Ronald L. Rivest:
An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem
STOC 1977: 11-17 |
| 17 | | Ronald L. Rivest:
The Necessity of Feedback in Minimal Monotone Combinational Circuits.
IEEE Trans. Computers 26(6): 606-607 (1977) |
| 16 | | Ronald L. Rivest:
On the Worst-Case Behavior of String-Searching Algorithms.
SIAM J. Comput. 6(4): 669-674 (1977) |
| 1976 |
|---|
| 15 | | Ronald L. Rivest,
Vaughan R. Pratt:
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
FOCS 1976: 1-8 |
| 14 | | Andrew Chi-Chih Yao,
Ronald L. Rivest:
k+1 Heads Are Better than k
FOCS 1976: 67-70 |
| 13 | | Ronald L. Rivest:
On Self-Organizing Sequential Search Heuristics.
Commun. ACM 19(2): 63-67 (1976) |
| 12 | | Laurent Hyafil,
Ronald L. Rivest:
Constructing Optimal Binary Decision Trees is NP-Complete.
Inf. Process. Lett. 5(1): 15-17 (1976) |
| 11 | | Jon Doyle,
Ronald L. Rivest:
Linear Expected Time of a Simple Union-Find Algorithm.
Inf. Process. Lett. 5(5): 146-148 (1976) |
| 10 | | Ronald L. Rivest:
Partial-Match Retrieval Algorithms.
SIAM J. Comput. 5(1): 19-50 (1976) |
| 9 | | Ronald L. Rivest,
Jean Vuillemin:
On Recognizing Graph Properties from Adjacency Matrices.
Theor. Comput. Sci. 3(3): 371-384 (1976) |
| 1975 |
|---|
| 8 | | Ronald L. Rivest,
Jean Vuillemin:
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture
STOC 1975: 6-11 |
| 7 | | Robert W. Floyd,
Ronald L. Rivest:
Expected Time Bounds for Selection.
Commun. ACM 18(3): 165-172 (1975) |
| 6 | | Robert W. Floyd,
Ronald L. Rivest:
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489).
Commun. ACM 18(3): 173 (1975) |
| 1974 |
|---|
| 5 | | Ronald L. Rivest:
On Self-Organizing Sequential Search Heuristics
FOCS 1974: 122-126 |
| 4 | | Ronald L. Rivest:
On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)
FOCS 1974: 95-103 |
| 3 | | Ronald L. Rivest:
On the Optimality of Elia's Algorithm for Performing Best-Match Searches.
IFIP Congress 1974: 678-681 |
| 1973 |
|---|
| 2 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Time Bounds for Selection.
J. Comput. Syst. Sci. 7(4): 448-461 (1973) |
| 1972 |
|---|
| 1 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Linear Time Bounds for Median Computations
STOC 1972: 119-124 |
