A SURVEY OF DATA FLOW ANALYSIS TECHNIQUES.ULLMAN JD.1975; IN: U.S.A.-JAP. COMPUT. CONF. 2. PROC.; TOKYO; 1976; MONTVALE; AM. FED. INF. PROCESS. SOC.; DA. 1975; PP. 335-342; BIBL. 1 P. 1/2Conference Paper

THE U.R. STRIKES BACKULLMAN JD.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 10-22; BIBL. 2 P.Conference Paper

NP-COMPLETE SCHEDULING PROBLEMS.ULLMAN JD.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 384-393; BIBL. 9 REF.Article

APPLICATIONS OF LANGUAGE THEORY TO COMPILER DESIGNULLMAN JD.1972; IN: AM. FED. INF. PROCESS. SOC. SPRING JT COMPUT. CONF. ATLANTIC CITY, N.J. 1972. PROC.; MONTVALE, N.J.; AFIPS PRESS; DA. 1972; PP. 235-242; BIBL. 30 REF.Conference Proceedings

A SCHEME FOR THE AUTOMATIC INFERENCE OF VARIABLE TYPESKAPLAN MA; ULLMAN JD.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 1; PP. 128-145; BIBL. 13 REF.Article

GLOBAL DATA FLOW ANALYSIS AND ITERATIVE ALGORITHMS.KAM JB; ULLMAN JD.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 158-171; BIBL. 14 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

THE INTERACTION BETWEEN FUNCTIONAL DEPENDENCIES AND TEMPLATE DEPENDENCIESFEREIDOON SADRI; ULLMAN JD.sdINTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA/1980/SANTA MONICA CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. S.D.; PP. 45-51; BIBL. 15 REF.Conference Paper

DEADLOCK-FREE PACKET SWITCHING NETWORKSTOUEG S; ULLMAN JD.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 594-611; BIBL. 20 REF.Article

A COMPLETE AXIOMATIZATION FOR A LARGE CLASS OF DEPENDENCIES IN RELATIONAL DATA BASESSADRI F; ULLMAN JD.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 117-122; BIBL. 19 REF.Conference Paper

INDUCTION VARIABLES IN VERY HIGH LEVEL LANGUAGES.FONG AC; ULLMAN JD.1976; IN: CONF. REC. ACM SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 104-112; BIBL. 10 REF.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

MONOTONE DATA FLOW ANALYSIS FRAMEWORKS.KAM JB; ULLMAN JD.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 17; NO 3; PP. 305-317; BIBL. 17 REF.Article

EVALUATION RELATIONAL EXPRESSIONS WITH DENSE AND SPARSE ARGUMENTS.SZYMANSKI TG; ULLMAN JD.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 90-97; BIBL. 2 REF.Conference Paper

CONNECTIONS IN ACYCLIC HYPERGRAPHSMAIER D; ULLMAN JD.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 34-39; BIBL. 9 REF.Conference Paper

TEMPLATE DEPENDENCIES: A LARGE CLASS OF DEPENDENCIES IN RELATIONAL DATABASES AND ITS COMPLETE AXIOMATIZATIONSADRI F; ULLMAN JD.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 363-372; BIBL. 23 REF.Article

THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED CIRCUITSFLOYD RW; ULLMAN JD.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 603-622; BIBL. 15 REF.Article

THE THEORY OF FUNCTIONAL AND TEMPLATE DEPENDENCIESSADRI F; ULLMAN JD.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 317-331; BIBL. 21 REF.Article

MODULAR NETWORKS AND NONDETERMINISTIC SEQUENTIAL MACHINES = RESEAUX MODULAIRES ET MACHINES SEQUENTIELLES NON DETERMINISTESULLMAN JD; WEINER P.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 10; PP. 1124-1129; BIBL. 6 REF.Serial Issue

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

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

WORST-CASE ANALYSIS OF MEMORY ALLOCATION ALGORITHMSGAREY MR; GRAHAM RL; ULLMAN JD et al.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 143-150; BIBL. 7 REF.Conference Paper

A SIMPLIFIED UNIVERSAL RELATION ASSUMPTION AND ITS PROPERTIESFAGIN R; MENDELZON AO; ULLMAN JD et al.1982; ACM TRANS. DATABASE SYST.; ISSN 0362-5915; USA; DA. 1982; VOL. 7; NO 3; PP. 343-360; BIBL. 26 REF.Article