33464<>32_55<>harlan d. mills<>understanding and documenting programs<>tse<>victor r. basili<>
6577<>127_18<>eve longini cohen:peter b. andrews<>a look at tps<>cade<>dale miller<>
4902<>331_3<>don coppersmith:douglas stott parker jr.<>analysis of a general mass storage system<>siamcomp<>c. k. wong<>
23672<>333_112<>nulo<>the implication and finite implication problems for typed template dependencies<>pods<>moshe y. vardi<>
22762<>424_15<>herbert edelsbrunner<>on the equivalence of some rectangle problems<>ipl<>mark h. overmars<>
22838<>424_91<>jan van leeuwen<>stratified balanced search trees<>acta<>mark h. overmars<>
13943<>535_0<>arnold l. rosenberg<>graphs that are almost binary trees<>siamcomp<>jia-wei hong<>
497<>625_0<>trevor i. fenner<>on the connectivity of random m-orientable graphs and digraphs<>combinatorica<>alan m. frieze<>
3655<>964_0<>colin runciman<>semantic errors - diagnosis and repair<>sigplan<>c. w. johnson<>
15876<>1012_6<>sol j. greenspan:alexander borgida<>capturing more world knowledge in the requirements specification<>icse<>john mylopoulos<>
9882<>1292_1<>hermann a. maurer:franco p. preparata:arnold l. rosenberg:emo welzl:derick wood<>stabbing line segments<>bit<>herbert edelsbrunner<>
9883<>1292_2<>hermann a. maurer:david g. kirkpatrick<>polygonal intersection searching<>ipl<>herbert edelsbrunner<>
9893<>1292_12<>mark h. overmars<>on the equivalence of some rectangle problems<>ipl<>herbert edelsbrunner<>
16130<>1441_4<>robert endre tarjan<>symbolic program analysis in almost-linear time<>siamcomp<>john h. reif<>
16141<>1441_15<>nulo<>symmetric complementation<>stoc<>john h. reif<>
16199<>1441_73<>paul g. spirakis<>real time resource allocation in distributed systems<>podc<>john h. reif<>
9192<>1961_13<>hector garcia-molina<>read-only transactions in a distributed database<>tods<>gio wiederhold<>
9207<>1961_28<>anne f. beetem:jack milton<>performance of database management systems in vlsi design<>debu<>gio wiederhold<>
9225<>1961_46<>kyu-young whang:daniel sagalowicz<>physical design of network model databases using the property of separability<>vldb<>gio wiederhold<>
4436<>2008_26<>nulo<>software performance engineering<>cmg<>connie u. smith<>
41296<>2309_1<>tian feng:cun-quan zhang<>cycles of each length in tournaments<>jct<>zheng-sheng wu<>
12784<>2394_8<>timothy j. hickey:joel katcoff<>upper bounds for speedup in parallel parsing<>jacm<>jacques cohen<>
12809<>2394_33<>nulo<>computer-assisted microanalysis of programs<>cacm<>jacques cohen<>
12849<>2496_0<>nulo<>"the asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph."<>dm<>joel e. cohen<>
5314<>2544_4<>tian feng:zheng-sheng wu<>cycles of each length in tournaments<>jct<>cun-quan zhang<>
5318<>2544_8<>nulo<>arc-disjoint circuits in digraphs<>dm<>cun-quan zhang<>
31051<>2683_83<>uri abraham<>forcing with stable posets<>jsyml<>saharon shelah<>
8958<>2734_74<>nulo<>on simple matrix languages versus scattered context languages<>ita<>gheorghe paun<>
8976<>2734_92<>nguyen xuan my<>on the generative capacity of contextual schemata with syntactical-invariant choice<>eik<>gheorghe paun<>
7235<>2749_4<>hermann a. maurer:arto salomaa<>finitary and infinitary interpretations of languages<>mst<>derick wood<>
7237<>2749_6<>herbert edelsbrunner:hermann a. maurer:franco p. preparata:arnold l. rosenberg:emo welzl<>stabbing line segments<>bit<>derick wood<>
6175<>2855_3<>nulo<>systematic protection mechanism design<>asplos<>douglas w. jones<>
21876<>2856_2<>nulo<>a software debugging glossary<>sigplan<>mark scott johnson<>
21877<>2856_3<>nulo<>some requirements for architectural support of software debugging<>asplos<>mark scott johnson<>
13536<>3047_10<>mordechai ben-ari:amir pnueli<>"deterministic propositional dynamic logic: finite models, complexity, and completeness."<>jcss<>joseph y. halpern<>
13539<>3047_13<>albert r. meyer<>axiomatic definitions of programming languages: a theoretical assessment<>jacm<>joseph y. halpern<>
13689<>3047_163<>e. allen emerson<>decision procedures and expressiveness in the temporal logic of branching time<>stoc<>joseph y. halpern<>
13708<>3047_182<>nulo<>deterministic process logic is elementary<>focs<>joseph y. halpern<>
5394<>3189_18<>b. k. agrawal:g. c. pathak<>graceful fault tolerance in large networks of microcomputers<>icdcs<>d. p. agrawal<>
5395<>3189_19<>ramesh jain<>a pipelined pseudoparallel system architecture for real-time dynamic scene analysis<>tc<>dharma p. agrawal<>
5402<>3189_26<>nulo<>testing and fault tolerance of multistage interconnection networks<>computer<>dharma p. agrawal<>
4353<>3195_34<>michael sipser<>communication complexity<>stoc<>christos h. papadimitriou<>
12203<>3570_1<>johan de kleer<>foundations of envisioning<>aaai<>john seely brown<>
9050<>3573_0<>hermann a. maurer:emo welzl<>using string languages to describe picture languages<>iandc<>grzegorz rozenberg<>
9021<>3580_1<>andrzej ehrenfeucht<>on subword complexities of homomorphic images of languages<>ita<>grzegorz rozenberg<>
9039<>3580_19<>andrzej ehrenfeucht<>repetitions in homomorphisms and languages<>icalp<>grzegorz rozenberg<>
9046<>3580_26<>andrzej ehrenfeucht:david haussler<>conditions enforcing regularity of context-free languages<>icalp<>grzegorz rozenberg<>
8279<>3772_18<>d. t. lee<>an improved algorithm for the rectangle enclosure problem<>jal<>franco p. preparata<>
8317<>3772_56<>herbert edelsbrunner:hermann a. maurer:arnold l. rosenberg:emo welzl:derick wood<>stabbing line segments<>bit<>franco p. preparata<>
8322<>3772_61<>witold lipski jr.<>three layers are enough<>focs<>franco p. preparata<>
8367<>3772_106<>jon louis bentley:mark g. faust<>approximation algorithms for convex hulls<>cacm<>franco p. preparata<>
8382<>3772_121<>jurg nievergelt<>plane-sweep algorithms for intersecting geometric figures<>cacm<>franco p. preparata<>
6097<>3890_34<>anthony c. klug<>testing containment of conjunctive queries under functional and inclusion dependencies<>pods<>david s. johnson<>
6117<>3890_54<>m. r. garey:hans s. witsenhausen<>the complexity of the generalized lloyd - max problem<>tit<>david s. johnson<>
33093<>4001_0<>nulo<>counting unlabelled three-connected and homeomorphically irreducible two-connected graphs<>jct<>timothy r. s. walsh<>
33098<>4001_5<>nulo<>counting labelled three-connected and homeomorphically irreducible two-connected graphs<>jct<>timothy r. s. walsh<>
27023<>4105_12<>narendra karmarkar<>an efficient approximation scheme for the one-dimensional bin-packing problem<>focs<>richard m. karp<>
27046<>4105_35<>danny dolev:shimon even<>on the security of ping-pong protocols<>iandc<>richard m. karp<>
27047<>4105_36<>danny dolev:shimon even<>on the security of ping-pong protocols<>crypto<>richard m. karp<>
27071<>4105_60<>christos h. papadimitriou<>on linear characterizations of combinatorial optimization problems<>siamcomp<>richard m. karp<>
10985<>4566_8<>nulo<>code optimization considerations in list processing systems<>tse<>hanan samet<>
11029<>4566_52<>sanjay ranade:azriel rosenfeld<>shape approximation using quadtrees<>pr<>hanan samet<>
11313<>4654_1<>masaru kitsuregawa:tohru moto-oka<>relational algebra machine grace<>rims<>hidehiko tanaka<>
862<>4743_19<>leon s. levy<>phrase structure trees bear more fruit than you would have thought<>coling<>aravind k. joshi<>
10143<>4874_1<>robert l. hemminger:alexander k. kelmans<>on 3-skein isomorphisms of graphs<>combinatorica<>heinz adolf jung<>
10146<>4874_4<>robert l. hemminger<>on -skein isomorphisms of graphs<>jct<>heinz adolf jung<>
10797<>5068_9<>grzegorz rozenberg:emo welzl<>chain code picture languages<>gg<>hermann a. maurer<>
10809<>5068_21<>herbert edelsbrunner:franco p. preparata:arnold l. rosenberg:emo welzl:derick wood<>stabbing line segments<>bit<>hermann a. maurer<>
10814<>5068_26<>arto salomaa:derick wood<>dense hierarchies of grammatical families<>jacm<>hermann a. maurer<>
10824<>5068_36<>arto salomaa:derick wood<>finitary and infinitary interpretations of languages<>mst<>hermann a. maurer<>
10825<>5068_37<>herbert edelsbrunner:david g. kirkpatrick<>polygonal intersection searching<>ipl<>hermann a. maurer<>
10834<>5068_46<>grzegorz rozenberg:emo welzl<>using string languages to describe picture languages<>iandc<>hermann a. maurer<>
24943<>5073_13<>brian s. leininger<>the complexity of the equivalence problem for simple loop-free programs<>siamcomp<>oscar h. ibarra<>
24972<>5073_42<>brian s. leininger<>straight-line programs with one input variable<>siamcomp<>oscar h. ibarra<>
24985<>5073_55<>eitan m. gurari<>two-way counter machines and diophantine equations<>jacm<>oscar h. ibarra<>
24995<>5073_65<>eitan m. gurari<>(semi)alternating stack automata<>mst<>oscar h. ibarra<>
25003<>5073_73<>eitan m. gurari<>some simplified undecidable and np-hard problems for simple programs<>tcs<>oscar h. ibarra<>
25030<>5073_100<>brian s. leininger:shlomo moran<>on the complexity of simple arithmetic expressions<>tcs<>oscar h. ibarra<>
25044<>5073_114<>shlomo moran<>on some decision problems for ram programs<>jcss<>oscar h. ibarra<>
21576<>5157_7<>donald f. wann:william j. thomas<>pin limitations and partitioning of vlsi interconnection networks<>tc<>mark a. franklin<>
21580<>5157_11<>donald f. wann<>asynchronous and clocked control structures for vlsi based interconnection networks<>isca<>mark a. franklin<>
2529<>5328_33<>nulo<>response to n. c. rowe's rewiew<>sigmod<>ben shneiderman<>
2542<>5328_46<>glenn thomas<>an architecture for automatic relational database system conversion<>tods<>ben shneiderman<>
24655<>5359_33<>richard a. demillo:michael merritt<>cryptographic protocols<>stoc<>nancy a. lynch<>
24683<>5359_61<>nulo<>multilevel atomicity<>pods<>nancy a. lynch<>
24700<>5359_78<>michael j. fischer:nancy d. griffeth<>global states of a distributed system<>tse<>nancy a. lynch<>
24752<>5359_130<>michael j. fischer<>a lower bound for the time to assure interactive consistency<>ipl<>nancy a. lynch<>
24785<>5359_163<>danny dolev:michael j. fischer:rob fowler:h. raymond strong<>an efficient algorithm for byzantine agreement without authentication<>iandc<>nancy a. lynch<>
15406<>5453_2<>nulo<>closed-form solutions of performability<>tc<>john f. meyer<>
1440<>5647_4<>jia-wei hong<>graphs that are almost binary trees<>siamcomp<>arnold l. rosenberg<>
24833<>6022_25<>shimon even<>on the security of multi-party ping-pong protocols<>crypto<>oded goldreich<>
24837<>6022_29<>shimon even:abraham lempel<>a randomized protocol for signing contracts<>crypto<>oded goldreich<>
15566<>6025_26<>richard j. leblanc<>distributed compilation: a case study<>icdcs<>john a. miller<>
6780<>6091_21<>nulo<>derived preconditions and their use in program synthesis<>cade<>douglas r. smith<>
3010<>6143_1<>clement t. yu:k. lam:s. k. chang<>promising approach to distributed query processing<>berkeley<>c. c. chang<>
7874<>6286_7<>brenda s. baker<>"a two-dimensional bin-packing model of preemptive, fifo storage allocation."<>jal<>edward g. coffman jr.<>
7888<>6286_21<>micha hofri<>on the expected performance of scanning disks<>siamcomp<>edward g. coffman jr.<>
7898<>6286_31<>francois baccelli<>a data base replication analysis using an m/m/m queue with service interruptions<>sigmetrics<>edward g. coffman jr.<>
1633<>6370_51<>nulo<>cache memories<>csur<>alan jay smith<>
18922<>6373_0<>clement t. yu:c. c. chang:s. k. chang<>promising approach to distributed query processing<>berkeley<>k. lam<>
1464<>6481_2<>hermann a. maurer:derick wood<>dense hierarchies of grammatical families<>jacm<>arto salomaa<>
1478<>6481_16<>hermann a. maurer:derick wood<>finitary and infinitary interpretations of languages<>mst<>arto salomaa<>
28391<>6555_10<>clement t. yu:k. lam:c. c. chang<>promising approach to distributed query processing<>berkeley<>s. k. chang<>
28414<>6555_33<>a.-c. liu<>site selection in distributed query processing<>icdcs<>shi-kuo chang<>
1377<>6584_91<>sergiu hart:micha sharir<>termination of probabilistic concurrent programs<>popl<>amir pnueli<>
1381<>6584_95<>mordechai ben-ari:joseph y. halpern<>"deterministic propositional dynamic logic: finite models, complexity, and completeness."<>jcss<>amir pnueli<>
1881<>6684_18<>nulo<>a theorem on polygon cutting with applications<>focs<>bernard chazelle<>
5681<>6707_22<>e. y. yao:frank k. hwang<>a short proof of a result of pollak on steiner minimal trees<>jct<>ding-zhu du<>
5622<>6804_2<>haran boral:dina friedland:nancy f. jarrell:w. kevin wilkinson<>implementation of the database machine direct<>tse<>david j. dewitt<>
2322<>6889_9<>nulo<>principles of package design<>cacm<>bertrand meyer<>
