ON "PROVABLE" ANALOGS OF P AND NPBAKER TP.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 12; NO 3; PP. 213-218; BIBL. 4 REF.Article

A SINGLE-PASS SYNTAX-DIRECTED FRONT END FOR ADABAKER TP.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 6; PP. 318-326; BIBL. 17 REF.Conference Paper

NATURAL PROPERTIES OF FLOWCHART STEP-COUNTING MEASURES.BAKER TP.1978; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1978; VOL. 16; NO 1; PP. 1-22; BIBL. 11 REF.Article

A ONE-PASS ALGORITHM FOR OVERLOAD RESOLUTION IN ADABAKER TP.1982; ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 4; PP. 601-614; BIBL. 11 REF.Article

EXTENDING LOOKAHEAD FOR LR PARSERSBAKER TP.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 243-259; BIBL. 14 REF.Article

A TECHNIQUE FOR EXTENDING RAPID EXACT-MATCH STRING MATCHING TO ARRAYS OF MORE THAN ONE DIMENSIONBAKER TP.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 533-541; BIBL. 11 REF.Article

ON SIMPLE GOEDEL NUMBERINGS AND TRANSLATIONS.HARTMANIS J; BAKER TP.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 1; PP. 1-11; BIBL. 6 REF.Article

RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGES AND SEPARATION OF COMPLEXITY CLASSESHARTMANIS J; BAKER TP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 70-88; BIBL. 11 REF.Conference Paper

SUCCINCTNESS, VERIFIABILITY AND DETERMINISM IN REPRESENTATIONS OF POLYNOMIAL-TIME LANGUAGESBAKER TP; HARTMANIS J.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. 392-396; BIBL. 11 REF.Conference Paper

A SECOND STEP TOWARD THE POLYNOMIAL HIERARCHYBAKER TP; SELMAN AL.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 177-187; BIBL. 5 REF.Article