33468<>32_59<>robert e. noonan<>a comparison of the axiomatic and functional models of structured programming<>tse<>victor r. basili<>
22847<>424_100<>jan van leeuwen<>further comments on bykat's convex hull algorithm<>ipl<>mark h. overmars<>
21562<>750_3<>richard e. ladner<>parallel prefix computation<>jacm<>michael j. fischer<>
3658<>957_0<>morris newman<>a note on cospectral graphs<>jct<>charles r. johnson<>
23543<>1022_1<>robert s. epstein<>analysis of distributed data base processing strategies<>vldb<>michael stonebraker<>
23553<>1022_11<>nulo<>retrospection on a database system<>tods<>michael stonebraker<>
16127<>1441_1<>nulo<>code motion<>siamcomp<>john h. reif<>
16132<>1441_6<>paul g. spirakis<>random matroids<>stoc<>john h. reif<>
16152<>1441_26<>gary l. peterson<>a dynamic logic of multiprocessing with incomplete information<>popl<>john h. reif<>
6740<>1690_1<>nulo<>state transition machines for lambda calculus expressions<>cc<>david a. schmidt<>
8821<>1796_15<>nulo<>isomorphism testing for graphs of bounded genus<>stoc<>gary l. miller<>
8873<>1796_67<>dragomir z. djokovic<>regular groups of automorphisms of cubic graphs<>jct<>gary l. miller<>
27710<>1826_6<>nulo<>the contract net protocol: high-level communication and control in a distributed problem solver<>tc<>reid g. smith<>
27928<>1997_38<>leon j. osterweil<>anomaly detection in concurrent software by static data flow analysis<>tse<>richard n. taylor<>
26839<>2329_0<>jeff kahn:neil robertson<>on the maximum number of diagonals of a circuit in a graph<>dm<>ram prakash gupta<>
8924<>2734_40<>nulo<>some consequences of a result of ehrenfeucht and rozenberg<>ita<>gheorghe paun<>
7233<>2749_2<>hermann a. maurer:arto salomaa<>on generators and generative capacity of eol forms<>acta<>derick wood<>
7236<>2749_5<>hermann a. maurer:arto salomaa<>pure grammars<>iandc<>derick wood<>
7242<>2749_11<>hermann a. maurer:arto salomaa<>msw spaces<>iandc<>derick wood<>
7243<>2749_12<>hermann a. maurer:arto salomaa<>context-free grammar forms with strict interpretations<>jcss<>derick wood<>
4921<>2852_8<>tse-yun feng<>on a class of multistage interconnection networks<>tc<>chuan-lin wu<>
4924<>2852_11<>tse-yun feng<>the reverse-exchange interconnection network<>tc<>chuan-lin wu<>
13691<>3047_165<>albert r. meyer<>axiomatic definitions of programming languages: a theoretical assessment<>popl<>joseph y. halpern<>
9027<>3580_7<>andrzej ehrenfeucht:hermann a. maurer<>continuous grammars<>iandc<>grzegorz rozenberg<>
9032<>3580_12<>andrzej ehrenfeucht<>dos systems and languages<>icalp<>grzegorz rozenberg<>
8339<>3772_78<>witold lipski jr.<>finding the contour of a union of iso-oriented rectangles<>jal<>franco p. preparata<>
8370<>3772_109<>jean vuillemin<>area-time optimal vlsi networks for multiplying matrices<>ipl<>franco p. preparata<>
32611<>3781_56<>nulo<>a theory of origami world<>ai<>takeo kanade<>
6100<>3890_37<>edward g. coffman jr.:m. r. garey:robert endre tarjan<>performance bounds for level-oriented two-dimensional packing algorithms<>siamcomp<>david s. johnson<>
27043<>4105_32<>christos h. papadimitriou<>on linear characterizations of combinatorial optimization problems<>focs<>richard m. karp<>
27079<>4105_68<>robert endre tarjan<>linear expected-time algorithms for connectivity problems<>jal<>richard m. karp<>
27093<>4105_82<>richard j. lipton<>some connections between nonuniform and uniform complexity classes<>stoc<>richard m. karp<>
25638<>4324_9<>nulo<>some new results on isotonic array grammars<>ipl<>patrick shen-pei wang<>
10989<>4566_12<>nulo<>efficient on-line proofs of equalities and inequalities of formulas<>tc<>hanan samet<>
10998<>4566_21<>nulo<>a coroutine approach to parsing<>toplas<>hanan samet<>
11008<>4566_31<>nulo<>deletion in two-dimensional quad trees<>cacm<>hanan samet<>
11067<>4566_90<>nulo<>region representation: quadtrees from boundary codes<>cacm<>hanan samet<>
11086<>4566_109<>leo marcus<>purging in an equality data base<>ipl<>hanan samet<>
11096<>4566_119<>charles r. dyer:azriel rosenfeld<>region representation: boundary codes from quadtrees<>cacm<>hanan samet<>
1506<>4692_7<>zvi m. kedem<>consistency in hierarchical database systems<>jacm<>abraham silberschatz<>
17467<>4714_0<>shashi k. mehra:jayanti c. majithia<>a comparative study of some two-processor organizations<>tc<>j. w. wong<>
17479<>4714_12<>j. kent peacock:eric g. manning<>synchronization of distributed simulation using broadcast algorithms<>cn<>j. w. wong<>
854<>4743_11<>leon s. levy<>phrase structure trees bear more fruit than you would have thought<>acl<>aravind k. joshi<>
10799<>5068_11<>arto salomaa:derick wood<>context-free grammar forms with strict interpretations<>jcss<>hermann a. maurer<>
10800<>5068_12<>andrzej ehrenfeucht:grzegorz rozenberg<>continuous grammars<>iandc<>hermann a. maurer<>
10806<>5068_18<>maurice nivat<>rational bijection of rational sets<>acta<>hermann a. maurer<>
10823<>5068_35<>arto salomaa:derick wood<>pure grammars<>iandc<>hermann a. maurer<>
10831<>5068_43<>arto salomaa:derick wood<>msw spaces<>iandc<>hermann a. maurer<>
24955<>5073_25<>eitan m. gurari<>"path systems: constructions, solutions and applications."<>siamcomp<>oscar h. ibarra<>
25060<>5073_130<>shlomo moran:louis e. rosier<>a note on the parallel complexity of computing the rank of order n matrices<>ipl<>oscar h. ibarra<>
2526<>5328_30<>glenn thomas<>path expressions for complex queries and automatic database program conversion<>vldb<>ben shneiderman<>
24706<>5359_84<>edward k. blum<>relative complexity of operations on numeric and bit-string algebras<>mst<>nancy a. lynch<>
24751<>5359_129<>nulo<>straight-line program length as a parameter for complexity analysis<>jcss<>nancy a. lynch<>
15418<>5453_14<>david g. furchtgott:liang t. wu<>performability evaluation of the sift computer<>tc<>john f. meyer<>
15422<>5453_18<>nulo<>on evaluating the performability of degradable computing systems<>tc<>john f. meyer<>
789<>6078_0<>walter h. niehoff<>an apl approach to presentation graphics<>ibmsj<>alan l. jones<>
3389<>6092_2<>subhash c. narula<>degree-constrained minimum spanning tree<>cor<>cesar a. ho<>
7878<>6286_11<>m. r. garey:david s. johnson:robert endre tarjan<>performance bounds for level-oriented two-dimensional packing algorithms<>siamcomp<>edward g. coffman jr.<>
7886<>6286_19<>kimming so:micha hofri:andrew chi-chih yao<>a stochastic model of bin-packing<>iandc<>edward g. coffman jr.<>
7922<>6286_55<>kimming so<>on the comparison between single and multiple processor systems<>isca<>edward g. coffman jr.<>
7935<>6286_68<>brenda s. baker:ronald l. rivest<>orthogonal packings in two dimensions<>siamcomp<>edward g. coffman jr.<>
1625<>6370_43<>nulo<>multiprogramming and memory contention<>spe<>alan jay smith<>
1471<>6481_9<>nulo<>grammatical families<>icalp<>arto salomaa<>
1472<>6481_10<>hermann a. maurer:derick wood<>pure grammars<>iandc<>arto salomaa<>
1475<>6481_13<>hermann a. maurer:derick wood<>msw spaces<>iandc<>arto salomaa<>
1480<>6481_18<>hermann a. maurer:derick wood<>on generators and generative capacity of eol forms<>acta<>arto salomaa<>
25505<>6484_4<>n. ghani:k. heron<>a recovery cache for the pdp-11<>tc<>p. a. lee<>
28439<>6555_58<>j. l. reuss:bruce h. mccormick<>picture paging for efficient image processing<>db-workshops<>shi-kuo chang<>
28441<>6555_60<>chung-chun yang<>"convex polygons, hypercubes, and encoding techniques."<>db-workshops<>shi-kuo chang<>
1353<>6584_67<>zohar manna<>synchronous schemes and their decision problems<>popl<>amir pnueli<>
2335<>6889_22<>nulo<>a basis for the constructive approach to programming<>ifip<>bertrand meyer<>
