33427<>32_18<>barry t. perricone<>software errors and complexity: an empirical investigation<>cacm<>victor r. basili<>
33436<>32_27<>douglas d. dunlop<>a heuristic for deriving loop functions<>tse<>victor r. basili<>
26783<>50_14<>nulo<>a computational theory of the function of clue words in argument understanding<>coling<>robin cohen<>
29367<>278_3<>peter a. ng<>translation of entity-relationship diagrams into relational structures<>jss<>sushil jajodia<>
29372<>278_8<>nulo<>universal and representative instances using unmarked nulls<>fsttcs<>sushil jajodia<>
29376<>278_12<>peter a. ng<>representative instances and gamma-acyclic relational schemes<>tse<>sushil jajodia<>
23607<>333_47<>nulo<>the implication and finite implication problems for typed template dependencies<>jcss<>moshe y. vardi<>
23675<>333_115<>catriel beeri<>formal systems for tuple and equality generating dependencies<>siamcomp<>moshe y. vardi<>
433<>622_15<>trevor i. fenner<>hamiltonian cycles in random regular graphs<>jct<>alan m. frieze<>
12291<>761_22<>caroline carrithers<>training wheels in a user interface<>cacm<>john m. carroll<>
31967<>987_7<>nulo<>can design faults be tolerated?<>icftcs<>t. anderson<>
15389<>1206_0<>joseph a. goguen<>unwinding and inference control<>sp<>jose meseguer<>
9884<>1292_3<>david p. dobkin<>space searching for intersecting objects<>focs<>herbert edelsbrunner<>
9890<>1292_9<>mark h. overmars:raimund seidel<>some methods of computational geometry applied to computer graphics<>cvgip<>herbert edelsbrunner<>
9894<>1292_13<>franz aurenhammer<>an optimal algorithm for constructing the weighted voronoi diagram in the plane<>pr<>herbert edelsbrunner<>
12710<>1295_11<>j. i. kim:seungryul r. maeng<>a relational dataflow database machine based on hierarchical ring network<>fgcs<>jung wan cho<>
16126<>1441_0<>paul g. spirakis<>probabilistic bidding gives optimal distributed resource allocation<>icalp<>john h. reif<>
16208<>1441_82<>paul g. spirakis<>real-time synchronization of interprocess communications<>toplas<>john h. reif<>
16214<>1441_88<>nulo<>the complexity of two-player games of incomplete information<>jcss<>john h. reif<>
16223<>1441_97<>nulo<>on synchronous parallel computations with independent probabilistic choice<>siamcomp<>john h. reif<>
16228<>1441_102<>nulo<>symmetric complementation<>jacm<>john h. reif<>
16999<>1710_0<>arthur m. keller<>on complementary and independent mappings on databases<>sigmod<>jeffrey d. ullman<>
8806<>1796_0<>daniel kornhauser:paul g. spirakis<>"coordinating pebble motion on graphs, the diameter of permutation groups, and applications"<>focs<>gary l. miller<>
8811<>1796_5<>ravindran kannan:larry rudolph<>sublinear parallel algorithm for computing the greatest common divisor of two integers<>focs<>gary l. miller<>
8828<>1796_22<>nulo<>finding small simple cycle separators for 2-connected planar graphs<>stoc<>gary l. miller<>
27706<>1826_2<>nulo<>on the development of commercial expert systems<>aim<>reid g. smith<>
9188<>1961_9<>shamkant b. navathe:stefano ceri:jinglie dou<>vertical partitioning algorithms for database design<>tods<>gio wiederhold<>
9210<>1961_31<>francisco corella:s. jerrold kaplan:lena yesil<>cooperative responses to boolean queries<>icde<>gio wiederhold<>
9233<>1961_54<>nulo<>knowledge and database management<>software<>gio wiederhold<>
27917<>1997_27<>thomas a. standish<>steps to an advanced ada programming environment<>icse<>richard n. taylor<>
16265<>2037_8<>r. smith<>performance analysis of strategies for moving mesh control<>cmg<>j. saltz<>
27776<>2308_35<>carlo batini:maurizio talamo<>computer aided layout of entity relationship diagrams<>jss<>roberto tamassia<>
12781<>2394_5<>timothy j. hickey<>performance analysis of on-the-fly garbage collection<>cacm<>jacques cohen<>
12787<>2394_11<>francis giannesini<>parser generation and grammar manipulation using prolog's infinite trees<>jlp<>jacques cohen<>
26742<>2569_0<>nulo<>location problems with costs being sums of powers of euclidean distances<>cor<>reuven chen<>
1853<>2618_2<>ernest j. cockayne<>the irredundance number and maximum degree of a graph<>dm<>bala bollobas<>
31080<>2683_112<>nulo<>more on proper forcing<>jsyml<>saharon shelah<>
4918<>2852_5<>manjai lee<>performance analysis of circuit switching baseline interconnection networks<>isca<>chuan-lin wu<>
21841<>2854_3<>nulo<>a discovery procedure for certain phonological rules<>coling<>mark johnson<>
6172<>2855_0<>nulo<>improved interpretation of unix-like file names embedded in data<>cacm<>douglas w. jones<>
13538<>3047_12<>yoram moses<>towards a theory of knowledge and ignorance: preliminary report<>nmr<>joseph y. halpern<>
13603<>3047_77<>danny dolev:h. raymond strong<>on the possibility and impossibility of achieving clock synchronization<>stoc<>joseph y. halpern<>
13611<>3047_85<>danny dolev:barbara simons:h. raymond strong<>a new look at fault tolerant network routing<>stoc<>joseph y. halpern<>
13694<>3047_168<>albert r. meyer:boris a. trakhtenbrot<>"the semantics of local storage, or what makes the free-list free?"<>popl<>joseph y. halpern<>
13717<>3047_191<>yoram moses<>knowledge and common knowledge in a distributed environment<>podc<>joseph y. halpern<>
13721<>3047_195<>david a. mcallester<>"likelihood, probability, and knowledge."<>aaai<>joseph y. halpern<>
13725<>3047_199<>barbara simons:h. raymond strong:danny dolev<>fault-tolerant clock synchronization<>podc<>joseph y. halpern<>
13739<>3047_213<>nulo<>a good hoare axiom system for an algol-like language<>popl<>joseph y. halpern<>
5400<>3189_24<>ja-song leu<>dynamic accessibility testing and path length optimization of multistage interconnection networks<>icdcs<>dharma p. agrawal<>
4350<>3195_31<>michael sipser<>communication complexity<>jcss<>christos h. papadimitriou<>
16253<>3383_0<>nulo<>editor's introduction<>jlp<>john alan robinson<>
1186<>3411_47<>nulo<>idempotent ideals on abelian groups<>jsyml<>andrzej pelc<>
18060<>3526_29<>p. a. subrahmanyam<>conceptual basis and evaluation strategies for integrating functional and logic programming<>slp<>jia-huai you<>
12204<>3570_2<>douglas b. lenat<>why am and eurisko appear to work<>ai<>john seely brown<>
12208<>3570_6<>johan de kleer<>a qualitative physics based on confluences<>ai<>john seely brown<>
9026<>3580_6<>andrzej ehrenfeucht:david haussler<>on ambiguity in dos systems<>ita<>grzegorz rozenberg<>
9041<>3580_21<>andrzej ehrenfeucht:michael g. main<>restrictions on nlc graph grammars<>tcs<>grzegorz rozenberg<>
8277<>3772_16<>gianfranco bilardi<>a minimum area vlsi network for o(log n) time sorting<>stoc<>franco p. preparata<>
8304<>3772_43<>d. t. lee<>computational geometry - a survey<>tc<>franco p. preparata<>
8326<>3772_65<>kurt mehlhorn<>area-time optimal vlsi integer multiplier with minimum computation time<>icalp<>franco p. preparata<>
8337<>3772_76<>witold lipski jr.<>optimal three-layer channel routing<>tc<>franco p. preparata<>
8343<>3772_82<>gianfranco bilardi<>an architecture for bitonic sorting with optimal vlsi performance<>tc<>franco p. preparata<>
8363<>3772_102<>nulo<>vlsi algorithms and architectures<>mfcs<>franco p. preparata<>
6082<>3890_19<>s. f. assmann:daniel j. kleitman:joseph y.-t. leung<>on a dual version of the one-dimensional bin packing problem<>jal<>david s. johnson<>
6105<>3890_42<>anthony c. klug<>testing containment of conjunctive queries under functional and inclusion dependencies<>jcss<>david s. johnson<>
38143<>3894_8<>kang g. shin<>"error detection process - model, design, and its impact on computer performance."<>tc<>yann-hang lee<>
38162<>3894_27<>kang g. shin<>evaluation of error recovery blocks used for cooperating processes<>tse<>yann-hang lee<>
27089<>4105_78<>avi wigderson<>a fast parallel algorithm for the maximal independent set problem<>stoc<>richard m. karp<>
38769<>4245_4<>nulo<>on the number of rooted -nets<>jct<>yanpei liu<>
10982<>4566_5<>nulo<>the quadtree and related hierarchical data structures<>csur<>hanan samet<>
11023<>4566_46<>nulo<>algorithms for the conversion of quadtrees to rasters<>cvgip<>hanan samet<>
11042<>4566_65<>azriel rosenfeld:clifford a. shaffer:robert e. webber<>a geographic information system using quadtrees<>pr<>hanan samet<>
11111<>4566_134<>jack r. buchanan:richard d. fennell<>a database management system for the federal courts<>tods<>hanan samet<>
11331<>4654_19<>tohru moto-oka:hitoshi aida:keiji hirata:tsutomu maruyama<>the architecture of a parallel inference engine - pie<>fgcs<>hidehiko tanaka<>
2575<>4676_2<>nulo<>reflection and semantics in lisp<>popl<>brian cantwell smith<>
25306<>4710_11<>edward s. davidson<>design of instruction set architectures for support of high-level languages<>isca<>pradip bose<>
17488<>4714_21<>p. m. gopal<>analysis of a token ring protocol for voice transmission<>cn<>j. w. wong<>
855<>4743_12<>bonnie l. webber:ralph m. weischedel<>default reasoning in interaction<>nmr<>aravind k. joshi<>
858<>4743_15<>bonnie l. webber:ralph m. weischedel<>preventing false inferences<>coling<>aravind k. joshi<>
30299<>4780_1<>nulo<>partial difference sets<>dm<>s. l. ma<>
33034<>4985_12<>hisao tamaki<>enumeration of success patterns in logic programs<>tcs<>taisuke sato<>
33045<>4985_23<>hisao tamaki<>unfold/fold transformation of logic programs<>iclp<>taisuke sato<>
18666<>5063_0<>j. m. sobieski:j. c. filiatreau:m. h. pickett:george e. fox<>16s rrna oligonucleotide catalog data base<>nar<>k. n. chen<>
10793<>5068_5<>walter bucher:karel culik ii<>context-free complexity of finite languages<>tcs<>hermann a. maurer<>
24936<>5073_6<>brian s. leininger:louis e. rosier<>a note on the complexity of program evaluation<>mst<>oscar h. ibarra<>
24949<>5073_19<>sam m. kim<>characterizations and computational complexity of systolic trellis automata<>tcs<>oscar h. ibarra<>
25006<>5073_76<>michael a. palis:sam m. kim<>designing systolic algorithms using sequential machines<>focs<>oscar h. ibarra<>
25045<>5073_115<>sam m. kim<>a characterization of systolic binary tree automata and applications<>acta<>oscar h. ibarra<>
24193<>5078_1<>s. friedland:gil kalai<>every 4-regular graph plus an edge contains a 3-regular subgraph<>jct<>noga alon<>
24247<>5078_55<>nulo<>a note on subdigraphs of digraphs with large outdegrees<>dm<>noga alon<>
24277<>5078_85<>s. friedland:gil kalai<>regular subgraphs of almost regular graphs<>jct<>noga alon<>
22374<>5148_53<>carlo batini<>a methodology for data schema integration in the entity relationship model<>tse<>maurizio lenzerini<>
15597<>5327_12<>cynthia dwork:paris c. kanellakis<>on the sequential nature of unification<>jlp<>john c. mitchell<>
2523<>5328_27<>matthew powers:conda lashley:pamela sanchez<>an experimental comparison of tabular and graphic data presentation<>ijmms<>ben shneiderman<>
5234<>5347_0<>c. c. chang<>distributed query processing<>csur<>clement t. yu<>
24676<>5359_54<>jennifer lundelius<>a new fault-tolerant algorithm for clock synchronization<>podc<>nancy a. lynch<>
24737<>5359_115<>jennifer lundelius<>an upper and lower bound for clock synchronization<>iandc<>nancy a. lynch<>
34677<>5450_19<>c. v. ramamoorthy:atul prakash:yutaka usuda<>software engineering: problems and perspectives<>computer<>wei-tek tsai<>
15412<>5453_8<>david g. furchtgott<>a performability solution method for degradable nonrepairable systems<>tc<>john f. meyer<>
8681<>5648_24<>nulo<>concurrent processing for scientific calculations<>compcon<>geoffrey charles fox<>
8701<>5650_0<>j. m. sobieski:k. n. chen:j. c. filiatreau:m. h. pickett<>16s rrna oligonucleotide catalog data base<>nar<>george e. fox<>
28533<>5729_4<>thang bui:frank thomson leighton:michael sipser<>graph bisection algorithms with good average case behavior<>focs<>soma chaudhuri<>
25397<>5991_7<>nulo<>the pragmatics of referring and the modality of communication<>coling<>philip r. cohen<>
25405<>5991_15<>nulo<>referring as requesting<>coling<>philip r. cohen<>
15540<>6025_0<>nancy d. griffeth<>performance modeling of database recovery protocols<>srds<>john a. miller<>
6770<>6091_11<>nulo<>random trees and the analysis of branch and bound procedures<>jacm<>douglas r. smith<>
3009<>6143_0<>clement t. yu<>distributed query processing<>csur<>c. c. chang<>
12167<>6165_6<>nulo<>cognitive psychology<>ai<>john r. anderson<>
7875<>6286_8<>a. robert calderbank:leopold flatto<>optimum head separation in a disk system with two read/write heads<>jacm<>edward g. coffman jr.<>
7880<>6286_13<>nulo<>recent progress in the performance evaluation of fundamental allocation algorithms<>sigmetrics<>edward g. coffman jr.<>
7901<>6286_34<>brenda s. baker<>insertion and compaction algorithms in sequentially allocated storage<>siamcomp<>edward g. coffman jr.<>
10028<>6304_17<>takao asano<>dynamic segment intersection search with applications<>focs<>hiroshi imai<>
1590<>6370_8<>mark d. hill<>experimental evaluation of on-chip microprocessor cache memories<>isca<>alan jay smith<>
1599<>6370_17<>johnny f. k. lee<>branch prediction strategies and branch target buffer design<>computer<>alan jay smith<>
21823<>6571_1<>motoaki iwasaki:kenichi taniguchi:tadao kasami<>membership problems for data dependencies in relational expressions<>tcs<>minoru ito<>
1298<>6584_12<>howard barringer:ruurd kuiper<>now you may compose temporal logic specifications<>stoc<>amir pnueli<>
1307<>6584_21<>micha sharir:sergiu hart<>verification of probabilistic programs<>siamcomp<>amir pnueli<>
1311<>6584_25<>zohar manna<>adequate proof principles for invariance and liveness properties of concurrent programs<>scp<>amir pnueli<>
1318<>6584_32<>lenore d. zuck<>verification of multiprocess probabilistic protocols<>podc<>amir pnueli<>
1339<>6584_53<>dennis shasha:w. ewald<>temporal verification of carrier-sense local area network protocols<>popl<>amir pnueli<>
1350<>6584_64<>dorit ron:flavia rosemberg<>a hardware implementation of the csp primitives and its verification<>icalp<>amir pnueli<>
1393<>6584_107<>krzysztof r. apt:jonathan stavi<>fair termination revisited-with delay<>tcs<>amir pnueli<>
19768<>6645_8<>seymour ginsburg<>interval queries on object histories: extended abstract<>vldb<>katsumi tanaka<>
3671<>6675_7<>howard barringer:j. h. cheng<>a logic covering undefinedness in program proofs<>acta<>cliff b. jones<>
1911<>6684_48<>nulo<>computing on a free tree via complexity-preserving mappings<>focs<>bernard chazelle<>
1916<>6684_53<>nulo<>computational geometry on a systolic chip<>tc<>bernard chazelle<>
1925<>6684_62<>robert l. (scot) drysdale iii:d. t. lee<>computing the largest empty rectangle<>stacs<>bernard chazelle<>
1952<>6684_89<>thomas ottmann:eljas soisalon-soininen:derick wood<>the complexity and decidability of separation<>icalp<>bernard chazelle<>
1957<>6684_94<>janet incerpi<>triangulation and shape-complexity<>tog<>bernard chazelle<>
1970<>6684_107<>nulo<>convex partitions of polyhedra: a lower bound and worst-case optimal algorithm<>siamcomp<>bernard chazelle<>
1972<>6684_109<>janet incerpi<>computing the connected components of d-ranges<>eatcs<>bernard chazelle<>
5632<>6804_12<>haran boral<>a methodology for database system performance evaluation<>sigmod<>david j. dewitt<>
