33460<>32_51<>nulo<>a structured approach to language design<>cl<>victor r. basili<>
10139<>369_0<>e. f. assmus jr.:jean-marie goethals<>generalized t-designs and majority decoding of linear codes<>iandc<>h. f. mattson jr.<>
27865<>582_1<>nulo<>edge-disjoint spanning trees and depth-first search<>acta<>robert endre tarjan<>
27868<>582_4<>david r. cheriton<>finding minimum spanning trees<>siamcomp<>robert endre tarjan<>
27873<>582_9<>m. r. garey:david s. johnson<>the planar hamiltonian circuit problem is np-complete<>siamcomp<>robert endre tarjan<>
27876<>582_12<>gideon ehrlich:shimon even<>intersection graphs of curves in the plane<>jct<>robert endre tarjan<>
23546<>1022_4<>eugene wong:peter kreps:gerald held<>the design and implementation of ingres<>tods<>michael stonebraker<>
8518<>1362_3<>nulo<>semantic evaluation from left to right<>cacm<>gregor von bochmann<>
8854<>1796_48<>nulo<>riemann's hypothesis and tests for primality<>jcss<>gary l. miller<>
32425<>1898_8<>nulo<>finite automata having cost functions<>iandc<>toshihide ibaraki<>
1860<>2618_9<>stephen e. eldridge<>on graphs with diameter 2<>jct<>bala bollobas<>
3069<>2708_4<>david e. daykin<>graphs with hamiltonian cycles having adjacent lines different colors<>jct<>c. c. chen<>
7244<>2749_13<>hermann a. maurer<>on grammar forms with terminal context<>acta<>derick wood<>
5427<>3189_51<>nulo<>signed modified reflected binary code<>tc<>dharma p. agrawal<>
8292<>3772_31<>fabrizio luccio<>storage for consecutive retrieval<>ipl<>franco p. preparata<>
8293<>3772_32<>david e. muller<>restructuring of arithmetic expressions for parallel evaluation<>jacm<>franco p. preparata<>
8323<>3772_62<>d. t. lee<>location of a point in a planar subdivision and its applications<>stoc<>franco p. preparata<>
8376<>3772_115<>david e. muller<>efficient parallel evaluation of boolean expression<>tc<>franco p. preparata<>
6153<>3882_0<>clement t. yu<>on the complexity of finding the set of candidate keys for a given set of functional dependencies<>ipl<>d. t. johnson<>
6069<>3890_6<>m. r. garey:ronald l. graham<>some np-complete geometric problems<>stoc<>david s. johnson<>
6070<>3890_7<>m. r. garey<>the complexity of near-optimal graph coloring<>jacm<>david s. johnson<>
6080<>3890_17<>m. r. garey:ronald l. graham<>resource constrained scheduling as generalized bin packing<>jct<>david s. johnson<>
6091<>3890_28<>m. r. garey:larry j. stockmeyer<>some simplified np-complete graph problems<>tcs<>david s. johnson<>
6113<>3890_50<>m. r. garey:robert endre tarjan<>the planar hamiltonian circuit problem is np-complete<>siamcomp<>david s. johnson<>
11258<>4800_1<>allen newell<>computer science as empirical inquiry: symbols and search<>cacm<>herbert a. simon<>
10808<>5068_20<>derick wood<>on grammar forms with terminal context<>acta<>hermann a. maurer<>
24988<>5073_58<>sartaj sahni:chul e. kim<>finite automata with multiplication<>tcs<>oscar h. ibarra<>
25036<>5073_106<>chul e. kim<>a useful device for showing the solvability of some decision problems<>stoc<>oscar h. ibarra<>
25037<>5073_107<>chul e. kim<>a useful device for showing the solvability of some decision problems<>jcss<>oscar h. ibarra<>
2500<>5328_4<>victor goodman<>batched searching of sequential and tree structured files<>tods<>ben shneiderman<>
24695<>5359_73<>richard e. ladner<>relativization of questions about log space computability<>mst<>nancy a. lynch<>
24767<>5359_145<>nulo<>complexity-class-encoding sets<>jcss<>nancy a. lynch<>
15410<>5453_6<>f. gail gray<>algebraic properties of functions affecting optimum fault-tolerant realizations<>tc<>john f. meyer<>
15415<>5453_11<>nulo<>computation-based reliability analysis<>tc<>john f. meyer<>
19359<>5882_1<>nulo<>polynomial and abstract subrecursive classes<>jcss<>kurt mehlhorn<>
7881<>6286_14<>john l. bruno:d. b. johnson<>on batch scheduling of jobs with stochastic service times and cost structures on a single server<>jcss<>edward g. coffman jr.<>
7887<>6286_20<>ravi sethi<>a generalized bound on lpt sequencing<>sigmetrics<>edward g. coffman jr.<>
7927<>6286_60<>ravi sethi<>algorithms minimizing mean flow time: schedule-length properties<>acta<>edward g. coffman jr.<>
7947<>6287_5<>jean-marie goethals:h. f. mattson jr.<>generalized t-designs and majority decoding of linear codes<>iandc<>e. f. assmus jr.<>
1587<>6370_5<>forest baskett<>interference in multiprocessor computer systems with interleaved memory<>cacm<>alan jay smith<>
1605<>6370_23<>nulo<>a modified working set paging algorithm<>tc<>alan jay smith<>
1632<>6370_50<>nulo<>"analysis of the optimal, look-ahead demand paging algorithms."<>siamcomp<>alan jay smith<>
1635<>6370_53<>nulo<>on the effectiveness of set associative page mapping and its application to main memory management<>icse<>alan jay smith<>
19796<>6650_0<>masaharu mizumoto<>some properties of fuzzy sets of type 2<>iandc<>kokichi tanaka<>
