15802<>0_28<>nulo<>discrete basis and computation of elementary functions<>tc<>jean-michel muller<>
33423<>32_14<>elizabeth e. katz:nora monina panlilio-yap:connie loggia ramsey:shih chang<>characterization of an ada software development<>computer<>victor r. basili<>
33444<>32_35<>douglas d. dunlop<>generalizing specifications for uniformly implemented loops<>toplas<>victor r. basili<>
33455<>32_46<>carl w. doerflinger<>monitoring software development through dynamic variables<>tse<>victor r. basili<>
33456<>32_47<>david h. hutchens<>system structure analysis: clustering with data bindings<>tse<>victor r. basili<>
33482<>32_73<>david m. weiss<>evaluating software development by analysis of changes: some data from the software engineering laboratory<>tse<>victor r. basili<>
6597<>123_9<>r. james firby:thomas dean<>"deadlines, travel time, and robot problem solving."<>ijcai<>david p. miller<>
5774<>153_45<>nulo<>a heuristic approach to program inversion<>ijcai<>david eppstein<>
23703<>333_143<>nulo<>automatic verification of probabilistic concurrent finite-state programs<>focs<>moshe y. vardi<>
22751<>424_4<>herbert edelsbrunner<>batched dynamic solutions to decomposable searching problems<>jal<>mark h. overmars<>
27882<>579_3<>harold n. gabow<>a linear-time algorithm for a special case of disjoint set union<>jcss<>robert endre tarjan<>
27878<>582_14<>nulo<>decomposition by clique separators<>dm<>robert endre tarjan<>
25623<>633_3<>john h. reif<>k-connectivity in random undirected graphs<>dm<>paul g. spirakis<>
25796<>702_60<>daniel m. dias:john t. robinson:balakrishna r. iyer:douglas w. cornell<>modelling of centralized concurrency control in a multi-system environment<>sigmetrics<>philip s. yu<>
25805<>702_69<>daniel m. dias:john t. robinson:balakrishna r. iyer:douglas w. cornell<>distributed concurrency control analysis for data sharing<>cmg<>philip s. yu<>
21559<>750_0<>nancy a. lynch:mike paterson<>impossibility of distributed consensus with one faulty process<>jacm<>michael j. fischer<>
30734<>966_3<>nulo<>on regular and strongly-regular self-complementary graphs<>dm<>s. b. rao<>
31971<>987_11<>peter a. barrett:dave n. halliwell:michael r. moulding<>software fault tolerance: an evaluation<>tse<>tom anderson<>
8260<>1043_0<>nulo<>logic programming<>jar<>fernando c. n. pereira<>
19939<>1265_4<>frank fallside<>dynamic programming in the recognition of connected handwritten script<>caia<>k. h. wong<>
9881<>1292_0<>mark h. overmars<>batched dynamic solutions to decomposable searching problems<>jal<>herbert edelsbrunner<>
9888<>1292_7<>emo welzl<>on the number of line separations of a finite set in the plane<>jct<>herbert edelsbrunner<>
9892<>1292_11<>nulo<>computing the extreme distances between two convex polygons<>jal<>herbert edelsbrunner<>
12707<>1295_8<>sangki han<>kpsp: a knowledge programming system based on prolog<>er<>jung wan cho<>
6195<>1337_0<>elizabeth p. dempsey:roy rogge<>input/output linkage in a user interface management system<>siggraph<>dan r. olsen jr.<>
16128<>1441_2<>pater gacs<>a simple three-dimensional real-time reliable cellular array<>stoc<>john h. reif<>
16149<>1441_23<>gary l. miller<>parallel tree contraction and its application<>focs<>john h. reif<>
16165<>1441_39<>victor y. pan<>efficient parallel solution of linear systems<>stoc<>john h. reif<>
16166<>1441_40<>nulo<>an optimal parallel algorithm for integer sorting<>focs<>john h. reif<>
16172<>1441_46<>paul g. spirakis<>k-connectivity in random undirected graphs<>dm<>john h. reif<>
16210<>1441_84<>j. d. tygar<>efficient parallel pseudo-random number generation<>crypto<>john h. reif<>
16213<>1441_87<>micha sharir<>motion planning in the presence of moving obstacles<>focs<>john h. reif<>
16224<>1441_98<>nulo<>depth-first search is inherently sequential<>ipl<>john h. reif<>
16226<>1441_100<>nulo<>probabilistic algorithms in group theory<>fct<>john h. reif<>
13210<>1465_89<>danny c. sorensen<>a fully parallel algorithm for the symmetric eigenvalue problem<>ppsc<>jack dongarra<>
8217<>1532_44<>chin-long wey<>on a multiprocessor system with dynamic redundancy<>rtss<>fabrizio lombardi<>
8813<>1796_7<>susan landau<>solvability by radicals is in polynomial time<>jcss<>gary l. miller<>
8858<>1796_52<>john h. reif<>parallel tree contraction and its application<>focs<>gary l. miller<>
27705<>1826_1<>nulo<>report on the 1984 distributed artificial intelligence workshop<>aim<>reid g. smith<>
27709<>1826_5<>gilles m. e. lafue<>a modular tool kit for knowledge management<>ijcai<>reid g. smith<>
32447<>1898_30<>shojiro muro:hidehiro miyajima:toshiharu hasegawa<>evaluation of the file redundancy in distributed database systems<>tse<>toshihide ibaraki<>
9224<>1961_45<>xiaolei qian<>data definition facilities of critias<>er<>gio wiederhold<>
27981<>2031_36<>nulo<>graphs without  and well-quasi-ordering<>jct<>robin thomas<>
31265<>2180_34<>peng si ow<>the use of multiple problem decompositions in time constrained planning tasks<>ijcai<>stephen f. smith<>
27838<>2308_97<>nulo<>new layout techniques for entity-relationship diagrams<>er<>roberto tamassia<>
12776<>2394_0<>nulo<>describing prolog by its interpretation and compilation<>cacm<>jacques cohen<>
12778<>2394_2<>stuart kolodner<>estimating the speedup in parallel parsing<>tse<>jacques cohen<>
21504<>2454_0<>anselm blumer:j. blumer:david haussler:andrzej ehrenfeucht:joel i. seiferas<>the smallest automaton recognizing the subwords of a text<>tcs<>m. t. chen<>
21069<>2564_2<>bo zhang<>a weighted technique in heuristic search<>ijcai<>ling zhang<>
33364<>2582_1<>vincent yun shen:stephen m. thebaut:lorri r. paulsen<>identifying error-prone software - an empirical study<>tse<>tze-jie yu<>
31009<>2683_41<>matt kaufmann<>on random models of finite power and monadic logic<>dm<>saharon shelah<>
31024<>2683_56<>yuri gurevich<>fixed-point extensions of first-order logic<>focs<>saharon shelah<>
8925<>2734_41<>jurgen dassow<>on ordered variants of some regulated grammars<>eik<>gheorghe paun<>
4923<>2852_10<>manjai lee:eric fiene:geoffrey brown:nader bagherzadeh<>network facility for a reconfigurable computer architecture<>icdcs<>chuan-lin wu<>
21852<>2854_14<>nulo<>parsing with discontinuous constituents<>acl<>mark johnson<>
4929<>2859_0<>lionel m. ni<>design trade-offs for process scheduling in tightly coupled multiprocessor systems<>icpp<>ching-farn eric wu<>
19604<>3044_85<>cheryl gaimon<>automating resource allocation for the cm* multiprocessor<>icdcs<>karsten schwan<>
13555<>3047_29<>rohit parikh:ashok k. chandra:albert r. meyer<>equations between regular terms and an application to process logic<>siamcomp<>joseph y. halpern<>
13672<>3047_146<>e. allen emerson<>decision procedures and expressiveness in the temporal logic of branching time<>jcss<>joseph y. halpern<>
13686<>3047_160<>nimrod megiddo:ashfaq a. munshi<>optimal precision in the presence of uncertainty<>jc<>joseph y. halpern<>
13698<>3047_172<>john h. williams:edward l. wimmers:timothy c. winkler<>denotational semantics and rewrite rules for fp<>popl<>joseph y. halpern<>
1809<>3117_1<>gopalakrishnan vijayan<>rectilinear graphs and their embeddings<>siamcomp<>avi wigderson<>
5444<>3185_1<>jack n. fenner:jeffrey a. schmidt:houssam a. halabi<>masco: the design of a microprogrammed processor<>computer<>dharma p. agrawal<>
5417<>3189_41<>ja-song leu<>dynamic accessibility testing and path length optimization of multistage interconnection networks<>tc<>dharma p. agrawal<>
20258<>3330_4<>nulo<>applying adaptive algorithms to epistatic domains<>ijcai<>lawrence davis<>
20259<>3330_5<>nulo<>job shop scheduling with genetic algorithms<>icga<>lawrence davis<>
9022<>3580_2<>nulo<>on coordinated selective substitutions: towards a unified theory of grammars and machines<>tcs<>grzegorz rozenberg<>
9033<>3580_13<>andrzej ehrenfeucht<>strong iterative pairs and the regularity of context-free languages<>ita<>grzegorz rozenberg<>
9037<>3580_17<>andrzej ehrenfeucht:r. verraedt<>a combinatorial property of eol languages<>mst<>grzegorz rozenberg<>
9042<>3580_22<>ijsbrand jan aalbersberg<>cts systems and petri nets<>tcs<>grzegorz rozenberg<>
9048<>3580_28<>andrzej ehrenfeucht:h. c. m. kleijn<>adding global forbidding context to context-free grammars<>tcs<>grzegorz rozenberg<>
8291<>3772_30<>gianfranco bilardi<>a minimum area vlsi network for (log ) time sorting<>tc<>franco p. preparata<>
8307<>3772_46<>gianfranco bilardi<>the influence of key length on the area-time complexity of sorting<>icalp<>franco p. preparata<>
8308<>3772_47<>alberto apostolico<>structural properties of the string statistics problem<>jcss<>franco p. preparata<>
8320<>3772_59<>gianfranco bilardi<>the vlsi optimality of the aks sorting network<>ipl<>franco p. preparata<>
2908<>3775_1<>ling zhang<>a weighted technique in heuristic search<>ijcai<>bo zhang<>
32589<>3781_34<>richard wallace:anthony stentz:charles e. thorpe:hans maravec:william whittaker<>first results in robot road-following<>ijcai<>takeo kanade<>
32614<>3781_59<>bruce d. lucas<>optical navigation by the method of differences<>ijcai<>takeo kanade<>
32617<>3781_62<>yuichi ohta<>stereo by two-level dynamic programming<>ijcai<>takeo kanade<>
6104<>3890_41<>m. r. garey<>a 71/60 theorem for bin packing<>jc<>david s. johnson<>
6123<>3890_60<>edward g. coffman jr.:m. r. garey:andrea s. lapaugh<>scheduling file transfers<>siamcomp<>david s. johnson<>
27014<>4105_3<>avi wigderson<>a fast parallel algorithm for the maximal independent set problem<>jacm<>richard m. karp<>
27054<>4105_43<>eli upfal:avi wigderson<>the complexity of parallel computation on matroids<>focs<>richard m. karp<>
27111<>4105_100<>eli upfal:avi wigderson<>are search and decision problems computationally equivalent?<>stoc<>richard m. karp<>
27132<>4105_121<>michael luby<>monte-carlo algorithms for the planar multiterminal network reliability problem<>jc<>richard m. karp<>
6635<>4190_2<>nulo<>reduced instruction set computers<>cacm<>david a. patterson<>
16640<>4240_1<>kayhan talebi<>stochastic network evacuation models<>cor<>james macgregor smith<>
10987<>4566_10<>markku tamminen<>"bintrees, csg trees, and time."<>siggraph<>hanan samet<>
11004<>4566_27<>nulo<>reconstruction of quadtrees from quadtree medial axis transforms<>cvgip<>hanan samet<>
11064<>4566_87<>robert e. webber<>storing a collection of polygons using quadtrees<>tog<>hanan samet<>
11069<>4566_92<>nulo<>data structures for quadtree approximation and compression<>cacm<>hanan samet<>
11094<>4566_117<>nulo<>bidirectional coroutines<>ipl<>hanan samet<>
11321<>4654_9<>shinji kono:t. aoyagi:masahiro fujita<>implementation of temporal logic programming language tokio<>lp<>hidehiko tanaka<>
11323<>4654_11<>shinya fushimi:masaru kitsuregawa:masaya nakayama:tohru moto-oka<>algorithm and performance evaluation of adaptive multidimensional clustering technique<>sigmod<>hidehiko tanaka<>
17470<>4714_3<>mostafa h. ammar<>analysis of broadcast delivery in a videotex system<>tc<>j. w. wong<>
17474<>4714_7<>mostafa h. ammar<>the design of teletext broadcast cycles<>pe<>j. w. wong<>
856<>4743_13<>k. vijay-shanker<>some computational properties of tree adjoining grammars<>acl<>aravind k. joshi<>
24944<>5073_14<>louis e. rosier<>on simple programs with primitive conditional statements<>iandc<>oscar h. ibarra<>
24959<>5073_29<>sam m. kim:shlomo moran<>sequential machine characterizations of trellis and cellular automata and applications<>siamcomp<>oscar h. ibarra<>
24960<>5073_30<>sam m. kim:louis e. rosier<>on space and time efficient tm simulations of some restricted classes of pda's<>iandc<>oscar h. ibarra<>
24971<>5073_41<>michael a. palis:jik h. chang<>on efficient recognition of transductions and relations<>tcs<>oscar h. ibarra<>
25004<>5073_74<>louis e. rosier<>the equivalence problem and correctness formulas for a simple class of programs<>iandc<>oscar h. ibarra<>
25016<>5073_86<>sam m. kim:louis e. rosier<>some characterizations of multihead finite automata<>iandc<>oscar h. ibarra<>
25032<>5073_102<>michael a. palis:sam m. kim<>fast parallel language recognition by cellular automata<>tcs<>oscar h. ibarra<>
24211<>5078_19<>yoshimi egawa<>even edge colorings of a graph<>jct<>noga alon<>
24218<>5078_26<>nulo<>an extremal problem for sets with applications to graph theory<>jct<>noga alon<>
35198<>5082_20<>krithi ramamritham<>distributed scheduling using bidding and focused addressing<>rtss<>wei zhao<>
15611<>5327_26<>gordon d. plotkin<>abstract types have existential type<>popl<>john c. mitchell<>
24628<>5359_6<>michael j. fischer:mike paterson<>impossibility of distributed consensus with one faulty process<>jacm<>nancy a. lynch<>
24756<>5359_134<>michael j. fischer:michael merritt<>easy impossibility proofs for distributed consensus problems<>podc<>nancy a. lynch<>
24832<>6022_24<>shimon even:abraham lempel<>a randomized protocol for signing contracts<>cacm<>oded goldreich<>
15544<>6025_4<>nancy d. griffeth<>performance modeling of database recovery protocols<>tse<>john a. miller<>
6774<>6091_15<>nulo<>top-down synthesis of divide-and-conquer algorithms<>ai<>douglas r. smith<>
6775<>6091_16<>nulo<>the design of divide and conquer algorithms<>scp<>douglas r. smith<>
6781<>6091_22<>nulo<>reasoning by cases and the formation of conditional programs<>ijcai<>douglas r. smith<>
12162<>6165_1<>brian j. reiser:robert g. farrell<>dynamic student modelling in an intelligent tutor for lisp programming<>ijcai<>john r. anderson<>
12168<>6165_7<>c. franklin boyle:gregg yost<>the geometry tutor<>ijcai<>john r. anderson<>
12172<>6165_11<>mark k. singley<>the transfer of text-editing skill<>ijmms<>john r. anderson<>
12154<>6180_2<>geoffrey d. sullivan:keith d. baker<>use of multiple difference-of-gaussian filters to verify geometric models<>ivc<>j. a. d. w. anderson<>
7877<>6286_10<>m. r. garey:david s. johnson:andrea s. lapaugh<>scheduling file transfers<>siamcomp<>edward g. coffman jr.<>
7909<>6286_42<>t. t. kadota:larry a. shepp<>on the asymptotic optimality of first-fit storage allocation<>tse<>edward g. coffman jr.<>
7932<>6286_65<>t. t. kadota:larry a. shepp<>a stochastic model of fragmentation in dynamic storage allocation<>siamcomp<>edward g. coffman jr.<>
7939<>6286_72<>brenda s. baker:dan e. willard<>algorithms for resolving conflicts in dynamic storage allocation<>jacm<>edward g. coffman jr.<>
10015<>6304_4<>masao iri:kazuo murota<>voronoi diagram in the laguerre geometry and its applications<>siamcomp<>hiroshi imai<>
10029<>6304_18<>takao asano:tetsuo asano:leonidas j. guibas:john hershberger<>visibility-polygon search and euclidean shortest paths<>focs<>hiroshi imai<>
1608<>6370_26<>nulo<>disk cache-miss ratio analysis and design considerations<>tocs<>alan jay smith<>
1621<>6370_39<>nulo<>cache evaluation and the impact of workload choice<>isca<>alan jay smith<>
18923<>6373_1<>clement t. yu:cheing-mei suen:m. k. siu<>adaptive record clustering<>tods<>k. lam<>
3812<>6437_6<>scott berman:parag parikh<>computer recognition of two overlapping parts using a single camera<>computer<>c. s. george lee<>
28458<>6555_77<>erland jungert:stefano levialdi:genoveffa tortora:tadao ichikawa<>an image processing language with icon-assisted navigation<>tse<>shi-kuo chang<>
28466<>6555_85<>wu-lung chan<>transformation and verification of office procedures<>tse<>shi-kuo chang<>
40823<>6579_8<>walid a. abu-sufah<>a technique for reducing synchronization overhead in large scale multiprocessors<>isca<>zhiyuan li<>
1323<>6584_37<>nulo<>linear and branching structures in the semantics and logics of reactive systems<>icalp<>amir pnueli<>
1360<>6584_74<>orna lichtenstein:lenore d. zuck<>the glory of the past<>lop<>amir pnueli<>
1380<>6584_94<>nissim francez:orna grumberg:shmuel katz<>proving termination of prolog programs<>lop<>amir pnueli<>
1404<>6584_118<>orna lichtenstein<>checking that finite state concurrent programs satisfy their linear specification<>popl<>amir pnueli<>
19772<>6645_12<>seymour ginsburg<>computation-tuple sequences and object histories: extended abstract<>fodo<>katsumi tanaka<>
3669<>6675_5<>nulo<>the role of proof obligations in software design<>tapsoft<>cliff b. jones<>
1863<>6684_0<>nulo<>how to search in history<>iandc<>bernard chazelle<>
1874<>6684_11<>leonidas j. guibas:d. t. lee<>the power of geometric duality<>bit<>bernard chazelle<>
1904<>6684_41<>nulo<>on the convex layers of a planar set<>tit<>bernard chazelle<>
1912<>6684_49<>nulo<>fast searching in a real algebraic manifold with applications to geometric complexity<>tapsoft<>bernard chazelle<>
1971<>6684_108<>louis monier<>a model of computation for vlsi with related complexity results<>jacm<>bernard chazelle<>
5661<>6707_2<>frank k. hwang:e. y. yao<>the steiner ratio conjecture is true for five points<>jct<>ding-zhu du<>
2325<>6889_12<>nulo<>on formalism in specifications<>software<>bertrand meyer<>
2349<>6889_36<>jean-marc nerson:soon hae ko<>showing programs on a screen<>scp<>bertrand meyer<>
2362<>6889_49<>nulo<>incremental string matching<>ipl<>bertrand meyer<>
2366<>6889_53<>nulo<>the software knowledge base<>icse<>bertrand meyer<>
17026<>6903_23<>nulo<>random sampling with a reservoir<>toms<>jeffrey scott vitter<>
