27870<>582_6<>anthony e. trojanowski<>finding a maximum independent set<>siamcomp<>robert endre tarjan<>
5470<>818_6<>stanley c. kwasny:h. william buttelmann:b. chandrasekaran:norman k. sondheimer<>nlg - natural language graphics<>ijcai<>david c. brown<>
30735<>966_4<>nulo<>cycles in self-complementary graphs<>jct<>s. b. rao<>
23550<>1022_8<>daniel r. ries<>effects of locking granularity in a database management system<>tods<>michael stonebraker<>
8847<>1796_41<>leonard m. adleman:kenneth l. manders<>on taking roots in finite fields<>focs<>gary l. miller<>
8853<>1796_47<>nulo<>"graph isomorphism, general remarks"<>stoc<>gary l. miller<>
27708<>1826_4<>tom m. mitchell:r. a. chestek:bruce g. buchanan<>a model for learning systems<>ijcai<>reid g. smith<>
31344<>1959_5<>h. t. kung<>an efficient parallel garbage collection system and its correctness proof<>focs<>s. w. song<>
12785<>2394_9<>neal carpenter<>a language for inquiring about the run-time behaviour of programs<>spe<>jacques cohen<>
12797<>2394_21<>joel katcoff<>automatic solution of a certain class of combinatorial problems<>ipl<>jacques cohen<>
12815<>2394_39<>joel katcoff<>symbolic solution of finite-difference equations<>toms<>jacques cohen<>
8969<>2734_85<>anca pascu<>a homomorphic representation of simple matrix languages<>iandc<>gheorghe paun<>
7231<>2749_0<>hermann a. maurer:arto salomaa<>eol forms<>acta<>derick wood<>
5419<>3189_43<>nulo<>comments on ``a note on base -2 arithmetic logic''<>tc<>dharma p. agrawal<>
4328<>3195_9<>kenneth steiglitz<>on the complexity of local search for the traveling salesman problem<>siamcomp<>christos h. papadimitriou<>
16254<>3389_0<>donald e. walker:william h. paxton:barbara j. grosz:gary g. hendrix:ann e. robinson:jonathan slocum<>procedures for integrating knowledge in a speech understanding system<>ijcai<>jane j. robinson<>
12217<>3576_0<>saul amarel:bruce g. buchanan:peter e. hart:casimir a. kulikowski:william a. martin:harry e. pople<>applications of artificial intelligence<>ijcai<>john seely brown<>
8300<>3772_39<>nulo<>the medial axis of a simple polygon<>mfcs<>franco p. preparata<>
8348<>3772_87<>david e. muller:amnon barak<>reduction of depth of boolean networks with a fan-in constraint<>tc<>franco p. preparata<>
8364<>3772_103<>d. t. lee<>location of a point in a planar subdivision and its applications<>siamcomp<>franco p. preparata<>
32624<>3781_69<>nulo<>model representations and control structures in image understanding<>ijcai<>takeo kanade<>
11284<>3810_0<>pamela mccorduck:marvin minsky:oliver g. selfridge<>history of artificial intelligence<>ijcai<>herbert a. simon<>
13285<>3838_0<>peter r. j. asveld<>iterated deterministic substitution<>acta<>joost engelfriet<>
6118<>3890_55<>m. r. garey<>two-processor scheduling with start-times and deadlines<>siamcomp<>david s. johnson<>
11014<>4566_37<>nulo<>toward automatic debugging of compilers<>ijcai<>hanan samet<>
11068<>4566_91<>nulo<>a new approach to evaluating code generation in a student environment<>ifip<>hanan samet<>
11083<>4566_106<>nulo<>a machine description facility for compiler testing<>tse<>hanan samet<>
2574<>4676_1<>daniel g. bobrow:gary g. hendrix:william a. martin:john l. mccarthy:allen newell:roger c. schank:n. s. sridharan<>knowledge representation<>ijcai<>brian c. smith<>
17472<>4714_5<>m. s. unsoy<>analysis of flow control in switched data networks<>ifip<>j. w. wong<>
11268<>4800_11<>nulo<>artificial intelligence systems that understand<>ijcai<>herbert a. simon<>
10819<>5068_31<>thomas ottmann:arto salomaa<>on the form equivalence of -forms<>tcs<>hermann a. maurer<>
10826<>5068_38<>arto salomaa:derick wood<>eol forms<>acta<>hermann a. maurer<>
10829<>5068_41<>thomas ottmann<>tree-structures for set manipulation problems<>mfcs<>hermann a. maurer<>
24968<>5073_38<>teofilo f. gonzalez:sartaj sahni<>bounds for lpt schedules on uniform processors<>siamcomp<>oscar h. ibarra<>
15770<>5140_0<>william t. trotter<>the dimension of planar posets<>jct<>john i. moore<>
15771<>5141_0<>robert s. boyer<>a fast string searching algorithm<>cacm<>j. strother moore<>
28114<>5262_0<>paul erdos<>on the chromatic index of almost all graphs<>jct<>robin j. wilson<>
2514<>5328_18<>richard e. mayer:don mckay:peter heller<>experimental investigations of the utility of detailed flowcharts in programming<>cacm<>ben shneiderman<>
24634<>5359_12<>nulo<>log space recognition and translation of parenthesis languages<>jacm<>nancy a. lynch<>
24746<>5359_124<>edward k. blum<>efficient reducibility between programming systems: preliminary report<>stoc<>nancy a. lynch<>
24760<>5359_138<>seymour ginsburg<>derivation complexity in context-free grammar forms<>siamcomp<>nancy a. lynch<>
1595<>6370_13<>nulo<>two methods for the efficient analysis of memory address trace data<>tse<>alan jay smith<>
1597<>6370_15<>nulo<>multiprocessor memory organization and memory interference<>cacm<>alan jay smith<>
1462<>6481_0<>hermann a. maurer:derick wood<>eol forms<>acta<>arto salomaa<>
1468<>6481_6<>hermann a. maurer:thomas ottmann<>on the form equivalence of -forms<>tcs<>arto salomaa<>
1304<>6584_18<>nulo<>the temporal logic of programs<>focs<>amir pnueli<>
1310<>6584_24<>tmima olshansky<>a direct algorithm for checking equivalence of ll grammars<>tcs<>amir pnueli<>
1315<>6584_29<>david harel:jonathan stavi<>a complete axiomatic system for proving deductions about recursive programs<>stoc<>amir pnueli<>
1406<>6584_120<>giora slutzki<>simple programs and their decision problems<>icalp<>amir pnueli<>
19775<>6645_15<>yahiko kambayashi:shuzo yajima<>a relational data language with simplified binary relation handling capability<>vldb<>katsumi tanaka<>
3688<>6675_24<>nulo<>program specifications and formal development<>icsym<>cliff b. jones<>
