8513<>26_10<>xiaofeng guo<>hamilton cycles in euler tour graph<>jct<>fuji zhang<>
33429<>32_20<>john d. gannon:elizabeth e. katz<>metrics for ada packages: an initial study<>cacm<>victor r. basili<>
6615<>120_1<>martin farber:gena hahn:pavol hell<>concerning the achromatic number of graphs<>jct<>donald miller<>
6573<>127_14<>gopalan nadathur<>higher-order logic programming<>iclp<>dale miller<>
27144<>201_0<>h. a. carter:p. j. birckbichler<>fluorescent color factor calculation using dbase-ii<>bioinformatics<>r. l. king<>
25445<>299_1<>richard e. zippel:lance a. glasser:charles e. leiserson:john l. wyatt jr.:jonathan allen<>recent results in vlsi cad at mit<>fjcc<>paul penfield jr.<>
23630<>333_70<>ronald fagin:gabriel m. kuper:jeffrey d. ullman<>updating logical databases<>acr<>moshe y. vardi<>
23694<>333_134<>pierre wolper<>automata-theoretic techniques for modal logics of programs<>jcss<>moshe y. vardi<>
34434<>364_0<>chuan-lin wu<>reconfiguration procedures for a polymorphic and partitionable multiprocessor<>tc<>woei lin<>
10125<>368_4<>nulo<>representing knowledge and evidence for decision<>ipmu<>henry e. kyburg jr.<>
19492<>483_12<>philippe nain<>optimal multiplexing of heterogeneous traffic with hard constraint<>sigmetrics<>keith w. ross<>
27888<>573_1<>andrew v. goldberg<>a new approach to the maximum flow problem<>stoc<>robert endre tarjan<>
27885<>576_2<>james r. driscoll:neil sarnak:daniel dominic sleator<>making data structures persistent<>stoc<>robert endre tarjan<>
27866<>582_2<>harold n. gabow:zvi galil:thomas h. spencer<>efficient algorithms for finding minimum spanning trees in undirected and directed graphs<>combinatorica<>robert endre tarjan<>
6281<>594_0<>alfred v. aho<>storing a dynamic sparse table<>focs<>david lee<>
6284<>594_3<>grzegorz w. wasilkowski<>approximation of linear functionals on a banach space with a gaussian measure<>jc<>david lee<>
6292<>594_11<>nulo<>fast multiplication of a recursive block toeplitz matrix by a vector and its application<>jc<>david lee<>
457<>622_39<>nulo<>maximum matchings in a class of random graphs<>jct<>alan m. frieze<>
461<>622_43<>nulo<>on large matchings and cycles in sparse random graphs<>dm<>alan m. frieze<>
25777<>702_41<>balakrishna r. iyer:daniel m. dias<>performability analysis of operation modes of configurable duplex systems<>fjcc<>philip s. yu<>
25798<>702_62<>balakrishna r. iyer:yann-hang lee<>transaction recovery in distributed db/dc systems: a progressive approach<>srds<>philip s. yu<>
25853<>702_117<>douglas w. cornell:daniel m. dias:alexander thomasian<>on coupling partitioned database systems<>icdcs<>philip s. yu<>
25864<>702_128<>balakrishna r. iyer:yann-hang lee<>analysis of recovery protocols in distributed on-line transaction processing systems<>rtss<>philip s. yu<>
25896<>702_160<>douglas w. cornell:daniel m. dias<>analysis of multi-system function request shipping<>icde<>philip s. yu<>
5478<>818_14<>b. chandrasekaran<>knowledge and control for a mechanical design expert system<>computer<>david c. brown<>
31962<>987_2<>nulo<>a structured decision mechanism for diverse software<>srds<>tom anderson<>
22118<>1081_0<>nulo<>synchronized disk interleaving<>tc<>michelle y. kim<>
19963<>1262_3<>mark a. franklin:roger d. chamberlain:b. l. shing<>statistics on logic simulation<>dac<>kenneth f. wong<>
9885<>1292_4<>g. haring:d. hilbert<>rectangular point location in d dimensions with applications<>cj<>herbert edelsbrunner<>
9891<>1292_10<>roman waupotitsch<>computing a ham-sandwich cut in two dimensions<>jsc<>herbert edelsbrunner<>
12700<>1295_1<>seung ryoul maeng<>a control and data flow multiprocessor<>acj<>jung wan cho<>
12714<>1295_15<>seungbeom kim:seungryoul maeng<>a parallel execution model of logic program based on dependency relationship graph<>icpp<>jung wan cho<>
1453<>1411_0<>nulo<>array grammars<>gg<>azriel rosenfeld<>
16138<>1441_12<>nulo<>logarithmic depth circuits for algebraic functions<>siamcomp<>john h. reif<>
16153<>1441_27<>harry r. lewis<>efficient symbolic analysis of programs<>jcss<>john h. reif<>
16168<>1441_42<>victor y. pan<>extension of the parallel nested dissection algorithm to path algebra problems<>fsttcs<>john h. reif<>
16202<>1441_76<>richard e. ladner<>the logic of distributed protocols<>tark<>john h. reif<>
16206<>1441_80<>philip n. klein<>an efficient parallel algorithm for planarity<>focs<>john h. reif<>
16220<>1441_94<>michael ben-or:dexter kozen<>the complexity of elementary algebra and geometry<>jcss<>john h. reif<>
16227<>1441_101<>steven homer<>arithmetic theories for computational complexity problems<>iandc<>john h. reif<>
13229<>1465_108<>ahmed h. sameh:danny c. sorensen<>implementation of some concurrent algorithms for matrix factorization<>pc<>jack dongarra<>
8175<>1532_2<>a. kovaleski:s. ratheal<>an architecture and an interconnection scheme for time-sliced buses in real-time processing<>rtss<>fabrizio lombardi<>
10697<>1596_1<>patrick shen-pei wang<>"a comment on ""a fast parallel algorithm for thinning digital patterns""."<>cacm<>h. e. lu<>
8817<>1796_11<>nulo<>finding small simple cycle separators for 2-connected planar graphs<>jcss<>gary l. miller<>
8856<>1796_50<>eric bach:jeffrey shallit<>"sums of divisors, perfect numbers and factoring."<>siamcomp<>gary l. miller<>
38983<>1870_45<>shmuel zaks<>on the bit complexity of distributed computations in a ring with a leader<>podc<>yishay mansour<>
9590<>1943_125<>jan van leeuwen<>new upperbounds for decentralized extrema-finding in a ring of processors<>stacs<>hans l. bodlaender<>
9180<>1961_1<>xiaolei qian<>knowledge-based integrity constraint validation<>vldb<>gio wiederhold<>
9189<>1961_10<>fred j. friedman:arthur m. keller:john salasin:murray r. berkowitz:david l. spooner<>reference model for ada interfaces to database management systems<>icde<>gio wiederhold<>
9204<>1961_25<>stefano ceri:georg gottlob<>interfacing relational databases and prolog efficiently<>eds<>gio wiederhold<>
9222<>1961_43<>nulo<>letter from the former tc chairperson<>debu<>gio wiederhold<>
4410<>2008_0<>nulo<>the evolution of software performance engineering: a survey<>fjcc<>connie u. smith<>
4426<>2008_16<>nulo<>independent general principles for constructing responsive software systems<>tocs<>connie u. smith<>
24488<>2083_44<>nulo<>detecting multiple faults in cmos circuits<>itc<>niraj k. jha<>
14452<>2148_4<>nulo<>on-line detection of errors in homogeneous multiprocessor systems<>rtss<>jung hwan kim<>
14300<>2170_0<>richard e. zippel:paul penfield jr.:lance a. glasser:charles e. leiserson:jonathan allen<>recent results in vlsi cad at mit<>fjcc<>john l. wyatt jr.<>
41261<>2183_0<>nulo<>some recent advances on the possibility measure theory<>ipmu<>zhenyuan wang<>
27774<>2308_33<>ioannis g. tollis<>centipede graphs and visibility on a cylinder<>wg<>roberto tamassia<>
27831<>2308_90<>ioannis g. tollis<>algorithms for visibility representations of planar graphs<>stacs<>roberto tamassia<>
27841<>2308_100<>carlo batini:enrico nardelli<>a layout algorithm for data flow diagrams<>tse<>roberto tamassia<>
32189<>2379_0<>yoshimi egawa:masatsugu urabe:seiichiro nagoya<>a decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components<>dm<>toshihito fukuda<>
1282<>2662_3<>nulo<>perceptual organization and the representation of natural form<>ai<>alex pentland<>
8961<>2734_77<>nulo<>some recent restrictions in the derivation of context-free grammars<>imycs<>gheorghe paun<>
28097<>2845_5<>iris vessey<>structured tools and conditional logic: an empirical investigation<>cacm<>ron weber<>
4915<>2852_2<>chung-yang chiang<>fail safe distributed fault diagnosis of multiprocessor systems<>icpp<>chuan-lin wu<>
4919<>2852_6<>geoffrey m. brown<>operating system kernel for a reconfigurable multiprocessor system<>icpp<>chuan-lin wu<>
4926<>2852_13<>woei lin<>reconfiguration procedures for a polymorphic and partitionable multiprocessor<>tc<>chuan-lin wu<>
6174<>2855_2<>nulo<>an empirical comparison of priority-queue and event-set implementations<>cacm<>douglas w. jones<>
21875<>2856_1<>terrence c. miller<>"effectiveness of a machine-level, global optimizer."<>sigplan<>mark scott johnson<>
940<>2949_12<>michael stonebraker<>operating system support for data management<>debu<>akhil kumar<>
21301<>2951_0<>tobin j. lehman<>query processing in main memory database management systems<>sigmod<>michael j. carey<>
21302<>2951_1<>tobin j. lehman<>a study of index structures for main memory database management systems<>vldb<>michael j. carey<>
19582<>3044_63<>win bo:prabha gopinath<>"a high-performance, object-based operating system for real-time, robotics applications."<>rtss<>karsten schwan<>
19599<>3044_80<>anita k. jones<>flexible software development for multiple computer systems<>tse<>karsten schwan<>
13546<>3047_20<>ronald fagin:moshe y. vardi<>what can machines know? on the epistemic properties of machines<>aaai<>joseph y. halpern<>
13692<>3047_166<>michael c. loui:albert r. meyer:daniel weise<>on time versus space iii<>mst<>joseph y. halpern<>
13710<>3047_184<>danny dolev:h. raymond strong<>on the possibility and impossibility of achieving clock synchronization<>jcss<>joseph y. halpern<>
34079<>3116_6<>nulo<>coloring planar perfect graphs by decomposition<>combinatorica<>wen-lian hsu<>
6819<>3164_3<>wilf r. lalonde:john r. pugh<>an exemplar based smalltalk<>oopsla<>dave a. thomas<>
1236<>3411_97<>nulo<>lie patterns in search procedures<>tcs<>andrzej pelc<>
30070<>3456_7<>nulo<>binary trees and uniform distribution of traffic cutback<>jcss<>shuo-yen robert li<>
18046<>3526_15<>p. a. subrahmanyam<>a class of confluent term rewriting systems and unification<>jar<>jia-huai you<>
18067<>3526_36<>p. a. subrahmanyam<>e-unification algorithms for a class of confluent term rewriting systems<>icalp<>jia-huai you<>
18069<>3526_38<>p. a. subrahmanyam<>equational logic programming: an extension to equational programming<>popl<>jia-huai you<>
12209<>3570_7<>johan de kleer<>theories of causal ordering<>ai<>john seely brown<>
9023<>3580_3<>nulo<>behaviour of elementary net systems<>ac<>grzegorz rozenberg<>
9024<>3580_4<>emo welzl<>graph theoretic closure properties of the family of boundary nlc graph languages<>acta<>grzegorz rozenberg<>
9029<>3580_9<>emo welzl<>"boundary nlc graph grammars-basic definitions, normal forms, and complexity"<>iandc<>grzegorz rozenberg<>
9035<>3580_15<>dirk janssens:emo welzl<>the bounded degree problem for nlc grammars is decidable<>jcss<>grzegorz rozenberg<>
9045<>3580_25<>andrzej ehrenfeucht:hendrik jan hoogeboom<>on the active and full use of memory in right-boundary grammars and push-down automata<>tcs<>grzegorz rozenberg<>
22418<>3590_18<>luc longpre:paul m. b. vitanyi<>the power of the queue<>coco<>ming li<>
888<>3753_0<>i. tinoco jr.<>a dynamic programming algorithm for finding alternative rna secondary structures<>nar<>a. l. williams jr.<>
889<>3754_0<>ying cheng<>switching classes of directed graphs<>jct<>albert l. wells jr.<>
8272<>3772_11<>helmut alt:torben hagerup:kurt mehlhorn<>deterministic simulation of idealized parallel computers on more realistic ones<>mfcs<>franco p. preparata<>
8281<>3772_20<>kurt mehlhorn:majid sarrafzadeh<>channel routing in knock-knee mode: simplified algorithms and proofs<>algorithmica<>franco p. preparata<>
8287<>3772_26<>gianfranco bilardi<>digital filtering in vlsi<>awoc<>franco p. preparata<>
8288<>3772_27<>bernard chazelle:r. cole:c. yap<>new upper bounds for neighbor searching<>iandc<>franco p. preparata<>
8318<>3772_57<>gianfranco bilardi<>area-time lower-bound techniques with applications to sorting<>algorithmica<>franco p. preparata<>
8349<>3772_88<>kurt mehlhorn<>routing through a rectangle<>jacm<>franco p. preparata<>
8378<>3772_117<>bernard chazelle<>halfspace range search: an algorithmic application of k-sets<>dcg<>franco p. preparata<>
32570<>3781_15<>charles e. thorpe:william whittaker<>autonomous land vehicle project at cmu<>acm<>takeo kanade<>
11282<>3807_0<>yumi iwasaki<>causality in device behavior<>ai<>herbert a. simon<>
11283<>3807_1<>nulo<>whether software engineering needs to be artificially intelligent<>tse<>herbert a. simon<>
38138<>3894_3<>kang g. shin<>optimal checkpointing of real-time tasks<>srds<>yann-hang lee<>
38140<>3894_5<>philip s. yu:balakrishna r. iyer<>transaction recovery in distributed db/dc systems: a progressive approach<>srds<>yann-hang lee<>
38146<>3894_11<>balakrishna r. iyer:philip s. yu<>analysis of recovery protocols in distributed on-line transaction processing systems<>rtss<>yann-hang lee<>
38150<>3894_15<>philip s. yu:simonetta balsamo<>dynamic load sharing in distributed database systems<>fjcc<>yann-hang lee<>
38165<>3894_30<>kang g. shin<>measurement and application of fault latency<>tc<>yann-hang lee<>
39938<>3904_0<>shi xin cheng<>generalization of hadamard matrices and a class of two-dimensional error-correcting codes<>icc<>yu dong yao<>
22592<>3928_2<>kenneth m. kahn:eric dean tribble:daniel g. bobrow<>objects in concurrent logic programming languages<>oopsla<>mark s. miller<>
19277<>3941_0<>nulo<>magic cubes and hypercubes of order 3<>dm<>keh ying lin<>
27088<>4105_77<>sally floyd<>"ffd bin packing for item sizes with distributions on [0,1/2]"<>focs<>richard m. karp<>
27091<>4105_80<>michael e. saks:avi wigderson<>on a search problem related to branch-and-bound procedures<>focs<>richard m. karp<>
27124<>4105_113<>nulo<>"combinatorics, complexity, and randomness."<>cacm<>richard m. karp<>
27136<>4143_1<>m. anwarrudin:ellis e. chang<>a version server for computer-aided design data<>dac<>randy h. katz<>
38055<>4262_0<>venkat srinivasan:a. frank thompson<>abandonment value in capital budgeting: a mathematical programming approach<>cor<>yong h. kim<>
16623<>4284_3<>kent petersson<>program derivation in type theory: a partitioning problem<>cl<>jan m. smith<>
28906<>4494_16<>somprakash bandyopadhyay:chandan mazumdar<>study of a simulated stream machine for dataflow computation<>pe<>sukumar ghosh<>
11098<>4566_121<>randal c. nelson<>a consistent hierarchical representation for vector data<>siggraph<>hanan samet<>
34183<>4613_0<>hong-tai chou<>a unifying framework for version control in a cad environment<>vldb<>won kim<>
5140<>4638_1<>mark c. k. yang:chong-kyo kim:kuo-young cheng:s. s. liu<>automatic curve fitting with quadratic b-spline functions and its applications to computer-assisted animation<>cvgip<>chung-chun yang<>
11325<>4654_13<>martin nilsson<>cyclic tree traversal<>iclp<>hidehiko tanaka<>
2573<>4676_0<>nulo<>varieties of self-reference<>tark<>brian cantwell smith<>
25305<>4710_10<>nulo<>optimal code generation for expressions on super scalar machines<>fjcc<>pradip bose<>
17468<>4714_1<>h. d. dykeman:mostafa h. ammar<>scheduling algorithms for videotex systems under broadcast delivery<>icc<>j. w. wong<>
33044<>4985_22<>hisao tamaki<>old resolution with tabulation<>iclp<>taisuke sato<>
24939<>5073_9<>bala ravikumar<>"on sparseness, ambiguity and other decision problems for acceptors and transducers."<>stacs<>oscar h. ibarra<>
24958<>5073_28<>jik h. chang:michael a. palis<>parallel parsing on a one-way array of finite-state machines<>icpp<>oscar h. ibarra<>
24984<>5073_54<>nulo<>systolic arrays: characterizations and complexity<>mfcs<>oscar h. ibarra<>
25000<>5073_70<>sam m. kim:michael a. palis<>designing systolic algorithms using sequential machines<>tc<>oscar h. ibarra<>
25017<>5073_87<>jik h. chang:moon-jung chung:kotesh k. rao<>systolic tree implementation of data structures<>icpp<>oscar h. ibarra<>
25021<>5073_91<>jik h. chang:anastasios vergis<>on the power of one-way communication<>focs<>oscar h. ibarra<>
25028<>5073_98<>jik h. chang:michael a. palis:bala ravikumar<>on pebble automata<>tcs<>oscar h. ibarra<>
24224<>5078_32<>nulo<>covering graphs by the minimum number of equivalence relations<>combinatorica<>noga alon<>
24237<>5078_45<>micha a. perles<>on the intersection of edges of a geometric graph by straight lines<>dm<>noga alon<>
24248<>5078_56<>kenneth a. berman<>"regular hypergraphs, gordon's lemma, steinitz' lemma and invariant theory."<>jct<>noga alon<>
24256<>5078_64<>nulo<>eigenvalues and expanders<>combinatorica<>noga alon<>
24267<>5078_75<>nulo<>"eigenvalues, geometric expanders, sorting in rounds, and ramsey theory."<>combinatorica<>noga alon<>
22351<>5148_30<>carlo batini:shamkant b. navathe<>a comparative analysis of methodologies for database schema integration<>csur<>maurizio lenzerini<>
21569<>5157_0<>sanjay dhar<>interconnection networks: physical design and performance analysis<>jpdc<>mark a. franklin<>
21574<>5157_5<>roger d. chamberlain<>collecting data about logic simulation<>tcad<>mark a. franklin<>
21578<>5157_9<>sanjay dhar<>on designing interconnection networks for multiprocessors<>icpp<>mark a. franklin<>
21601<>5157_32<>kenneth f. wong:roger d. chamberlain:b. l. shing<>statistics on logic simulation<>dac<>mark a. franklin<>
40689<>5293_6<>harold n. gabow:thomas h. spencer:robert endre tarjan<>efficient algorithms for finding minimum spanning trees in undirected and directed graphs<>combinatorica<>zvi galil<>
2497<>5328_1<>john ewing:simin mehrabanzad:scott sheck:daniel ostroff<>an experimental comparison of a mouse and arrow-jump keys for an interactive encyclopedia<>ijmms<>ben shneiderman<>
2515<>5328_19<>kent l. norman:linda j. weldon<>cognitive layouts of windows and multiple screens for user interfaces<>ijmms<>ben shneiderman<>
2531<>5328_35<>larry koved<>embedded menus: selecting items in context<>cacm<>ben shneiderman<>
24626<>5359_4<>danny dolev:shlomit s. pinter:eugene w. stark:william e. weihl<>reaching approximate agreement in the presence of faults<>jacm<>nancy a. lynch<>
24685<>5359_63<>michael j. fischer:michael merritt<>easy impossibility proofs for distributed consensus problems<>dc<>nancy a. lynch<>
24704<>5359_82<>michael merritt<>introduction to the theory of nested transactions<>icdt<>nancy a. lynch<>
24715<>5359_93<>nulo<>concurrency control for resilient nested transactions<>acr<>nancy a. lynch<>
24733<>5359_111<>barbara t. blaustein:michael siegel<>correctness conditions for highly available replicated databases<>podc<>nancy a. lynch<>
24744<>5359_122<>nancy d. griffeth:michael j. fischer:leonidas j. guibas<>probabilistic analysis of a network resource allocation algorithm<>iandc<>nancy a. lynch<>
24765<>5359_143<>michael j. fischer:michael merritt<>easy impossibility proofs for distributed consensus problems<>ftdc<>nancy a. lynch<>
14164<>5376_24<>david h. laidlaw:w. benjamin trumbore<>constructive solid geometry for polyhedral objects<>siggraph<>john f. hughes<>
24090<>5753_5<>chong-kyo kim:kuo-young cheng:chung-chun yang:s. s. liu<>automatic curve fitting with quadratic b-spline functions and its applications to computer-assisted animation<>cvgip<>mark c. k. yang<>
36472<>5815_4<>ali mili:yu qing<>specification methodology: an integrated relational approach<>spe<>xiaoyang sean wang<>
20027<>5917_31<>w. kent fuchs:jacob a. abraham<>low-cost comparison and diagnosis of large remotely located files<>srds<>kun-lung wu<>
4483<>5972_18<>tzu yungui<>the or-forest description for the execution of logic programs<>iclp<>chengzheng sun<>
24880<>6022_72<>nulo<>two remarks concerning the goldwasser-micali-rivest signature scheme<>crypto<>oded goldreich<>
24918<>6022_110<>shafi goldwasser:silvio micali<>how to construct random functions<>jacm<>oded goldreich<>
12155<>6180_3<>keith d. baker:geoffrey d. sullivan<>'model': a poplog package to support model-based vision<>ivc<>j. a. d. w. anderson<>
7870<>6286_3<>frank thomson leighton<>a provably efficient algorithm for dynamic storage allocation<>stoc<>edward g. coffman jr.<>
7893<>6286_26<>erol gelenbe:edgar n. gilbert<>analysis of a conveyor queue in a flexible manufacturing system<>sigmetrics<>edward g. coffman jr.<>
7925<>6286_58<>edgar n. gilbert<>a continuous polling system with constant service times<>tit<>edward g. coffman jr.<>
7928<>6286_61<>micha hofri<>queueing models of secondary storage devices<>questa<>edward g. coffman jr.<>
7944<>6287_2<>jennifer d. key<>on an infinite class of steiner systems with  = 3 and  = 6<>jct<>e. f. assmus jr.<>
10011<>6304_0<>takao asano:tetsuo asano<>partitioning a polygonal region into trapezoids<>jacm<>hiroshi imai<>
10014<>6304_3<>takao asano:tetsuo asano:leonidas j. guibas:john hershberger<>visibility of disjoint polygons<>algorithmica<>hiroshi imai<>
10018<>6304_7<>takao asano<>efficient algorithms for geometric graph search problems<>siamcomp<>hiroshi imai<>
10023<>6304_12<>david rappaport:godfried t. toussaint<>on computing simple circuits on a set of line segments<>compgeom<>hiroshi imai<>
10030<>6304_19<>masao iri<>a multiplicative barrier function method for linear programming<>algorithmica<>hiroshi imai<>
10031<>6304_20<>masao iri<>computational-geometric methods for polygonal approximations of a curve<>cvgip<>hiroshi imai<>
7608<>6427_1<>e. allen emerson:a. prasad sistla<>automatic verification of finite-state concurrent systems using temporal logic specifications<>toplas<>edmund m. clarke<>
28445<>6555_64<>erland jungert<>a spatial knowledge structure for image information systems using symbolic projections<>fjcc<>shi-kuo chang<>
12095<>6557_38<>anthony j. kusalik<>a logical treatment of secondary storage<>slp<>ian t. foster<>
12096<>6557_39<>steve gregory:graem a. ringwood:ken satoh<>a sequential implementation of parlog<>iclp<>ian t. foster<>
1288<>6584_2<>roni rosner<>a choppy logic<>lics<>amir pnueli<>
1326<>6584_40<>lenore d. zuck<>verification of multiprocess probabilistic protocols<>dc<>amir pnueli<>
1373<>6584_87<>howard barringer:ruurd kuiper<>a really abstract concurrent model and its temporal logic<>popl<>amir pnueli<>
19764<>6645_4<>seymour ginsburg<>computation-tuple sequences and object histories<>tods<>katsumi tanaka<>
3681<>6675_17<>nulo<>software development based on formal methods<>adaEurope<>cliff b. jones<>
1873<>6684_10<>robert l. (scot) drysdale iii:d. t. lee<>computing the largest empty rectangle<>siamcomp<>bernard chazelle<>
1877<>6684_14<>leonidas j. guibas<>fractional cascading: ii. applications<>algorithmica<>bernard chazelle<>
1905<>6684_42<>franco p. preparata<>halfspace range search: an algorithmic application of k-sets<>dcg<>bernard chazelle<>
1938<>6684_75<>nulo<>reporting and counting segment intersections<>jcss<>bernard chazelle<>
1963<>6684_100<>r. cole:franco p. preparata:c. yap<>new upper bounds for neighbor searching<>iandc<>bernard chazelle<>
37562<>6729_1<>albert l. wells jr.<>switching classes of directed graphs<>jct<>ying cheng<>
5626<>6804_6<>robert h. gerber:goetz graefe:michael l. heytens:krishna b. kumar:m. muralikrishna<>gamma - a high performance dataflow database machine<>vldb<>david j. dewitt<>
5631<>6804_11<>michael j. carey:joel e. richardson:eugene j. shekita<>object and file management in the exodus extensible database system<>vldb<>david j. dewitt<>
5642<>6804_22<>michael j. carey:daniel frank:goetz graefe:m. muralikrishna:joel e. richardson:eugene j. shekita<>the architecture of the exodus extensible dbms<>oodbs<>david j. dewitt<>
7361<>6861_12<>toby j. teorey:james p. fry<>a logical design methodology for relational databases using the extended entity-relationship model<>csur<>dongqing yang<>
2355<>6889_42<>nulo<>genericity versus inheritance<>oopsla<>bertrand meyer<>
