4906<>331_7<>a. c. mckellar<>dynamic placement of records in linear storage<>jacm<>c. k. wong<>
31964<>987_4<>santosh k. shrivastava<>reliable software: a selective annotated bibliography<>spe<>thomas anderson<>
12786<>2394_10<>martin a. roth<>analyses of deterministic parsing algorithms<>cacm<>jacques cohen<>
26997<>2586_0<>anthony j. w. hilton<>partitioning the edges of a graph<>jct<>rhys price jones<>
1851<>2618_0<>stephen e. eldridge<>packings of graphs and applications to computational complexity<>jct<>bala bollobas<>
1859<>2618_8<>nulo<>the number of 1-factors in 2k-connected graphs<>jct<>bala bollobas<>
1861<>2618_10<>nulo<>uniquely colorable graphs<>jct<>bala bollobas<>
31012<>2683_44<>nulo<>end extensions and numbers of countable models<>jsyml<>saharon shelah<>
31028<>2683_60<>nulo<>on the number of minimal models<>jsyml<>saharon shelah<>
8909<>2734_25<>nulo<>linear simple matrix languages<>eik<>gheorghe paun<>
7239<>2749_8<>hermann a. maurer:arto salomaa<>etol forms<>jcss<>derick wood<>
7241<>2749_10<>hermann a. maurer:arto salomaa<>uniform interpretations of l forms<>iandc<>derick wood<>
5409<>3189_33<>nulo<>a novel technique for computing negabinary squares<>tc<>dharma p. agrawal<>
5414<>3189_38<>t. r. n. rao<>on multiple operand addition of signed binary numbers<>tc<>dharma p. agrawal<>
9028<>3580_8<>andrzej ehrenfeucht<>simplifications of homomorphisms<>iandc<>grzegorz rozenberg<>
8271<>3772_10<>david e. muller<>finding the intersection of two convex polyhedra<>tcs<>franco p. preparata<>
8284<>3772_23<>leonard m. adleman:kellogg s. booth:walter l. ruzzo<>improved time and space bounds for boolean matrix multiplication<>acta<>franco p. preparata<>
8302<>3772_41<>d. t. lee<>the all nearest-neighbor problem for convex polygons<>ipl<>franco p. preparata<>
8310<>3772_49<>m. r. garey:david s. johnson:robert endre tarjan<>triangulating a simple polygon<>ipl<>franco p. preparata<>
8325<>3772_64<>dilip v. sarwate<>an improved parallel processor bound in fast matrix inversion<>ipl<>franco p. preparata<>
8354<>3772_93<>nulo<>new parallel-sorting schemes<>tc<>franco p. preparata<>
8357<>3772_96<>david s. johnson<>the densest hemisphere problem<>tcs<>franco p. preparata<>
6065<>3890_2<>m. r. garey:franco p. preparata:robert endre tarjan<>triangulating a simple polygon<>ipl<>david s. johnson<>
6089<>3890_26<>m. r. garey<>"``strong'' np-completeness results: motivation, examples, and implications."<>jacm<>david s. johnson<>
6090<>3890_27<>edward g. coffman jr.:m. r. garey<>an application of bin-packing to multiprocessor scheduling<>siamcomp<>david s. johnson<>
6110<>3890_47<>franco p. preparata<>the densest hemisphere problem<>tcs<>david s. johnson<>
796<>4207_0<>barbara liskov<>a language extension for expressing constraints on data access<>cacm<>anita k. jones<>
10990<>4566_13<>nulo<>a canonical form algorithm for proving equivalence of conditional forms<>ipl<>hanan samet<>
11090<>4566_113<>peter j. downey:ravi sethi<>off-line and on-line algorithms for deducing equalities<>popl<>hanan samet<>
11102<>4566_125<>nulo<>proving the correctness of heuristically optimized code<>cacm<>hanan samet<>
17487<>4714_20<>nulo<>queueing network modeling of computer communication networks<>csur<>j. w. wong<>
845<>4743_2<>leon s. levy:kang yueh<>local constraints in the syntax and semantics of programming languages<>popl<>aravind k. joshi<>
852<>4743_9<>leon s. levy<>skeletal structural descriptions<>iandc<>aravind k. joshi<>
10148<>4874_6<>nulo<>on a class of posets and the corresponding comparability graphs<>jct<>h. a. jung<>
10791<>5068_3<>karel culik ii<>propagating chain-free normal forms for eol systems<>iandc<>hermann a. maurer<>
10792<>5068_4<>arto salomaa:derick wood<>uniform interpretations of l forms<>iandc<>hermann a. maurer<>
10803<>5068_15<>jurgen albert:grzegorz rozenberg<>simple eol forms under uniform interpretation generating cf languages<>icalp<>hermann a. maurer<>
10812<>5068_24<>grzegorz rozenberg<>increasing the similarity of eol form interpretations<>iandc<>hermann a. maurer<>
10813<>5068_25<>arto salomaa:derick wood<>etol forms<>jcss<>hermann a. maurer<>
10817<>5068_29<>h. hule:thomas ottmann<>good ol forms<>acta<>hermann a. maurer<>
24937<>5073_7<>nulo<>reversal-bounded multicounter machines and their decision problems<>jacm<>oscar h. ibarra<>
25027<>5073_97<>eitan m. gurari<>an np-complete number-theoretic problem<>stoc<>oscar h. ibarra<>
21585<>5157_16<>ram k. gupta<>working set and page fault frequency paging algorithms: a performance comparison<>tc<>mark a. franklin<>
21588<>5157_19<>nulo<>parallel solution of ordinary differential equations<>tc<>mark a. franklin<>
21598<>5157_29<>g. scott graham:ram k. gupta<>anomalies with variable partition paging algorithms<>cacm<>mark a. franklin<>
2498<>5328_2<>nulo<>improving the human factors aspect of database interactions<>tods<>ben shneiderman<>
2540<>5328_44<>nulo<>a framework for automatic conversion of network database programs under schema transformations<>jcit<>ben shneiderman<>
24665<>5359_43<>nulo<>straight-line program length as a parameter for complexity measures<>stoc<>nancy a. lynch<>
24669<>5359_47<>richard j. lipton<>on structure preserving reductions<>siamcomp<>nancy a. lynch<>
24677<>5359_55<>nulo<>log space machines with multiple oracle tapes<>tcs<>nancy a. lynch<>
15524<>5459_2<>nulo<>nombre chromatique total d'un hypergraphe<>jct<>j. c. meyer<>
7883<>6286_16<>joseph y.-t. leung:d. w. ting<>bin packing: maximizing the number of pieces packed<>acta<>edward g. coffman jr.<>
7931<>6286_64<>m. r. garey:david s. johnson<>an application of bin-packing to multiprocessor scheduling<>siamcomp<>edward g. coffman jr.<>
1591<>6370_9<>nulo<>a comparative study of set associative memory mapping algorithms and their use for cache and main memory<>tse<>alan jay smith<>
1604<>6370_22<>nulo<>on the effectiveness of buffered and multiple arm disks<>isca<>alan jay smith<>
1623<>6370_41<>nulo<>sequentiality and prefetching in database systems<>tods<>alan jay smith<>
18925<>6373_3<>clement t. yu:m. k. siu<>on a partitioning problem<>tods<>k. lam<>
1469<>6481_7<>hermann a. maurer:derick wood<>uniform interpretations of l forms<>iandc<>arto salomaa<>
1473<>6481_11<>hermann a. maurer:derick wood<>etol forms<>jcss<>arto salomaa<>
25502<>6484_1<>nulo<>a reconsideration of the recovery block scheme<>cj<>peter a. lee<>
25509<>6484_8<>brian randell:philip c. treleaven<>reliability issues in computing system design<>csur<>p. a. lee<>
28394<>6555_13<>jyh-sheng ke<>database skeleton and its application to fuzzy query translation<>tse<>shi-kuo chang<>
28456<>6555_75<>yin-wah wong<>optimal histogram matching by monotone gray level transformation<>cacm<>shi-kuo chang<>
1348<>6584_62<>nissim francez<>a proof method for cyclic programs<>acta<>amir pnueli<>
19770<>6645_10<>yahiko kambayashi:shuzo yajima<>problems of relational database design<>db-workshops<>katsumi tanaka<>
19779<>6645_19<>chung le viet:yahiko kambayashi:shuzo yajima<>a file organization suitable for relational database operations<>msi<>katsumi tanaka<>
5635<>6804_15<>nulo<>direct - a multiprocessor organization for supporting relational data base management systems<>isca<>david j. dewitt<>
2327<>6889_14<>nulo<>a note on computing multiple sums<>spe<>bertrand meyer<>
