BOUNDS ON THE COMPLEXITY OF THE LONGEST COMMON SUBSEQUENCE PROBLEM.AHO AV.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 1-12; BIBL. 18 REF.Article

TRANSLATOR WRITING SYSTEMS: WHERE DO THEY NOW STAND.AHO AV.1980; COMPUTER; USA; DA. 1980; VOL. 13; NO 8; PP. 9-14; BIBL. 65 REF.Article

NODE LISTINGS FOR REDUCIBLE FLOW GRAPHS.AHO AV; ULLMAN JD.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 3; PP. 286-299; BIBL. 20 REF.Article

OPTIMIZATION OF LR(K) PARSERSAHO AV; ULLMAN JD.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 6; PP. 573-602; BIBL. 7 REF.Serial Issue

EFFICIENT STRING MATCHING: AN AID TO BIBLIOGRAPHIC SEARCH.AHO AV; CORASICK MJ.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 6; PP. 333-340; BIBL. 17 REF.Article

HOW HARD IS COMPILER CODE GENERATION.AHO AV; SETHI R.1977; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1977; VOL. 52; PP. 1-15; BIBL. 2 P. 1/2; (AUTOM. LANG. PROGRAM. COLLOQ. 4; TURKU; 1977)Conference Paper

A TECHNIQUE FOR SPEEDING UP LR(K) PARSERS = UNE TECHNIQUE POUR ACCELERER LES ANALYSEURS LR(K)AHO AV; ULLMAN JD.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 251-263; BIBL. 10 REF.Conference Paper

THE THEORY OF JOINS IN RELATIONAL DATABASESAHO AV; BEERI C; ULLMAN JD et al.1979; A.C.M. TRANS. DATABASE SYST.; USA; DA. 1979; VOL. 4; NO 3; PP. 297-314; BIBL. 21 REF.Article

AWK - A PATTERN SCANNING AND PROCESSING LANGUAGEAHO AV; KERNIGHAN BW; WEINBERGER PJ et al.1979; SOFTWARE. PRACT. EXPER.; GBR; DA. 1979; VOL. 9; NO 4; PP. 267-279; BIBL. 6 REF.Article

RECTILINEAR STEINER TREES: EFFICIENT SPECIAL-CASE ALGORITHMS.AHO AV; GAREY MR; HWANG FK et al.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 1; PP. 37-58; BIBL. 1 P. 1/2Article

EFFICIENT OPITMIZATION OF A CLASS OF RELATIONAL EXPRESSIONSAHO AV; SAGIV Y; ULLMAN JD et al.1979; A.C.M. TRANS. DATABASE SYST.; USA; DA. 1979; VOL. 4; NO 4; PP. 435-454; BIBL. 28 REF.Article

EQUIVALENCES AMONG RELATIONAL EXPRESSIONSAHO AV; SAGIV Y; ULLMAN JD et al.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 218-246; BIBL. 27 REF.Article

ON FINDING LOWEST COMMON ANCESTORS IN TREES.AHO AV; HOPCROFT JE; ULLMAN JD et al.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 115-132; BIBL. 15 REF.Article

MODELING COMMUNICATIONS PROTOCOLS BY AUTOMATAAHO AV; ULLMAN JD; YANNAKAKIS M et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 267-273; BIBL. 4 REF.Conference Paper

CODE GENERATION FOR EXPRESSIONS WITH COMMON SUBEXPRESSIONS. EXTENDED ABSTRACT.AHO AV; JOHNSON SC; ULLMAN JD et al.1976; IN: CONF. REC. ACM. SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 19-31; BIBL. 18 REF.Conference Paper

CODE GENERATION FOR EXPRESSIONS WITH COMMON SUBEXPRESSIONS.AHO AV; JOHNSON SC; ULLMAN JD et al.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 1; PP. 146-160; BIBL. 20 REF.Article

EVALUATING POLYNOMIALS AT FIXED SETS OF POINTS.AHO AV; STEIGLITZ K; ULLMAN JD et al.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 533-539; BIBL. 14 REF.Article

BOUNDS ON THE SIZE AND TRANSMISSION RATE OF COMMUNICATIONS PROTOCOLSAHO AV; WYNER AD; YANNAKAKIS M et al.1982; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1982; VOL. 8; NO 3; PP. 205-214; BIBL. 4 REF.Article

INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONSAHO AV; SAGIV Y; SZYMANSKI TG et al.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 405-421; BIBL. 12 REF.Article