au.\*:("ATKINSON LV")
Results 1 to 6 of 6
Selection :
HASHING MATRIX SUBSCRIPTS.ATKINSON LV.1975; B.I.T.; DANM.; DA. 1975; VOL. 15; NO 3; PP. 328-330; BIBL. 5 REF.Article
OPTIMIZING TWO-STATE CASE STATEMENTS IN PASCALATKINSON LV.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 6; PP. 571-581; BIBL. 9 REF.Article
THE LIST PROCESSING LANGUAGE, SLPL - AN INFORMAL OUTLINE.ATKINSON LV.1976; COMPUTER J.; G.B.; DA. 1976; VOL. 19; NO 1; PP. 32-39; BIBL. 6 REF.Article
MACHINE CODE GENERATION WITHIN A COMPILER A TEACHING MODEL.ATKINSON LV; DUFFUS GJ.1976; COMPUTER J.; G.B.; DA. 1976; VOL. 19; NO 2; PP. 160-165; BIBL. 3 REF.Article
COPAS, A CONVERSATIONAL PASCAL SYSTEMATKINSON LV; NORTH SD.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 8; PP. 819-829; BIBL. 3 REF.Article
CONTEXT SENSITIVE EDITING AS AN APPROACH TO INCREMENTAL COMPILATIONATKINSON LV; MCGREGOR JJ; NORTH SD et al.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 3; PP. 222-229; BIBL. 8 REF.Article