href="http://theory.lcs.mit.edu/~rivest/Rivest-Cryptography.pdf">pdf</A> ; 
    <A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-Cryptography.txt">(note)</A> 
    </LI></UL>
  <P></P>
  <LI><EM>A Knapsack Type Cryptosystem Based on Arithmetic in Finite 
  Fields</EM><BR>by Benny Chor and Ronald L. Rivest.<BR>IEEE Trans. Information 
  Theory 34,5 (Sep. 1988), 901--909.<BR>(Also in CRYPTO 84.)<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/ChorRivest-AKnapsackTypePublicKeyCryptosystemBasedOnArithmeticInFiniteFields.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/ChorRivest-AKnapsackTypePublicKeyCryptosystemBasedOnArithmeticInFiniteFields.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Is the Data Encryption Standard A Group?</EM><BR>by Burton S. Kaliski, 
  Ronald L. Rivest, and Alan T. Sherman.<BR>Journal of Cryptology 1,1 
  (1988),3--36. <BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/KaliskiRivestSherman-IsTheDataEncryptionStandardAGroup.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>A Digital Signature Scheme Secure Against Adaptive Chosen Message 
  Attacks</EM><BR>by Shafi Goldwasser, Silvio Micali, and Ronald L. 
  Rivest.<BR><EM>SIAM J. Computing</EM> 17,2 (April 1988), 281--308.<BR>(Note: 
  This does not include the figures that were published with the paper.) 
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.pdf">pdf</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.dvi">dvi</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Efficient Factoring Based on Partial Information</EM><BR>by Ronald L. 
  Rivest and Adi Shamir<BR><EM>Proceedings EUROCRYPT '85</EM>, LNCS 219, ed. F. 
  Pichler (Springer), 31--34. 
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/RivestShamir-EfficientFactoringBasedOnPartialInformation.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Mental Poker</EM><BR>by Adi Shamir, Ronald L. Rivest, and Leonard M. 
  Adleman.<BR>in <EM>The Mathematical Gardner</EM> (ed. David A. Klarner), 
  (Prindle, Weber, and Schmidt, 1981), pages 37-43.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/ShamirRivestAdleman-MentalPoker.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Testing Implementations of DES</EM><BR>by Ronald L. 
  Rivest<BR>(Unpublished, 2/85)<BR>
  <UL>
    <LI><A href="http://theory.lcs.mit.edu/~rivest/destest.txt">text</A> 
</LI></UL>
  <P></P>
  <LI><EM>Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key 
  Cryptosystem</EM><BR><EM>Cryptologia</EM> 2,1 (January 1978), 62--65.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-RemarksOnAProposedCryptanalyticAttackOnTheMITPublicKeyCryptosystem.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>A Method for Obtaining Digital Signatures and Public-Key 
  Cryptosystems</EM><BR>by Ronald L. Rivest, Adi Shamir, and Leonard M. 
  Adleman.<BR><EM>Communications of the ACM</EM> 21,2 (Feb. 1978), 120--126.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/RivestShamirAdleman-AMethodForObtainingDigitalSignaturesAndPublicKeyCryptosystems.pdf">pdf</A> 
    </LI></UL>
  <P></P></LI></UL>
<H2>Algorithms</H2>
<UL>
  <LI><A href="http://theory.lcs.mit.edu/~clr/">Introduction to Algorithms</A> 
  (Second Edition)<BR>by Cormen, Leiserson, Rivest, and Stein (MIT Press and 
  McGraw-Hill, 2001). 
  <P></P>
  <LI><EM>Optimal Arrangements of Keys in a Hash Table</EM><BR>by Ronald L. 
  Rivest.<BR><EM>Journal of the ACM <BF>25</BF>,2</EM> April 1978, 200--209.<BF> 

  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-OptimalArrangementOfKeysInAHashTable.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Partial-Match Retrieval Algorithms</EM><BR>by Ronald L. 
  Rivest.<BR><EM>Siam J. Computing <BF>5</BF>,1</EM> March 1976, 19--50.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-PartialMatchRetrievalAlgorithms.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Time Bounds for Selection</EM> by Manual Blum, Robert W. Floyd, 
  Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan.<BR><EM>Journal of 
  Computer and System Sciences <BF>7</BF>,4</EM> August 1973, 448-460.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/BlumFloydPrattRivestTarjan-TimeBoundsForSelection.pdf">pdf</A> 
    </LI></UL>
  <P></P></LI></UL>
