THE GAME OF "N QUESTIONS" ON A TREE.RIVEST RL.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 2; PP. 181-186; BIBL. 7 REF.Article

ON THE WORST-EASE BEHAVIOR OF STRING-SEARCLING ALGORITHMS.RIVEST RL.1977; S.I.A.M.J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 669-674; BIBL. 5 REF.Article

OPTIMAL ARRANGEMENT OF KEYS IN A HASH TABLE.RIVEST RL.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 2; PP. 200-209; BIBL. 11 REF.Article

PARTIAL-MATCH RETRIEVAL ALGORITHMS.RIVEST RL.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 19-50; BIBL. 2 P.Article

A "GREEDY" CHANNEL ROUTERRIVEST RL; FIDUCCIA CM.1983; COMPUTER-AIDED DESIGN; ISSN 0010-4485; GBR; DA. 1983; VOL. 15; NO 3; PP. 135-140; BIBL. 23 REF.Article

ON RECOGNIZING GRAPH PROPERTIES FROM ADJACENCY MATRICES.RIVEST RL; VUILLEMIN J.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 371-384; BIBL. 16 REF.Article

THE ALGORITHM SELECT-FOR FINDING THE ITH SMALLEST OF N ELEMENTS (M1).FLOYD RW; RIVEST RL.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 173; BIBL. 3 REF.Article

THE SUBGRAPH HOMEOMORPHISM PROBLEMLAPAUCH AS; RIVEST RL.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 2; PP. 133-149; BIBL. 20 REF.Conference Paper

CONSTRUCTING OPTIMAL BINARY DECISION TREES IS NP-COMPLETE.HYAFIL L; RIVEST RL.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 1; PP. 15-17; BIBL. 6 REF.Article

AN OMEGA ((N/LGN)^1/2) LOWER BOUND ON THE NUMBER OF ADDITIONS NECESSARY TO COMPUTE 0-1 POLYNOMIALS OVER THE RING OF INTEGER POLYNOMIALSRIVEST RL; VAN DE WIELE JP.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT. RAPP. RECH.; FRA; DA. 1978; NO 324; PP. 1-4; BIBL. 4 REF.Serial Issue

ORTHOGONAL PACKINGS IN TWO DIMENSIONSBAKER BS; COFFMAN EG JR; RIVEST RL et al.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 846-855; BIBL. 11 REF.Article

A METHOD FOR ABTAINING DIGITAL SIGNATURES AND PUBLIC-KEY CRYPTOSYSTEMS.RIVEST RL; SHAMIR A; ADLEMAN L et al.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 2; PP. 120-126; BIBL. 14 REF.Article

COPING WITH ERRORS IN BINARY SEARCH PROCEDURESRIVEST RL; MEYER AR; KLEITMAN DJ et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 3; PP. 396-404; BIBL. 7 REF.Article