HASHING TECHNIQUES THAT EXHIBIT SECONDARY OR TERTIARY CLUSTERING.GUIBAS LJ.1975; IN: U.S.A.-JAP. COMPUT. CONF. 2. PROC.; TOKYO; 1975; MONTVALE; AM. FED. INF. PROCESS. SOC.; DA. 1975; PP. 324-328; BIBL. 3 REF.Conference Paper

THE ANALYSIS OF HASHING TECHNIQUES THAT EXHIBIT K-ARY CLUSTERINGGUIBAS LJ.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 4; PP. 544-555; BIBL. 7 REF.Article

LONG REPETITIVE PATTERNS IN RANDOM SEQUENCESGUIBAS LJ; ODLYZKO AM.1980; Z. WAHRSCHEINLICHKEITSTHEOR. VERW. GEB.; ISSN 0044-3719; DEU; DA. 1980; VOL. 53; NO 3; PP. 241-262; BIBL. 12 REF.Article

MAXIMAL PREFIX-SYNCHRONIZED CODESGUIBAS LJ; ODLYZKO AM.1978; S.I.A.M. J. APPL. MATH.; USA; DA. 1978; VOL. 35; NO 2; PP. 401-418; BIBL. 12 REF.Article

PERIODS IN STRINGSGUIBAS LJ; ODLYZKO AM.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 1; PP. 19-42; BIBL. 11 REF.Article

A NEW PROOF OF THE LINEARITY OF THE BOYER-MOORE STRING SEARCHING ALGORITHMGUIBAS LJ; ODLYZKO AM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 672-682; BIBL. 11 REF.Article

STRING OVERLAPS, PATTERN MATCHING, AND NONTRANSITIVE GAMESGUIBAS LJ; ODLYZKO AM.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 2; PP. 183-208; BIBL. 26 REF.Article

EFFICIENT SEARCHING USING PARTIAL ORDERINGBORODIN A; GUIBAS LJ; LYNCH NA et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 2; PP. 71-75; BIBL. 6 REF.Article