14213<>107_0<>nulo<>from the editor<>db<>joseph horner iii<>
14214<>107_1<>nulo<>from the editor<>db<>joseph horner iii<>
14217<>107_4<>nulo<>from the editor<>db<>joseph horner iii<>
8324<>3772_63<>robert t. chien:s. j. hong<>some results in the theory of arithmetic codes<>iandc<>franco p. preparata<>
846<>4743_3<>leon s. levy<>some results in tree automata<>stoc<>aravind k. joshi<>
11281<>4804_0<>nulo<>the theory of problem solving<>ifip<>herbert a. simon<>
25005<>5073_75<>nulo<>characterizations of transductions defined by abstract families of transducers<>mst<>oscar h. ibarra<>
25014<>5073_84<>nulo<>characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata<>jcss<>oscar h. ibarra<>
7873<>6286_6<>m. j. elphick:arie shoshani<>system deadlocks<>csur<>edward g. coffman jr.<>
7907<>6286_40<>neil d. jones<>priority paging algorithms and the extension problem<>focs<>edward g. coffman jr.<>
7918<>6286_51<>brian randell<>performance predictions for extended paged memories<>acta<>edward g. coffman jr.<>
7920<>6286_53<>john l. bruno<>nearly optimal binary search trees<>ifip<>edward g. coffman jr.<>
1638<>6368_2<>nulo<>simple computation-universal cellular spaces<>jacm<>alvy ray smith<>
28431<>6555_50<>nulo<>the reconstruction of binary patterns from their projections<>cacm<>shi-kuo chang<>
1390<>6584_104<>f. commoner:anatol w. holt:shimon even<>marked directed graphs<>jcss<>amir pnueli<>
3680<>6675_16<>wolfgang henhapl<>a run-time mechanism for referencing variables<>ipl<>cliff b. jones<>
