33483<>32_74<>albert j. turner<>iterative enhancement: a practical technique for software development<>tse<>victor r. basili<>
4900<>331_1<>richard m. karp:a. c. mckellar<>near-optimal solutions to a 2-dimensional placement problem<>siamcomp<>c. k. wong<>
14688<>472_0<>leon e. winslow<>optimal choice of data restructuring points<>vldb<>j. c. lee<>
15871<>1012_1<>nick roussopoulos<>using semantic networks for database management<>vldb<>john mylopoulos<>
8829<>1796_23<>nulo<>riemann's hypothesis and tests for primality<>stoc<>gary l. miller<>
32429<>1898_12<>nulo<>minimal representations of some classes of dynamic programming<>iandc<>toshihide ibaraki<>
12780<>2394_4<>nulo<>experience with a conversational parser generating system<>spe<>jacques cohen<>
12802<>2394_26<>nulo<>interpretation of non-deterministic algorithms in higher-level languages<>ipl<>jacques cohen<>
1820<>2700_0<>gerard salton:c. s. yang<>a vector space model for automatic indexing<>cacm<>a. wong<>
5422<>3189_46<>nulo<>arithmetic algorithms in a negative base<>tc<>dharma p. agrawal<>
27395<>3440_2<>harry e. pople:j. myers<>dialog: a model of diagnostic logic for internal medicine<>ijcai<>r. miller<>
8264<>3772_3<>david e. muller<>bounds to complexities of networks for sorting and for switching<>jacm<>franco p. preparata<>
8295<>3772_34<>nulo<>a fast stable sorting algorithm with absolutely minimum storage<>tcs<>franco p. preparata<>
8313<>3772_52<>david e. muller<>the time required to evaluate division-free arithmetic expressions<>ipl<>franco p. preparata<>
8345<>3772_84<>h. t. kung:fabrizio luccio<>on finding the maxima of a set of vectors<>jacm<>franco p. preparata<>
6119<>3890_56<>m. r. garey<>complexity results for multiprocessor scheduling under resource constraints<>siamcomp<>david s. johnson<>
853<>4743_10<>leon s. levy:masako takahashi<>tree adjunct grammars<>jcss<>aravind k. joshi<>
10807<>5068_19<>hans-peter kriegel<>formal translations and the containment problem for szilard languages<>automata<>hermann a. maurer<>
24976<>5073_46<>sartaj sahni<>hierarchies of turing machines with restricted tape alphabet size<>jcss<>oscar h. ibarra<>
25023<>5073_93<>chul e. kim<>fast approximation algorithms for the knapsack and sum of subset problems<>jacm<>oscar h. ibarra<>
25043<>5073_113<>sartaj sahni<>polynomially complete fault detection problems<>tc<>oscar h. ibarra<>
24623<>5359_1<>richard e. ladner:alan l. selman<>a comparison of polynomial time reducibilities<>tcs<>nancy a. lynch<>
24684<>5359_62<>nulo<>helping: several formalizations<>jsyml<>nancy a. lynch<>
24739<>5359_117<>seymour ginsburg<>comparative complexity of grammar forms<>stoc<>nancy a. lynch<>
15404<>5453_0<>robert j. sundstrom<>on-line diagnosis of unrestricted faults<>tc<>john f. meyer<>
7885<>6286_18<>g. j. burnett<>analysis of interleaved memory systems using blockage buffers<>cacm<>edward g. coffman jr.<>
1634<>6370_52<>nulo<>comments on a paper by t. c. chen and i. t. ho<>cacm<>alan jay smith<>
28387<>6555_6<>y. r. wang<>three-dimensional object reconstruction from orthogonal projections<>pr<>shi-kuo chang<>
28396<>6555_15<>nulo<>data base decomposition in a hierarchical computer system<>sigmod<>shi-kuo chang<>
21199<>6803_0<>nulo<>a basis for the acquisition of procedures from protocols<>ijcai<>m. bauer<>
5176<>6871_0<>gerard salton:a. wong<>a vector space model for automatic indexing<>cacm<>c. s. yang<>
