33409<>32_0<>robert w. reiter jr.<>a controlled experiment quantitatively comparing software development approaches<>tse<>victor r. basili<>
33422<>32_13<>j. w. bailey<>a meta-model for software development resource expenditures<>icse<>victor r. basili<>
33451<>32_42<>karl freburger<>programming measurement and estimation in the software engineering laboratory<>jss<>victor r. basili<>
23648<>333_88<>catriel beeri<>the implication problem for data dependencies<>icalp<>moshe y. vardi<>
22781<>424_34<>jan van leeuwen<>some principles for dynamizing decomposable searching problems<>ipl<>mark h. overmars<>
22800<>424_53<>jan van leeuwen<>maintenance of configurations in the plane<>jcss<>mark h. overmars<>
22812<>424_65<>nulo<>dynamization of order decomposable set problems<>jal<>mark h. overmars<>
22820<>424_73<>jan van leeuwen<>the art of dynamizing<>mfcs<>mark h. overmars<>
22836<>424_89<>jan van leeuwen<>worst-case optimal insertion and deletion methods for decomposable searching problems<>ipl<>mark h. overmars<>
23542<>1022_0<>nulo<>operating system support for database management<>cacm<>michael stonebraker<>
9887<>1292_6<>hermann a. maurer<>on the intersection of orthogonal objects<>ipl<>herbert edelsbrunner<>
34390<>1394_1<>shuo-yen robert li<>independence numbers of graphs and generators of ideals<>combinatorica<>wen-ch'ing winnie li<>
16163<>1441_37<>paul g. spirakis<>distributed algorithms for synchronizing interprocess communication within real time<>stoc<>john h. reif<>
32428<>1898_11<>naoki katoh:h. mine<>an algorithm for finding k minimum spanning trees<>siamcomp<>toshihide ibaraki<>
32488<>1898_71<>tsunehiko kameda:shunichi toida<>on minimal test sets for locating single link failures in networks<>tc<>toshihide ibaraki<>
31357<>1959_18<>nulo<>a survey and taxonomy of database machines<>debu<>s. w. song<>
9228<>1961_49<>s. jerrold kaplan:daniel sagalowicz<>research in knowledge base management systems<>sigmod<>gio wiederhold<>
12783<>2394_7<>nulo<>garbage collection of linked data structures<>csur<>jacques cohen<>
1852<>2618_1<>paul a. catlin<>topological cliques of random graphs<>jct<>bala bollobas<>
1858<>2618_7<>nulo<>degree sequences of random graphs<>dm<>bala bollobas<>
31056<>2683_88<>nulo<>canonization theorems and applications<>jsyml<>saharon shelah<>
7232<>2749_1<>hermann a. maurer:arto salomaa<>synchronized eol forms under uniform interpretation<>ita<>derick wood<>
7234<>2749_3<>hermann a. maurer:arto salomaa<>uniform interpretations of grammar forms<>siamcomp<>derick wood<>
7238<>2749_7<>hermann a. maurer:arto salomaa<>completeness of context-free grammar forms<>jcss<>derick wood<>
7240<>2749_9<>hermann a. maurer:arto salomaa<>on predecessors of finite languages<>iandc<>derick wood<>
21874<>2856_0<>nulo<>dispel: a run-time debugging language<>cl<>mark scott johnson<>
13667<>3047_141<>albert r. meyer<>"axiomatic definitions of programming languages, ii."<>popl<>joseph y. halpern<>
13713<>3047_187<>ashok k. chandra:albert r. meyer:rohit parikh<>equations between regular terms and an application to process logic<>stoc<>joseph y. halpern<>
34074<>3116_1<>george l. nemhauser<>algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs<>dm<>wen-lian hsu<>
30053<>3227_0<>gary i. green:chang s. kim<>a multiple criteria model for the location-allocation problem<>cor<>sang m. lee<>
27730<>3335_1<>nulo<>planning horizons for the deterministic capacity problem<>cor<>robert l. smith<>
30064<>3456_1<>wen-ch'ing winnie li<>independence numbers of graphs and generators of ideals<>combinatorica<>shuo-yen robert li<>
9040<>3580_20<>andrzej ehrenfeucht:rohit parikh<>pumping lemmas for regular sets<>siamcomp<>grzegorz rozenberg<>
9044<>3580_24<>andrzej ehrenfeucht<>fpol systems generating counting languages<>ita<>grzegorz rozenberg<>
9047<>3580_27<>nulo<>on subwords of formal languages<>fct<>grzegorz rozenberg<>
8270<>3772_9<>nulo<>a new approach to planar point location<>siamcomp<>franco p. preparata<>
8289<>3772_28<>witold lipski jr.<>efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems<>acta<>franco p. preparata<>
8331<>3772_70<>jean vuillemin<>the cube-connected cycles: a versatile network for parallel computation<>cacm<>franco p. preparata<>
8347<>3772_86<>jean vuillemin<>area-time optimal vlsi networks for computing integer multiplications and discrete fourier transform<>icalp<>franco p. preparata<>
8351<>3772_90<>witold lipski jr.<>"segments, rectangles, contours."<>jal<>franco p. preparata<>
8368<>3772_107<>kenneth j. supowit<>testing a simple polygon for monotonicity<>ipl<>franco p. preparata<>
32644<>3779_0<>bruce d. lucas<>an iterative image registration technique with an application to stereo vision<>ijcai<>takeo kanade<>
32608<>3781_53<>haruhiko asada<>design concept of direct-drive manipulators using rare-earth dc torque motors<>ijcai<>takeo kanade<>
13296<>3841_0<>gilberto file<>passes and paths of attributive grammars<>iandc<>joost engelfriet<>
6101<>3890_38<>m. r. garey:barbara b. simons:robert endre tarjan<>scheduling unit-time tasks with arbitrary release times and deadlines<>siamcomp<>david s. johnson<>
14261<>3994_1<>nulo<>the shomotopy bottle of q-analysis<>ijmms<>j. h. johnson<>
27045<>4105_34<>michael sipser<>maximum matchings in sparse random graphs<>focs<>richard m. karp<>
27072<>4105_61<>manuel blum:oliver vornberger:christos h. papadimitriou:mihalis yannakakis<>the complexity of testing whether a graph is a superconcentrator<>ipl<>richard m. karp<>
6637<>4190_4<>carlo h. sequin<>risc i: a reduced instruction set vlsi computer<>isca<>david a. patterson<>
12574<>4527_4<>larry e. stanfel<>a counter-example to a clustering heuristic<>is<>j. y. chen<>
11053<>4566_76<>nulo<>connected component labeling using quadtrees<>jacm<>hanan samet<>
11073<>4566_96<>nulo<>experience with software conversion<>spe<>hanan samet<>
17471<>4714_4<>gita gopal<>delay analysis of broadcast routing in packet-switching networks<>tc<>j. w. wong<>
11257<>4800_0<>nulo<>prometheus or pandora: the influence of automation on society<>computer<>herbert a. simon<>
10145<>4874_3<>nulo<>a note on fragments of infinite graphs<>combinatorica<>heinz adolf jung<>
10795<>5068_7<>arto salomaa:derick wood<>completeness of context-free grammar forms<>jcss<>hermann a. maurer<>
10801<>5068_13<>herbert edelsbrunner<>on the intersection of orthogonal objects<>ipl<>hermann a. maurer<>
10804<>5068_16<>arto salomaa:derick wood<>synchronized eol forms under uniform interpretation<>ita<>hermann a. maurer<>
10805<>5068_17<>arto salomaa:derick wood<>uniform interpretations of grammar forms<>siamcomp<>hermann a. maurer<>
10818<>5068_30<>ivan hal sudborough:emo welzl<>on the complexity of the general coloring problem<>iandc<>hermann a. maurer<>
10822<>5068_34<>walter bucher:karel culik ii:detlef wotschke<>concise description of finite languages<>tcs<>hermann a. maurer<>
10828<>5068_40<>arto salomaa:derick wood<>on predecessors of finite languages<>iandc<>hermann a. maurer<>
24938<>5073_8<>louis e. rosier<>on restricted one-counter machines<>mst<>oscar h. ibarra<>
24969<>5073_39<>brian s. leininger<>characterizations of presburger functions<>siamcomp<>oscar h. ibarra<>
24973<>5073_43<>eitan m. gurari<>two-way counter machines and diophantine equations<>focs<>oscar h. ibarra<>
24996<>5073_66<>shlomo moran<>deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication<>ipl<>oscar h. ibarra<>
25007<>5073_77<>eitan m. gurari<>the complexity of the equivalence problem for simple programs<>jacm<>oscar h. ibarra<>
25018<>5073_88<>brian s. leininger:shlomo moran<>on the complexity of simple arithmetic expressions<>icalp<>oscar h. ibarra<>
25019<>5073_89<>louis e. rosier<>on the decidability of equivalence for deterministic pushdown transducers<>ipl<>oscar h. ibarra<>
25034<>5073_104<>shlomo moran:louis e. rosier<>probabilistic algorithms and straight-line programs for some rank decision problems<>ipl<>oscar h. ibarra<>
25053<>5073_123<>eitan m. gurari<>the complexity of decision problems for finite-turn multicounter machines<>icalp<>oscar h. ibarra<>
25059<>5073_129<>eitan m. gurari<>the complexity of decision problems for finite-turn multicounter machines<>jcss<>oscar h. ibarra<>
21591<>5157_22<>norman l. soong<>one-dimensional optimization on multiprocessor systems<>tc<>mark a. franklin<>
21592<>5157_23<>nulo<>vlsi performance comparison of banyan and crossbar communications networks<>tc<>mark a. franklin<>
24640<>5359_18<>allan borodin:leonidas j. guibas:andrew chi-chih yao<>efficient searching using partial ordering<>ipl<>nancy a. lynch<>
24668<>5359_46<>edward k. blum<>relative complexity of algebras<>mst<>nancy a. lynch<>
24675<>5359_53<>eshrat arjomandi:michael j. fischer<>a difference in efficiency between synchronous and asynchronous systems<>stoc<>nancy a. lynch<>
24688<>5359_66<>michael j. fischer<>on describing the behavior and implementation of distributed systems<>tcs<>nancy a. lynch<>
24689<>5359_67<>michael j. fischer:leonidas j. guibas:nancy d. griffeth<>optimal placement of identical resources in a distributed network<>icdcs<>nancy a. lynch<>
24707<>5359_85<>nulo<>upper bounds for static resource allocation in a distributed system<>jcss<>nancy a. lynch<>
24757<>5359_135<>allan borodin:michael j. fischer:david g. kirkpatrick:martin tompa<>a time-space tradeoff for sorting on non-oblivious machines<>jcss<>nancy a. lynch<>
6761<>6091_2<>nulo<>a design for an automatic programming system<>ijcai<>douglas r. smith<>
12164<>6165_3<>nulo<>tuning of search of the problem space for geometry proofs<>ijcai<>john r. anderson<>
12169<>6165_8<>nulo<>a theory of language acquisition based on general learning principles<>ijcai<>john r. anderson<>
28119<>6206_1<>nulo<>a procedure for ordering fuzzy subsets of the unit interval<>isci<>ronald r. yager<>
7938<>6286_71<>erol gelenbe:brigitte plateau<>optimization of the number of copies in a distributed data base<>tse<>edward g. coffman jr.<>
1601<>6370_19<>nulo<>long term file migration: development and evaluation of algorithms<>cacm<>alan jay smith<>
1612<>6370_30<>nulo<>internal scheduling and memory contention<>tse<>alan jay smith<>
1627<>6370_45<>nulo<>analysis of long term file reference patterns for application to file migration algorithms<>tse<>alan jay smith<>
18924<>6373_2<>clement t. yu<>an approach to probabilistic retrieval<>sigir<>k. lam<>
1463<>6481_1<>hermann a. maurer:derick wood<>completeness of context-free grammar forms<>jcss<>arto salomaa<>
1466<>6481_4<>hermann a. maurer:derick wood<>on predecessors of finite languages<>iandc<>arto salomaa<>
1467<>6481_5<>hermann a. maurer:derick wood<>synchronized eol forms under uniform interpretation<>ita<>arto salomaa<>
1474<>6481_12<>hermann a. maurer:derick wood<>uniform interpretations of grammar forms<>siamcomp<>arto salomaa<>
25510<>6484_9<>j. l. lloyd:santosh k. shrivastava<>"some critical comments on the paper ""an optimal approach to fault tolerant software systems design"" by gannon and shapiro."<>tse<>peter a. lee<>
1293<>6584_7<>nulo<>the temporal semantics of concurrent programs<>tcs<>amir pnueli<>
1306<>6584_20<>david harel:jonathan stavi<>propositional dynamic logic of context-free programs<>focs<>amir pnueli<>
1308<>6584_22<>mordechai ben-ari:zohar manna<>the temporal logic of branching time<>popl<>amir pnueli<>
1337<>6584_51<>r. zarhi<>realizing an equational specification<>icalp<>amir pnueli<>
1351<>6584_65<>daniel j. lehmann:jonathan stavi<>"impartiality, justice and fairness: the ethics of concurrent termination."<>icalp<>amir pnueli<>
1369<>6584_83<>giora slutzki<>automatic programming of finite state linear programs<>siamcomp<>amir pnueli<>
1398<>6584_112<>zohar manna<>verification of concurrent programs: temporal proof principles<>lop<>amir pnueli<>
19763<>6645_3<>yahiko kambayashi<>testing of join dependency preserving by a modified chase method<>mfcs<>katsumi tanaka<>
19769<>6645_9<>yahiko kambayashi<>logical integration of locally independent relational databases into a distributed database<>vldb<>katsumi tanaka<>
19771<>6645_11<>nulo<>tree-structured data organization with consecutive retrieval property<>fodo<>katsumi tanaka<>
1935<>6684_72<>louis monier<>a model of computation for vlsi with related complexity results<>stoc<>bernard chazelle<>
32524<>6765_0<>eiichi bannai<>regular graphs with excess one<>dm<>tatsuro ito<>