<H2>Machine Learning</H2>
<UL>
  <LI><EM>Piecemeal Graph Exploration by a Mobile Robot</EM><BR>by Baruch 
  Awerbuch, Margrit Betke, Ronald L. Rivest, and Mona Singh.<BR><EM>Information 
  and Computation</EM> 152,2 (August 1999), 155--172. 
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/AwerbuchBetkeRivestSingh-PiecemealGraphExplorationByAMobileRobot.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/AwerbuchBetkeRivestSingh-PiecemealGraphExplorationByAMobileRobot.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Piecemeal Learning of an Unknown Environment</EM><BR>by Margrit Betke, 
  Ronald L. Rivest, and Mona Singh. <EM>Machine Learning</EM> 18:2-3 (February 
  1995), 231--254. 
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/BetkeRivestSingh-PiecemealLearningOfAnUnknownEnvironment.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/BetkeRivestSingh-PiecemealLearningOfAnUnknownEnvironment.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Being Taught Can be Faster than Asking Questions</EM><BR>by Ronald L. 
  Rivest and Yiqun Lisa Yin<BR>Proceedings 1995 COLT Conference (ACM, 1995), 
  144-151.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/RivestYin-BeingTaught.pdf">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/RivestYin-BeingTaught.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Picking the Best Expert from a Sequence</EM><BR>by Ruth Bergman and 
  Ronald L. Rivest.<BR>Proceedings of the Fifth International Workshop on 
  Artificial Intelligence and Statistics, (Fort Lauerdale FL, January 1995). 
  219--228.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/BergmanRivest-PickingTheBestExpertFromASequence.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/BergmanRivest-PickingTheBestExpertFromASequence.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Learning Binary Relations and Total Orders</EM><BR>by Sally A. 
  Goldman, Ronald L. Rivest, and Robert E. Schapire.<BR><EM>SIAM J. 
  Computing</EM> 22,5 (October 1993), 1006-1034.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/GoldmanRivestSchapire-LearningBinaryRelationsAndTotalOrders.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GoldmanRivestSchapire-LearningBinaryRelationsAndTotalOrders.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Diversity-Based Inference of Finite Automata</EM><BR>by Ronald L. 
  Rivest and Robert E. Schapire.<BR><EM>Journal of the ACM</EM> 41, 3 (May 
  1994), 555--589.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/RivestSchapire-DiversityBasedInferenceOfFiniteAutomata.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/RivestSchapire-DiversityBasedInferenceOfFiniteAutomata.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Inference of Finite Automata Using Homing Sequences</EM><BR>by Ronald 
  L. Rivest and Robert E. Schapire.<BR><EM>Information and Computation</EM> 
  103,2 (April 1993), 299--347.<BR><!-- Where are the files for this??<ul>    <li><a href="RivestSchapire-InferenceOfFiniteAutomataUsingHomingSequences.ps">postscript</a>        or <a href="RivestSchapire-InferenceOfFiniteAutomataUsingHomingSequences.pdf">pdf</a></ul>-->
  <P></P>
  <LI><EM>Making Maximum Entropy Constraints Easier By Adding Extra Constraints 
  (Extended Abstract)</EM><BR>by Sally Goldman and Ronald L. Rivest.<BR>in 
  <EM>Maximum--Entropy and Bayesian Methods in Science and Engineering (Vol. 
  2)</EM>, (Edited by G.J. Erickson and C.R. Smith) (Kluwer Academic Publishers, 
  1988), 323--340.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/GoldmanRivest-MakingMaximumEntropyComputationsEasierByAddingExtraConstraints.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GoldmanRivest-MakingMaximumEntropyComputationsEasierByAddingExtraConstraints.pdf">pdf</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GoldmanRivest-MakingMaximumEntropyComputationsEasierByAddingExtraConstraints.dvi">dvi</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Learning Decision Lists</EM><BR>by Ronald L. Rivest.<BR><EM>Machine 
  Learning</EM> 2,3 (1987), 229--246.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-DecisionLists.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-DecisionLists.pdf">pdf</A> 
    </LI></UL>
  <P></P></LI></UL>
<H2>Miscellaneous</H2>
<UL>
  <LI><EM>Recollections of Stanford CS 1969--1973</EM><BR>by Ronald L. 
  Rivest.<BR>Talk given March 21, 2006 at Stanford Computer Science Forum 
  meeting celebrating the 40th anniverssary of the Stanford CS Department.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-RecollectionsOfStanfordCS1969-1973.ppt">ppt 
    slides</A> </LI></UL>
  <P></P>
  <LI><EM>Complete Variable-Length `FixFree' Codes</EM><BR>by David Gillman and 
  Ronald L. Rivest.<BR><EM>Designs, Codes, and Cryptography</EM> 5,2 (March 
  1995), 109--114.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/GillmanRivest-CompleteVariableLengthFixFreeCodes.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/GillmanRivest-CompleteVariableLengthFixFreeCodes.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Game Tree Searching by Min/Max Approximation</EM><BR>by Ronald L. 
  Rivest.<BR><EM>Artificial Intelligence</EM> 34,1 (Dec. 1987), 77-96.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-GameTreeSearchingByMinMaxApproximation.ps">postscript</A> 
    or <A 
    href="http://theory.lcs.mit.edu/~rivest/Rivest-GameTreeSearchingByMinMaxApproximation.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>How to Reuse a "Write-Once" Memory</EM><BR>by Ronald L. Rivest and Adi 
  Shamir.<BR><EM>Information and Control</EM> 55,1-3 (October/November/December 
  1982), 1--19.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/RivestShamir-HowToReuseAWriteOnceMemory.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Minimum Edge-Length Decomposition of Rectilinear Polygons</EM><BR>by 
  A. Lingas, R. Y. Pinter, R. L. Rivest, and A. Shamir.<BR><EM>Proc. 1982 
  Allerton Conference on Communications, Control, and Computing<EM> (Oct. 1982), 
  53-63.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/LingasPinterRivestShamir-MinimumEdgeLengthDecompositionOfRectilinearPolygons.pdf">pdf</A> 
    </LI></UL>
  <P></P>
  <LI><EM>Constructing Optimal Binary Decision Trees is NP-Complete</EM><BR>by 
  Laurent Hyafil and Ronald L. Rivest.<BR><EM>Information Processing 
  Letters</EM> 5,1 (May 1976), 15--17.<BR>
  <UL>
    <LI><A 
    href="http://theory.lcs.mit.edu/~rivest/HyafilRivest-ConstructingOptimalBinaryDecisionTreesIsNPComplete.pdf">pdf</A> 
    </LI></UL></LI></UL>Return to <A 
href="http://theory.lcs.mit.edu/~rivest/homepage.html">Ron Rivest's home 
page.</A> </EM></EM></BODY></HTML>