\def \rf #1#2{\smallskip\noindent
\hangindent 6em \hbox to 2em{\hfil }\hbox to 4em{{\bf #1}\hfil}#2\par}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\no{1.\ Books}
\rf{1.}{Rivest, R.\ L., A.\ Sherman, and D.\ Chaum (editors),
{\sl Proceedings CRYPTO 82}. New York: Plenum Press (1983).}
\rf{2.}{Rivest, Ronald, David Haussler, and Manfred K. Warmuth (editors),
{\sl Proceedings of the Second Annual Workshop on Computational Learning
Theory} (Morgan Kaufmann, 1989).}
\rf{3.}{Cormen, T., C.E. Leiserson, and R.L. Rivest,
{\sl Introduction to Algorithms} (MIT Press/McGraw-Hill, 1990).}
\rf{4.}{Hanson, G., G. Drastal, and R.L. Rivest (editors),
{\sl Computational Learning and Natural Learning},
(MIT Press, 1991).}
\rf{5.}{Meyer, A., J. Guttag, R.L. Rivest, and P. Szolovits (editors),
{\sl Research Directions in Computer Science: An {MIT} Perspective},
(MIT Press, 1991).}
\rf{6.}{Hanson, S.J., W. Remmele, and R.L. Rivest (editors),
{\sl Machine Learning: From Theory to Applications},
Lecture Notes in Computer Science No. 661,
(Springer-Verlag, 1993).}
\rf{7.}{Hanson, S.J., G.A. Drastal, and R.L. Rivest (editors),
{\sl Computational Learning Theory and Natural Learning systems},
Volume I: Constraints and Prospects,
(MIT Press, 1994).}
\rf{8.}{Hanson, S.J., T. Petsche, M. Kearns, and R.L. Rivest (editors),
{\sl Computational Learning Theory and Natural Learning systems},
Volume II: Intersections between Theory and Experiment,
(MIT Press, 1994).}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\no{2.\ Papers in Refereed Journals}
\def\CanJMath{{\sl Canadian Journal of Math.\ }}
\def\CACM{{\sl Communications of the ACM }}
\def\CompRev{{\sl Computing Reviews }}
\def\DisMath{{\sl Discrete Math.\ }}
\def\InfoCon{{\sl Information and Control }}
\def\IPL{{\sl Information Processing Letters }}
\def\JACM{{\sl Journal of the ACM }}
\def\JCSS{{\sl JCSS }}
\def\SIAM{{\sl SIAM J. Computing }}
\def\TCS{{\sl Theoretical Computer Science }}
\rf{1.}{Rivest, R. L., and D. E. Knuth,
``Computer Sorting,''
Bibliography No.\ 26, \CompRev {\bf 13}
(June 1972), 283-289.}
\rf{2.}{Klarner, D. A., and R. L. Rivest,
``A procedure for improving the upper bound for the number of N-ominoes,''
\CanJMath {\bf 25} (June 1973), 585-602.}
\rf{3.}{Blum, M., R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan,
``Time bounds for selection,''
\JCSS {\bf 7} (August 1973), 448-461.}
\rf{4.}{Klarner, D. A., and R. L. Rivest,
``Asymptotic bounds for the number of convex N-ominoes,''
\DisMath {\bf 8} (March 1974), 31-40.}
\rf{5.}{Rivest, R. L., and R. W. Floyd,
``Algorithm 489 - Select: for finding the $i$th smallest of $n$ elements,''
\CACM {\bf 18} (March 1975), 173.}
\rf{6.}{Floyd, R. W., and R. L. Rivest,
``Expected time bounds for selection,''
\CACM {\bf 18} (March 1975), 165-172.}
\rf{7.}{Rivest, R. L.,
``On self-organizing sequential search heuristics,''
\CACM {\bf 19} (February 1976), 63-67. }
\rf{8.}{Rivest, R. L.,
``Partial match retrieval algorithms,''
\SIAM {\bf 5} (March 1976), 19-50.}
\rf{9.}{Hyafil, L., and R. L. Rivest,
``Constructing optimal binary decision trees is NP-complete,''
\IPL {\bf 5} (May 1976), 15-17.}
\rf{10.}{Doyle, J., and R. L. Rivest,
``Linear expected time of a simple union-find algorithm,''
\IPL {\bf 5} (November 1976), 146-148.}
\rf{11.}{Rivest, R. L., and J. Vuillemin,
``On recognizing graph properties from adjacency matrices,''
\TCS {\bf 3} (December 1976), 371-384.}
\rf{12.}{Rivest, R. L., and J. Vuillemin,
``On the time required to recognize properties of graphs from their
adjacency matrices,''
{\sl Societe Mathematique de France Asterisque } {\bf 38--39} (1976), 213-227.}
\rf{13.}{Rivest, R. L.,
``The necessity of feedback in minimal monotone combinational circuits,''
{\sl IEEE Trans.\ Computers } {\bf C--26}(June 1977), 606-607.}
\rf{14.}{Rivest, R. L.,
``On the worst-case behavior of string-searching algorithms,''
\SIAM {\bf 6} (December 1977), 669-674.}
\rf{15.}{Rivest, R. L.,
``The game of N questions on a tree,''
\DisMath {\bf 17} (February 1977), 181-186. }
\rf{16.}{Rivest, R. L., A. Shamir, and L. Adleman,
``A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,
\CACM {\bf 21} (February 1978), 120-126. }
\rf{17.}{Yao, A., and R. L. Rivest,
``K+1 heads are better than K,''
\JACM {\bf 25} (April 1978) 337-340.}
\rf{18.}{Rivest, R. L.,
``Optimal arrangement of keys in a hash table,''
\JACM {\bf 25} (April 1978) 200-210.}
\rf{19.}{Rivest, R. L., and J. Van de Wiele,
``An $O((n/lg n)^2)$ Lower Bound on the Number of Additions Necessary
to Compute $0-1$ Polynomials over the Ring of Integer Polynomials,''
\IPL {\bf 8} (April 1979), 178-180.}
\rf{20.}{Yao, A. C., and R. L. Rivest,
``On the Polyhedral Decision Problem,''
\SIAM (May 1980), 343-347.}
\rf{21.}{Baker, B. S., E. G. Coffman, and R. L. Rivest,
``Orthogonal Packings in Two Dimensions,''
\SIAM (November 1980), 846-855.}
\rf{22.}{Rivest, R. L.,
``Critical Remarks on `Some Critical Remarks on Public-Key Cryptosystems'
by Herlestam,''
{\sl BIT } {\bf 19} (1979), 274-275.}
\rf{23.}{LaPaugh, A., and R. L. Rivest,
``The Subgraph Homeomorphism Problem,''
\JCSS {\bf 20} (April 1980), 133-149.}
\rf{24.}{Rivest, R. L., A. Meyer, J. Spencer, D. Kleitman, and K. Winklmann,
``Coping with Errors in Binary Search Procedures,''
\JCSS {\bf 20} (June 1980), 396-404.}
\rf{25.}{Rivest, R. L.,
``A Description of a Single-Chip Implementation of the RSA Cipher,''
{\sl Lambda } {\bf 1} (Fourth Quarter 1980), 14-18.}
\rf{26.}{Rivest, R. L., and A. Shamir,
``How to Reuse a `Write-Once' Memory,''
\InfoCon {\bf 55} (October-December 1982), 1-19.}
\rf{27.}{Rivest, R. L., and C. M. Fiduccia,
``A `Greedy' Channel Router,''
{\sl Computer-Aided Design } {\bf 15} (May 1983), 135-140.}
\rf{28.}{Rivest, R. L., and A. Shamir,
``How to Expose an Eavesdropper,''
\CACM {\bf 27}(April 1984), 393-395.}
\rf{29.}{Chor, B., C. E. Leiserson, R. L. Rivest, and J. Shearer,
``An Application of Number Theory to the Organization of Raster Graphics,''
\JACM {\bf 33}, 1 (Jan.\ 1986), 86--104.}
\rf{30.}{Leighton, F. T., and R. L. Rivest,
``Estimating a Probability using Finite Memory,''
{\sl IEEE Trans.\ Inform.\ Theory\/}, {\bf IT-32},6 (November 1986),
733--742.}
\rf{31.}{Rivest, R. L.,
``Network Control by Bayesian Broadcast,''
{\sl IEEE Trans.\ Inform.\ Theory\/} {\bf IT-33},3 (May 1987),
323--340.}
\rf{32.}{Karp, R. M., F. T. Leighton, R. L. Rivest, C. D. Thompson, U.
Vazirani, and V. Vazirani,
``Global Wire Routing in Two-Dimensional Arrays,''
{\sl Algorithmica\/} {\bf 2} (1987), 113--129.}
\rf{33.}{Goldwasser, S., S. Micali, and R. L. Rivest,
``A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks,''
{\sl SIAM J. Computing\/} {\bf 17},2 (April 1988), 281--308.}
\rf{34.}{Rivest, R. L.,
``Game Tree Searching By Min/Max Approximation,''
{\sl Artificial Intelligence\/} {\bf 34},1 (Dec.\ 1987), 77--96.}
\rf{35.}{Rivest, R. L.,
``Learning Decision Lists,''
{\sl Machine Learning\/} {\bf 2},3 (1987), 229--246.}
\rf{36.}{Chor, B., and R. L. Rivest,
``A Knapsack-Type Public-Key Cryptosystem Based on Arithmetic
in Finite Fields,''
{\sl IEEE Transactions on Information Theory}, {\bf 34},5
(September 1988), 901--909.}
\rf{37.}{Quinlan, J. Ross, and R. L. Rivest,
``Inferring Decision Trees Using the Minimum Description Length Principle''
{\sl Information and Computation},
{\bf 80},3 (March 1989), 227--248.}
\rf{38.}{Kaliski, Burton S., Ronald L. Rivest, and Alan T. Sherman,
``Is the Data Encryption Standard a Group?,''
{\sl Journal of Cryptology},
{\bf 1},1 (1988), 3--36.}
\rf{39.}{Ben-Or, Michael, Oded Goldreich, Silvio Micali, and
Ronald L. Rivest,
``A Fair Protocol for Signing Contracts,''
{\sl IEEE Transactions on Information Theory},
{\bf 36},1 (1990), 40--46.}
\rf{40.}{Linial, Nathan, Yishay Mansour, and Ronald L. Rivest,
``Results on Learnability and the {V}apnik-{C}hervonenkis dimension,''
{\sl Information and Computation},
{\bf 90},1 (Jan. 1991), 33--49}.
\rf{41.}{Rivest, R. L.,
``Response to NIST's Proposal,''
{\sl Communications of the ACM},
{\bf 35},7 (July 1992), 41--47.
}
\rf{42.}{Rivest, Ronald L., and Robert E. Schapire,
``Inference of Finite Automata Using Homing Sequences,''
{\sl Information and Computation}
{\bf 103},2 (April 1993), 299--347}
\rf{43.}{Rivest, Ronald L., and Robert H. Sloan,
``On Choosing between Experimenting and Thinking when Learning,''
{\sl Information and Computation},
{\bf 106},1 (September 1993), 1--25.
}
\rf{44.}{Goldman, Sally A., Ronald L. Rivest, and Robert E. Schapire,
``Learning Binary Relations and Total Orders,''
{\sl SIAM J. Computing} {\bf 22},5 (October 1993), 1006--1034.
}
\rf{45.}{Rivest, Ronald L., and Robert E. Schapire,
``Diversity-Based Inference of Finite Automata,''
{\sl Journal of the ACM},
{\bf 41}, 3 (May 1994), 555--589.
}
\rf{46.}{Rivest, Ronald L., and Robert Sloan,
``A Formal Model of Hierarchical Concept Learning,''
{\sl Information and Computation}
{\bf 114},1 (October 1994), 88-114.
}
\rf{47.}{Betke, Margrit, Ronald L. Rivest, and Mona Singh,
``Piecemeal learning of an unknown environment,''
{\sl Machine Learning} {\bf 18},2/3 (February/March 1995), 231--254.}
\rf{48.}{Gillman, David, and Ronald L. Rivest,
``Complete Variable-Length `Fix-Free' Codes,''
{\sl Designs, Codes, and Cryptography}
{\bf 5},2 (March 1995), 109--114.
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\no{3. Papers in Refereed Conferences}
\rf{1.}{Rivest, R. L.,
``On the optimality of Elias's algorithm for performing
best-match searches,''
{\sl Proc.\ IFIP Conference } (Stockholm: 1974), 678-681.}
\rf{2.}{Rivest, R. L.,
``On hash-coding algorithms for partial-match retrieval,''
{\sl Proc.\ 15th IEEE SWAT Conference }
(New Orleans: October 1974), 95-103.}
\rf{3.}{Rivest, R. L., and J. Vuillemin,
``A generalization and proof of the Aanderaa-Rosenberg conjecture,''
{\sl Proc.\ 7th ACM SIGACT Conference }
(Albuquerque New Mexico: May 1975), 6-11.}
\rf{4.}{Rivest, R. L., and V. Pratt,
``The mutual exclusion problem for unreliable processes,''
{\sl Proc.\ 17th IEEE FOCS Conference }
(Houston Texas: October 1976), 1-8.}
\rf{5.}{Yao, A., D. Avis, and R. L. Rivest,
``An $\Omega(n^2 \hbox{log} n)$ lower bound to the shortest paths problem,''
{\sl Proc.\ 9th ACM SIGACT Conference }
(Boulder Colorado: May l977), 11-l7.}
\rf{6.}{LaPaugh, A., and R. L. Rivest,
``The subgraph homeomorphism problem,''
{\sl Proc.\ 10th ACM SIGACT Conference }
(San Diego California: May 1978), 40-51.}
\rf{7.}{Rivest, R. L., A. R. Meyer, D. J. Kleitman, K. Winklmann, and J.
Spencer,
``Coping with Errors in Binary Search Procedures,''
{\sl Proc.\ 10th ACM SIGACT Conference }
(San Diego California: May 1978), 227-233.}
\rf{8.}{Rivest, R. L., A. E. Baratz, and G. Miller,
``Provably Good Channel-Routing Algorithms,''
{\sl Proc.\ CMU Conference on VLSI Systems and Computations }
(Computer Science Press 1981), 153-159.}
\rf{9.}{Brown, D., and R. L. Rivest,
``New Lower Bounds on Channel Width'',
{\sl Proc.\ CMU Conference on VLSI Systems and Computations }
(Computer Science Press 1981) 178-185.}
\rf{10.}{Rivest, R. L.,
``The MIT ``PI'' Placement and Interconnect System,''
{\sl Proc.\ 19th IEEE Design Automation Conference }
(Las Vegas: June 1982), 475-481.}
\rf{11.}{Rivest, R. L., and C. M. Fiduccia,
``A `Greedy' Channel Router,''
{\sl Proc.\ 19th IEEE Design Automation Conference }
(Las Vegas: June 1982), 418-424.}
\rf{12.}{Chor, B., C. E. Leiserson, and R. L. Rivest,
``An Application of Number Theory to the Organization of Raster Graphics,''
{\sl Proc.\ 23rd IEEE FOCS Conference }
(Chicago, 1982), 92-99.}
\rf{13.}{Karp, R. M., F. T. Leighton, R. L. Rivest, C. D. Thompson, U.
Vazirani, and V. Vazirani,
``Global Wire Routing in Two-Dimensional Arrays,''
{\sl Proc.\ 24th IEEE FOCS Conference }
(Tucson, 1983), 453-459.}
\rf{14.}{Goldwasswer, Shafi, Silvio Micali, and Ronald L. Rivest,
``A `Paradoxical' Solution to the Signature Problem,''
{\sl Proc.\ 25th IEEE FOCS Conference }
(Singer Island, 1984), 441-448. }
\rf{15.}{Rivest, R. L., and R. Schapire,
``Diversity-Based Inference of Finite Automata,''
{\sl Proc.\ 28th IEEE FOCS Conference }
(Los Angeles, 1987), 78--87.}
\rf{16.}{Rivest, R. L., and R. Schapire,
``A New Approach to Unsupervised Learning in Deterministic Environments'',
{\sl Proc. Fourth Intl. Workshop on Machine Learning}
(Irvine, California, June 1987), 364--375.}
\rf{17.}{Rivest, R. L., and R. H. Sloan,
``A New Model for Inductive Inference'',
{\sl Proc. Second Annual Theoretical Aspects of Reasoning about Knowledge Conference},
Morgan Kaufmann (Asilomar, March 1988), 13--27.}
\rf{18.}{Rivest, R. L,, and R. H. Sloan,
``Learning Complicated Concepts Reliably and Usefully,''
{\sl Proc. AAAI-88} (Aug. 1988), 635--639.}
\rf{19.}{Linial, N., Y. Mansour, and R. L. Rivest,
``Results on Learnability and the Vapnik-Chervonenkis Dimension,''
{\sl Proc. 29th IEEE FOCS Conference}
(1988), 120--129.}
\rf{20.}{Rivest, R.L., and R. Schapire,
``Inference of Finite Automata Using Homing Sequences,''
{\sl Proc. 21st Annual STOC Conference},
(May 1989), 411--420.}
\rf{21.}{Goldman, S., R. L. Rivest, and R. E. Schapire,
``Learning Binary Relations and Total Orders,''
{\sl Proc. 30th IEEE FOCS Conference},
(Oct. 1989), 46--51.}
\rf{22.}{Rivest, R. L.,
``Finding Four Million Large Random Primes,''
{\sl Proc. CRYPTO 90},
(Springer 1991), 625--626.}
\rf{23.}{Rivest, R. L.,
``Cryptography and Machine Learning,''
{\sl Proc. ASIACRYPT '91},
(Springer 1993), 427--439.}
\rf{24.}{Galperin, I. and R. L. Rivest,
``Scapegoat Trees,''
{\sl Proceedings SODA '93} (Jan. 1993), 165--174.}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\no{4. Other Major Publications}
\rf{1.}{Rivest, R. L., A. R. Meyer, D. J. Kleitman, and J. Spencer,
``Binary search using unreliable comparisons,''
{\sl Proc.\ l5th Allerton Conference on Communication, Control,
and Computing }
(Monticello Illinois: September 1977), 165-168.}
\rf{2.}{Rivest, R. L., L. Adleman, and M. L. Dertouzos,
``On data banks and privacy homomorphisms,''
Foundations of Secure Computation
(edited by R. DeMillo, D. Dobkin, A. Jones, and R. Lipton)
(New York: Academic Press, 1978), 169-180.}
\rf{3.}{Rivest, R. L.,
``The Impact of Technology on Cryptography,''
{\sl Proc.\ 1978 International Communications Conference }
(Toronto Canada: June 1978).}
\rf{4.}{Rivest, R. L.,
``Remarks on a Proposed Cryptanalytic Attack of the M.I.T. Public-Key
Cryptosystem,''
{\sl Cryptologia } {\bf 2}(January 1978), 62-65.}
\rf{5.}{Adleman, L., and R. L. Rivest,
``The Use of Public-Key Cryptography in Communications System Design,''
{\sl Proc.\ National Communications Conference }
(Birmingham Alabama: December 1978).
Reprinted in
{\sl IEEE Communications Society Magazine } {\bf 16} (November 1978), 20-23.}
\rf{6.}{Baker, B. S., E. G. Coffman, and R. L. Rivest,
``Orthogonal Packings in Two Dimensions,''
{\sl Proc.\ 16th Allerton Conference on Communications, Control,
and Computing }
(Monticello Illinois: October 1978). }
\rf{7.}{Rivest, R. L.,
``Statistical Analysis of the Hagelin Cryptograph,''
{\sl Cryptologia } {\bf 5}(January 1981), 27-32.}
\rf{8.}{Rivest, R. L.,
``Forwards and Backwards Encryption,''
{\sl Cryptologia } {\bf 4} (January 1980) 30-33.}
\rf{10.}{R. L. Rivest,
``The BLIZZARD Computer Architecture,''
{\sl ACM Computer Architecture News } {\bf 7} (August 1980) 2-10.}
\rf{11.}{Lingas, A., R. Y. Pinter, R. L. Rivest, and A. Shamir,
``Minimum Edge-Length Decomposition of Rectilinear Polygons''
{\sl Proc.\ 1982 Allerton Conference on Communications, Control,
and Computing } (Oct.\ 1982), 53-63.}
\rf{12.}{Rivest, R. L., and Alan Sherman,
``Randomized Encryption Techniques,''
{\sl Proc.\ CRYPTO 82 } (Plenum Press, 1983), 145-163.}
\rf{13.}{Rivest, Ronald L.,
``A Short Report on the RSA Chip'',
{\sl Proc.\ CRYPTO 82 } (Plenum Press, 1983), 327.}
\rf{14.}{Rivest, Ronald L.,
``Data Encryption,''
Encyclopedia of Computer Science and Engineering,
(Van Nostrand Reinhold, 1983), 470-471.}
\rf{15.}{Bentley, Jon L., Charles E. Leiserson,
Ronald L. Rivest, and Christopher J. Van Wyck,
``Counting Chordal Intersections,''
{\sl Journal of Algorithms } {\bf 5} (March 1984), 146, and
{\bf 5} (December 1984), 592-594.}
\rf{16.}
{Rivest, Ronald L.,
``RSA Chips (Past -- Present -- Future),''
{\sl Advances in Cryptology --
Proc.\ 1984 EUROCRYPT Conference --
Lecture Notes in Computer Science }, {\bf 209},
(Springer 1985), 159--165.}
\rf{17.}{Chor, B., and R. L. Rivest,
``A Knapsack-Type Public-Key Cryptosystem Based on Arithmetic
in Finite Fields,''
{\sl Proc.\ CRYPTO 84 } (Springer 1985), 54 - 65.}
\rf{18.}{Goldwasser, Shafi, Silvio Micali, and Ronald L. Rivest,
``A `Paradoxical' Solution to the Signature Problem,''
(Brief abstract) {\sl Proc.\ CRYPTO 84 } (Springer 1985), 467.}
\rf{19.}{Kaliski, Burton S., Ronald L. Rivest, and Alan T. Sherman,
``Is the Data Encryption Standard a Group?,''
{\sl Proc.\ 1985 EUROCRYPT Conference }
(Springer 1985), 81--95.}
\rf{20.}{Rivest, Ronald L., and Adi Shamir,
``Efficient Factoring Based on Partial Information,''
{\sl Proc.\ 1985 EUROCRYPT Conference }
(Springer 1985), 31--34.}
\rf{21.}{Kaliski, Burton S., Ronald L. Rivest, and Alan T. Sherman,
``Is DES a Pure Cipher? (Results of More Cycling Experiments on DES),''
{\sl Proc.\ CRYPTO 85 } (Springer 1985), 212--226.}
\rf{22.}{Ben-Or, Michael, Oded Goldreich, Silvio Micali, and Ronald L. Rivest,
``A Fair Protocol for Signing Contracts,''
{\sl Proc.\ ICALP Conference } (1985), 43-52.}
\rf{23.}{Goldwasser, S., S. Micali, and R. L. Rivest,
``A Digital Signature Scheme Secure Against
Adaptive Chosen Message Attack (Extended Abstract)'',
in {\sl Discrete Algorithms and Complexity:
Proceedings of the Japan-US Joint Seminar\/},
(Edited by D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf)
(Academic Press, 1987), 298--310.}
\rf{24.}{Goldman, S. A., and R. L. Rivest,
``Making Maximum Entropy Computations Easier by Adding Extra Constraints
(Extended Abstract),''
in {\sl Maximum--Entropy and Bayesian Methods in Science and Engineering
(Vol. 2)}, (Edited by G.J. Erickson and C.R. Smith) (Kluwer Academic
Publishers, 1988), 323--340.}
\rf{25.}{Goldman, S. A., and R. L. Rivest,
``A Non--Iterative Maximum Entropy Algorithm,''
in {\sl Uncertainty in Artificial Intelligence 2}, (Edited by J.F. Lemmer
and L.N. Kanal) (Elsevier Science Publishers B.V. North--Holland, 1988),
133--148.}
\rf{26.}{Rivest, R. L., and R. Schapire,
``A New Approach to Unsupervised Learning in Deterministic Environments,''
{\sl Proc.\ 1987 Machine Learning Workshop}
(Morgan Kaufmann, 1987), 364--375.
(Also reprinted in {\it Machine Learning, An Artificial Intelligence
Approach} (ed. Y. Kodratoff and R. S. Michalski).)}
\rf{27.}{Rivest, R. L., and W. Remmele,
``Machine Learning: The Human Connection,''
{\sl Siemens Review} (February 1988), 33--37.}
\rf{28.}{Blum, A., and R. L. Rivest,
``Training a 3-Node Neural Network is NP-Complete,''
{\it Proceedings of the 1988 Workshop on Computational Learning Theory},
(Morgan Kaufmann 1989), 9--18.}
\rf{29.}{Blum, A., and R. L. Rivest,
``Training a 3-Node Neural Network is NP-Complete,''
{\it Proceedings of the 1988 IEEE Conference on Neural Information
Processing Systems -- Natural and Synthetic; Advances in Neural
Information Processing Systems I},
Morgan Kaufmann (Denver 1988), 494--501.}
\rf{30.}{Aslam, J., and R. L. Rivest,
``Inferring Graphs from Walks,''
{\it Proceedings 1990 COLT Conference},
Morgan-Kaufmann (1990), 359--370.}
\rf{31.}{Eisenberg, B., and R. L. Rivest,
``On the Sample Complexity of Pac-Learning Using Random and Chosen Examples,''
{\it Proceedings 1990 COLT Conference},
Morgan-Kaufmann (1990), 154--162.}
\rf{32.}{R. L. Rivest and P. Winston,
``Machine Learning Research at MIT,''
{\it Siemens Review} (Fall 1990), 12-14.}
\rf{33.}{R. L. Rivest,
``Cryptography,''
Chapter 13 of {\em Handbook of Theoretical Computer Science},
(ed. J. Van Leeuwen) vol. 1 (Elsevier, 1990), 717--755.}
\rf{34.}{R. L. Rivest,
``The MD4 Message Digest Algorithm,''
{\it Proceedings 1990 CRYPTO Conference},
Springer-Verlag (1991), 303--311.}
\rf{35.}{R. L. Rivest,
``Letter on the Key Size of DSA,''
{\it SIGACT News,} {\bf 22},4 (Fall 1991), 43--47.}
\rf{36.}{R. L. Rivest,
``Theory of Learning: What's Hard and What's Easy to Learn'',
in {\em Research Directions in Computer Science: An {MIT} Perspective},
(eds. Meyer, Guttag, Rivest, Szolovits) (MIT Press, 1991), 217--227.}
\rf{37.}{A. Kuh, T. Petsche, and R. L. Rivest,
``Incrementally Learning Time-Varying Half-planes,''
{\it Proceedings of the 1991 IEEE Conference on Neural Information
Processing Systems -- Natural and Synthetic; Advances in Neural
Information Processing Systems IV}, Morgan Kaufmann (1992), 920--927.}
\rf{38.}{R.L. Rivest,
``Vortex Air Rings,''
{\em Nature} 356 (19 March 1992), 199--200}.
\rf{39.}{R.L. Rivest,
``The MD5 Message-Digest Algorithm,''
Internet Network Working Group RFC 1321 (April 1992).}
\rf{40.}{A. Kuh, T. Petsche, and R. L. Rivest,
``Learning Time-Varying Concepts,''
{\it Proceedings of the 1990 IEEE Conference
on Neural Information Processing Systems -- Natural and Synthetic;
Advances in Neural Information Processing Systems 3}, Morgan Kaufmann (1991),
183--189.}
\rf{41.}{W. Remmele and R. L. Rivest,
``Machine Learning,'' in {\em Applied Computer Science and Software:
Turning Theory into Practice}, (ed. H. Schw\"{a}rtzel, Proceedings of
the International Symposium, September 30--October 1, 1991, Munich),
Springer-Verlag (1991), 186--200.}
\rf{42.}{D. Kirsh, J.S. Altman, J.P. Changeuz, A.R. Damasio, R. Durbin,
A.K. Engel, W.D. Hillis, D. Premack, R. Rivest, P.E. Roland, P.S.
Rosenbloom, G.S. Stent, and P. Stoerig,
``Group Report: Architectures of Intelligent Systems,''
Chapter 20 in {\em Exploring Brain Functions: Models in Neuroscience}
(Report of September 29--October 4, 1991 Dahlem Workshop) (Wiley, 1993),
293--321}.
\rf{43}{R. Rivest and Y.L. Yin,
``Being Taught can be Faster than Asking Questions,''
Proceedings 1995 COLT Conference (ACM, 1995), 144-151}.
\rf{44}{Baruch Awerbuch, Margrit Betke, Ronald L. Rivest,
and Mona Singh,
``Piecemeal Graph Exploration by a Mobile Robot,''
Proceedings 1995 COLT Conference (ACM, 1995), 321--328}.
\rf{45}{Bergman, Ruth and Ronald L. Rivest,
``Finding the Best Expert from a Sequence,'' Proceedings of the Fifth
International Workshop on Artificial Intelligence and Statistics,
(Fort Lauerdale FL, January 1995). ???--??? }
\rf{46}{Ronald L. Rivest and Yiqun Yin,
``Simulation results for a new two-armed bandit heuristic,''
in {\em Computational Learning Theory and Natural Learning Systems}
(ed. by S. J. Hanson, G. A. Drastal, and R. L. Rivest)(MIT Press 1994),
477-486.}
\rf{47}{Ronald L. Rivest,
``The RC5 Encryption Algorithm,''
in {\em Fast Software Encryption} (ed. Bart Preneel),
(Springer 1995), 86--96}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\no{5. Internal Memoranda and Progress Reports}
\rf{1.}{Hyafil, L., and R. L. Rivest,
``Graph partitioning and constructing optimal deiscion trees are polynomial
complete problems,''
IRIA Laboria Report No.\ 33 (October 1973). }
\rf{2.}{Rivest, R. L.,
``A fast stable minimal-storage sorting algorithm,''
IRIA Laboria Report No.\ 43 (November 1973). }
\rf{3.}{Rivest, R. L., and J. Vuillemin,
``On the number of argument evaluations required to compute Boolean
functions,''
U.C. Berkeley Electronics Research Laboratory Memorandum ERL-M472
(October 1974).}
\rf{4.}{Rivest, R. L., and J. Vuillemin,
``On the time required to recognize properties of graphs from their adjacency
matrices,''
U.C. Berkeley Electronics Research Lab.\ Memo.\ ERL-M476
(November 1974).}
\rf{5.}{Rivest, R. L.,
``Analysis of associative retrieval algorithms,''
Ph.D. thesis, Stanford Univ.\ Computer Science Dept.\ Report CS-75-415
(May 1974).}
\rf{6.}{Rivest, R. L., and J. Van de Wiele,
``An $\Omega$((n/lg n)**2) Lower Bound on the Number of Additions
Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials,''
IRIA Laboria Report No.\ 324 (September 1978).}
\rf{7.}{Shamir, A., R. L. Rivest, and L. Adleman,
``Mental Poker,''
MIT Laboratory for Computer Science Technical Memo 125(February 1979).
Also in {\sl The Mathematical Gardner } (ed.\ by D. Klarner),
Prindle, Weber, and Schmidt(Boston, 1981), 37-43.}
\rf{8.}{Rivest, R. L.,
``Benchmark Channel-Routing Problems,''
MIT VLSI Memo 82-74
(February 1982).}
\rf{9.}{Leighton, F. T., and R. L. Rivest,
``The Markov Chain Tree Theorem,''
MIT Tech.\ Memo MIT-LCS TM-249 (November 1983).}
\rf{10.}{Rivest, Ronald L.,
``Network Control by Bayesian Broadcast,''
MIT Lab.\ for Computer Science Technical Memo TM-287
(September 1985).}
\rf{11.}{Glasser, L., and R. L. Rivest,
``A Fast Multi-port Memory Based on Single-Port Memory Cells,''
MIT Lab.\ for Computer Science Technical Memo TM-455
(July 1991).}
Notes:
The following papers from section 2 (Papers in Refereed Journals) have
previously appeared as technical memos:
2, 3, 4, and 6 (Stanford),
7 and 9 (IRIA),
16 (MIT LCS).
The following papers from section 3 (Papers in Refereed Conferences) have
previously appeared as technical memos:
4 (MIT LCS).
The following papers from section 2 (Papers in Refereed Journals)
have previously appeared in conference proceedings:
7 and 16.