15792<>0_18<>jean duprat<>hardwired polynomial evaluation<>jpdc<>jean-michel muller<>
25146<>25_84<>micha sharir<>"red-blue intersection detection algorithms, with applications to motion planning and collision detection."<>compgeom<>pankaj k. agarwal<>
8507<>26_4<>zhibo chen<>bounds of the longest directed cycle length for minimal strong digraphs<>dm<>fuji zhang<>
33446<>32_37<>h. dieter rombach<>the tame project: towards improvement-oriented software environments<>tse<>victor r. basili<>
26781<>50_12<>fei song<>the interpretation of temporal relations in narrative<>aaai<>robin cohen<>
26757<>53_12<>adrian segall<>a distributed query protocol for high-speed networks<>iccc<>reuven cohen<>
18796<>55_2<>hiroyuki seki:hikaru yagi<>analysis of functional programs to detect run-time garbage cells<>toplas<>katsuro inoue<>
18773<>57_19<>nulo<>problem solving with hypothetical reasoning<>fgcs<>katsumi inoue<>
34561<>98_2<>xiao wang<>parallel join algorithms on a network of workstations<>dpds<>w. s. luk<>
6614<>120_0<>roland haggkvist:pavol hell:victor neumann-lara<>on multiplicative graphs and the product conjecture<>combinatorica<>donald j. miller<>
6567<>127_8<>amy p. felty<>specifying theorem provers in a higher-order logic programming language<>cade<>dale miller<>
6571<>127_12<>john hannan<>uses of higher-order unification for implementing program transformers<>iclp<>dale miller<>
5730<>153_1<>nulo<>reset sequences for finite automata with application to design of parts orienters<>icalp<>david eppstein<>
5880<>153_151<>zvi galil:raffaele giancarlo<>speeding up dynamic programming<>focs<>david eppstein<>
27143<>203_1<>nulo<>letter from the editor<>debu<>roger king<>
29165<>280_6<>david mutchler<>integrating static and dynamic voting protocols to enhance file availability<>icde<>sushil jajodia<>
23584<>333_24<>nulo<>a temporal fixpoint calculus<>popl<>moshe y. vardi<>
23734<>341_0<>phokion g. kolaitis<>0-1 laws and decision problems for fragments of second-order logic<>lics<>moshe y. vardi<>
10126<>368_5<>nulo<>"liberty, license, and reason."<>ci<>henry e. kyburg jr.<>
10129<>368_8<>nulo<>probabilistic inference and non-monotonic inference<>uai<>henry e. kyburg jr.<>
10132<>368_11<>nulo<>epistemological relevance and statistical knowledge<>uai<>henry e. kyburg jr.<>
10133<>368_12<>nulo<>higher order probabilities and intervals<>ijar<>henry e. kyburg jr.<>
10135<>368_14<>nulo<>objective probability<>ijar<>henry e. kyburg jr.<>
10136<>368_15<>nulo<>higher order probabilities<>ijar<>henry e. kyburg jr.<>
22748<>424_1<>emo welzl<>new methods for computing visibility graphs<>compgeom<>mark h. overmars<>
22782<>424_35<>rolf g. karlsson<>scanline algorithms on a grid<>bit<>mark h. overmars<>
22783<>424_36<>derick wood<>on rectangular visibility<>jal<>mark h. overmars<>
22790<>424_43<>rolf g. karlsson<>normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems<>ipl<>mark h. overmars<>
22819<>424_72<>nulo<>efficient data structures for range searching on a grid<>jal<>mark h. overmars<>
22842<>424_95<>leonidas j. guibas:micha sharir<>"intersecting line segments, ray shooting, and other applications of geometric partitioning techniques."<>swat<>mark h. overmars<>
22844<>424_97<>david p. dobkin:herbert edelsbrunner<>searching for empty convex polygons<>compgeom<>mark h. overmars<>
22863<>424_116<>nulo<>connectability problems<>swat<>mark h. overmars<>
19467<>485_42<>allen van gelder:john s. schlipf<>unfounded sets and well-founded semantics for general logic programs<>pods<>kenneth a. ross<>
19468<>485_43<>rodney w. topor<>inferring negative information from disjunctive databases<>jar<>kenneth a. ross<>
15319<>527_7<>robert wilensky:david n. chin:marc luria:james mayfield:dekai wu<>the berkeley unix consultant project<>coling<>james h. martin<>
15324<>527_12<>nulo<>representing regularities in the metaphoric lexicon<>coling<>james h. martin<>
33981<>529_76<>pasquale savino<>implementing ranking strategies using text signatures<>tois<>w. bruce croft<>
21831<>566_1<>thomas rose<>managing knowledge about information system evolution<>sigmod<>matthias jarke<>
21835<>567_2<>vasant dhar<>dependency directed reasoning and learning in systems maintenance support<>tse<>matthias jarke<>
27887<>573_0<>andrew v. goldberg<>a new approach to the maximum-flow problem<>jacm<>robert endre tarjan<>
27879<>579_0<>harold n. gabow<>almost-optimum speed-ups of algorithms for bipartite matching and related problems<>stoc<>robert endre tarjan<>
6289<>594_8<>theodosios pavlidis<>one-dimensional regularization with discontinuities<>pami<>david lee<>
441<>622_23<>nulo<>an algorithm for finding hamilton cycles in random directed graphs<>jal<>alan m. frieze<>
451<>622_33<>nulo<>finding hamilton cycles in sparse random graphs<>jct<>alan m. frieze<>
483<>622_65<>nulo<>partitioning random graphs into large cycles<>dm<>alan m. frieze<>
489<>622_71<>b. jackson:colin j. h. mcdiarmid:bruce a. reed<>edge-colouring random graphs<>jct<>alan m. frieze<>
25782<>702_46<>m. seetha lakshmi<>effect of skew on join performance in parallel architectures<>dpds<>philip s. yu<>
25812<>702_76<>balakrishna r. iyer:daniel m. dias<>performability comparison of configurable duplex systems<>csse<>philip s. yu<>
25819<>702_83<>c. mani krishna:yann-hang lee<>optimal design and sequential analysis of vlsi testing strategy<>tc<>philip s. yu<>
12317<>759_24<>branimir boguraev:ted briscoe:claire grover<>software support for practical grammar development<>coling<>john carroll<>
12271<>761_2<>amy p. aaronson<>learning by doing with simulated intelligent help<>cacm<>john m. carroll<>
23548<>1022_6<>randy h. katz:david a. patterson:john k. ousterhout<>the design of xprs<>vldb<>michael stonebraker<>
22068<>1047_45<>elias dahlhaus:peter hajnal<>optimal parallel algorithm for the hamiltonian cycle problem on dense graphs<>focs<>marek karpinski<>
38471<>1099_8<>daniel d. gajski<>les: a layout expert system<>tcad<>youn-long lin<>
8793<>1218_5<>nulo<>a lower bound on connectivities of matroid base graphs<>dm<>guizhen liu<>
12699<>1295_0<>sangki han:d. w. shin:y. kim:y. p. jun:seung ryoul maeng<>a logic programming approach to hybrid knowledge representation<>aai<>jung wan cho<>
12711<>1295_12<>sangki han<>sphinx - a hybrid knowledge representation system<>fgcs<>jung wan cho<>
12712<>1295_13<>d. w. shin:jong h. nang:seungryul r. maeng<>the semantics of a functional logic language with input mode<>fgcs<>jung wan cho<>
1460<>1419_0<>nulo<>computer vision<>ac<>azriel rosenfeld<>
12361<>1436_27<>william t. krakow<>optimal use of timing resources: a crucial step in test program generation<>itc<>ji-en morris chang<>
16154<>1441_28<>scott a. smolka<>the complexity of reachability in distributed communicating processes<>acta<>john h. reif<>
16167<>1441_41<>philip n. klein<>an efficient parallel algorithm for planarity<>jcss<>john h. reif<>
16171<>1441_45<>john f. canny:bruce randall donald:patrick g. xavier<>on the complexity of kinodynamic planning<>focs<>john h. reif<>
16197<>1441_71<>pater gacs<>a simple three-dimensional real-time reliable cellular array<>jcss<>john h. reif<>
13245<>1465_124<>orlie brewer:danny c. sorensen<>tools to aid in the analysis of memory access patterns for fortran programs<>pc<>jack dongarra<>
13248<>1465_127<>danny c. sorensen:k. connolly:j. patterson<>programming methodology and performance issues for advanced computer architectures<>pc<>jack dongarra<>
40576<>1472_1<>fuji zhang<>bounds of the longest directed cycle length for minimal strong digraphs<>dm<>zhibo chen<>
30257<>1486_14<>james b. thompson<>a distributed artificial intelligence approach to integrated engineering design<>ieaaie<>stephen c. y. lu<>
12887<>1499_36<>d. f. wong<>how to obtain more compactable channel routing solutions<>dac<>jingsheng cong<>
12947<>1499_96<>martin d. f. wong:c. l. liu<>a new approach to three- or four-layer channel routing<>tcad<>jason cong<>
8183<>1532_10<>donatella sciuto<>on functional testing of array processors<>tc<>fabrizio lombardi<>
8193<>1532_20<>donatella sciuto:renato stefanelli<>an algorithm for functional reconfiguration of fixed-size arrays<>tcad<>fabrizio lombardi<>
8195<>1532_22<>nulo<>analysis of comparison-based diagnosable systems using temporal criteria<>cj<>fabrizio lombardi<>
18941<>1553_14<>mogens nielsen:uffe engberg<>fully abstract models for a process language with refinement<>rex<>kim s. larsen<>
19106<>1563_25<>w. lam<>fuzzy concepts in expert systems<>computer<>kwong-sak leung<>
41096<>1783_32<>amir pnueli<>the anchored version of the temporal framework<>rex<>zohar manna<>
8816<>1796_10<>phillip b. gibbons:richard m. karp:danny soroker<>subtree isomorphism is in random nc<>awoc<>gary l. miller<>
8842<>1796_36<>vijaya ramachandran:erich kaltofen<>efficient parallel evaluation of straight-line code and arithmetic circuits<>siamcomp<>gary l. miller<>
8869<>1796_63<>hillel gazit<>an improved parallel algorithm that computes the bfs numbering of a directed graph<>ipl<>gary l. miller<>
8874<>1796_68<>richard j. anderson<>deterministic parallel list ranking<>awoc<>gary l. miller<>
27711<>1826_7<>eric schoen:bruce g. buchanan<>design of knowledge-based systems with a knowledge-based assistant<>tse<>reid g. smith<>
39002<>1870_64<>nancy a. lynch:alan fekete<>data link layer: two impossibility results<>podc<>yishay mansour<>
32449<>1898_32<>tiko kameda:naoki katoh<>cautious transaction schedulers for database concurrency control<>tse<>toshihide ibaraki<>
9476<>1943_11<>nulo<>dynamic programming on graphs with bounded treewidth<>icalp<>hans l. bodlaender<>
9488<>1943_23<>nulo<>the complexity of finding uniform emulations on fixed graphs<>ipl<>hans l. bodlaender<>
9491<>1943_26<>nulo<>nc-algorithms for graphs with small treewidth<>wg<>hans l. bodlaender<>
9546<>1943_81<>nulo<>"a better lower bound for distributed leader finding in bidirectional, asynchronous rings of processors."<>ipl<>hans l. bodlaender<>
27914<>1997_24<>frank c. belz:lori a. clarke:leon j. osterweil:richard w. selby:jack c. wileden:alexander l. wolf:michal young<>foundations for the arcadia environment architecture<>sde<>richard n. taylor<>
27918<>1997_28<>michal young:dennis b. troup<>software environment architectures and user interface facilities<>tse<>richard n. taylor<>
27929<>1997_39<>michal young<>combining static concurrency analysis with symbolic execution<>tse<>richard n. taylor<>
16263<>2037_6<>david m. nicol<>dynamic remapping of parallel computations with varying resource demands<>tc<>joel h. saltz<>
24451<>2083_7<>gopal gupta<>a universal test set for cmos circuits<>tcad<>niraj k. jha<>
24528<>2083_84<>nulo<>multiple stuck-open fault detection in cmos logic circuits<>tc<>niraj k. jha<>
24621<>2083_177<>nulo<>testing for multiple faults in domino-cmos logic circuits<>tcad<>niraj k. jha<>
31237<>2180_6<>peng si ow:alfred thirlez<>reactive plan revision<>aaai<>stephen f. smith<>
27750<>2308_9<>giuseppe di battista:hannu kangassalo<>definition libraries for conceptual modelling<>er<>roberto tamassia<>
27797<>2308_56<>giuseppe di battista<>algorithms for plane representations of acyclic digraphs<>tcs<>roberto tamassia<>
27859<>2308_118<>bruno codenotti<>efficient reconfiguration of vlsi arrays<>awoc<>roberto tamassia<>
12810<>2394_34<>timothy j. hickey<>automating program analysis<>jacm<>jacques cohen<>
27360<>2427_38<>p. c. stephenson<>swept volumes in solid modellers<>ima-ms<>ralph r. martin<>
27361<>2427_39<>tamas varady:janos vida<>parametric blending in a boundary representation solid modeller<>ima-ms<>ralph r. martin<>
33363<>2582_0<>vincent yun shen:hubert e. dunsmore<>an analysis of several software defect models<>tse<>tze-jie yu<>
31011<>2683_43<>balozs biro<>isomorphic but not lower base-isomorphic cylindric set algebras<>jsyml<>saharon shelah<>
31041<>2683_73<>jaime i. ihoda<>souslin forcing<>jsyml<>saharon shelah<>
31055<>2683_87<>pater komjath<>forcing constructions for uncountably chromatic graphs<>jsyml<>saharon shelah<>
21269<>2703_0<>luc de raedt<>on interactive concept-learning and assimilation<>ecml<>maurice bruynooghe<>
3066<>2708_1<>nulo<>on edge-hamiltonian property of cayley graphs<>dm<>c. c. chen<>
8948<>2734_64<>nulo<>on langford-lyndon-thue sequences<>eatcs<>gheorghe paun<>
4913<>2852_0<>lingtao wang<>distributed instruction set computer<>icpp<>chuan-lin wu<>
4922<>2852_9<>chung-yang chiang<>adaptive checkpointing and rollback in multiprocessor systems<>icpp<>chuan-lin wu<>
4925<>2852_12<>lingtao wang<>i-net mechanism for issuing multiple instructions<>sc<>chuan-lin wu<>
6176<>2855_4<>nulo<>application of splay trees to data compression<>cacm<>douglas w. jones<>
942<>2949_14<>michael stonebraker<>semantics based transaction management techniques for replicated data<>sigmod<>akhil kumar<>
946<>2949_18<>arie segev<>optimizing voting-type algorithms for replicated data<>edbt<>akhil kumar<>
19585<>3044_66<>thomas e. bihari<>a comparison of four adaptation algorithms for increasing the reliability of real-time software<>rtss<>karsten schwan<>
13579<>3047_53<>moshe y. vardi<>reasoning about knowledge and time in asynchronous systems<>stoc<>joseph y. halpern<>
13644<>3047_118<>ronald fagin:nimrod megiddo<>a logic for reasoning about probabilities<>lics<>joseph y. halpern<>
13715<>3047_189<>ronald fagin<>modelling knowledge and action in distributed systems<>concur<>joseph y. halpern<>
13733<>3047_207<>ronald fagin<>reasoning about knowledge and probability<>tark<>joseph y. halpern<>
1808<>3117_0<>nathan linial:laszla lovasz<>"rubber bands, convex embeddings and graph connectivity."<>combinatorica<>avi wigderson<>
30031<>3160_1<>robert c. rennick<>a compact igfet model-asim<>tcad<>shiuh-wuu lee<>
5432<>3189_56<>virendra k. janakiram:ravi mehrotra<>a randomized parallel backtracking algorithm<>tc<>dharma p. agrawal<>
4371<>3200_0<>lefteris m. kirousis<>the complexity of recognizing polyhedral scenes<>jcss<>christos h. papadimitriou<>
20254<>3330_0<>nulo<>mapping classifier systems into neural networks<>nips<>lawrence davis<>
20257<>3330_3<>david k. young<>classifier systems with hamming weights<>icml<>lawrence davis<>
35708<>3371_1<>stephen s. yau<>visual languages and software specifications<>iccl<>xiaoping jia<>
1141<>3411_2<>nulo<>prefix search with a lie<>jct<>andrzej pelc<>
1226<>3411_87<>jurek czyzowicz:daniele mundici<>solution of ulam's problem on binary search with two lies<>jct<>andrzej pelc<>
16697<>3449_11<>richard hull<>on the expressive power of database queries with intermediate types<>pods<>jianwen su<>
18045<>3526_14<>nulo<>solving equations in an equational language<>alp<>jia-huai you<>
18054<>3526_23<>vickitt lau<>parallelism in nonmonotonic multiple inheritance systems<>ausai<>jia-huai you<>
9062<>3575_11<>ijsbrand jan aalbersberg<>theory of traces<>tcs<>grzegorz rozenberg<>
22437<>3590_37<>nulo<>a separator theorem for one-dimensional graphs under linear mapping<>ipl<>ming li<>
8309<>3772_48<>herbert edelsbrunner<>minimum polygonal separation<>iandc<>franco p. preparata<>
8344<>3772_83<>panagiotis alevizos:jean-daniel boissonnat<>an optimal algorithm for the boundary of a cell in a union of rays<>georob<>franco p. preparata<>
8361<>3772_100<>nulo<>planar point location revisited (a guided tour of a decade of research)<>fsttcs<>franco p. preparata<>
8375<>3772_114<>herbert edelsbrunner<>tetrahedrizing point sets in three dimensions<>issac<>franco p. preparata<>
6152<>3880_0<>f. javier thayer<>security and the composition of machines<>csfw<>dale m. johnson<>
6068<>3890_5<>nimrod megiddo:s. louis hakimi:m. r. garey:christos h. papadimitriou<>the complexity of searching a graph<>jacm<>david s. johnson<>
6075<>3890_12<>christos h. papadimitriou:mihalis yannakakis<>on generating all maximal independent sets<>ipl<>david s. johnson<>
6085<>3890_22<>christos h. papadimitriou:mihalis yannakakis<>how easy is local search?<>jcss<>david s. johnson<>
38139<>3894_4<>philip s. yu:avraham leff<>robust transaction routing in distributed database systems<>dpds<>yann-hang lee<>
38153<>3894_18<>philip s. yu:c. mani krishna<>optimal design and sequential analysis of vlsi testing strategy<>tc<>yann-hang lee<>
38166<>3894_31<>kang g. shin:c. mani krishna<>optimal resource control in periodic real-time environments<>rtss<>yann-hang lee<>
38173<>3894_38<>kang g. shin<>optimal design and use of retry in fault-tolerant computer systems<>jacm<>yann-hang lee<>
22572<>3929_1<>daniel r. fuhrmann<>on the existence of positive-definite maximum-likelihood estimates of structured covariance matrices<>tit<>michael i. miller<>
22609<>3935_14<>ivan fris<>minimum diameter of diregular digraphs of degree 2<>cj<>mirka miller<>
14263<>3995_0<>richard j. beach<>styles in document editing systems<>computer<>jeff a. johnson<>
30757<>4044_0<>ankan k. pramanick<>on the detection of delay faults<>itc<>sudhakar m. reddy<>
21702<>4104_41<>mikhail j. atallah:s. rao kosaraju<>parallel algorithms for evaluating sequences of set-manipulation operations<>awoc<>michael t. goodrich<>
27015<>4105_4<>rajeev motwani:prabhakar raghavan<>deferred data structuring<>siamcomp<>richard m. karp<>
27032<>4105_21<>eli upfal:avi wigderson<>the complexity of parallel search<>jcss<>richard m. karp<>
27049<>4105_38<>yanjun zhang<>a randomized parallel branch-and-bound procedure<>stoc<>richard m. karp<>
27059<>4105_48<>phillip b. gibbons:gary l. miller:danny soroker<>subtree isomorphism is in random nc<>awoc<>richard m. karp<>
27135<>4143_0<>michael stonebraker:david a. patterson:john k. ousterhout<>the design of xprs<>vldb<>randy h. katz<>
27137<>4143_2<>david a. patterson:garth a. gibson<>a case for redundant arrays of inexpensive disks (raid)<>sigmod<>randy h. katz<>
6634<>4190_1<>michael stonebraker:randy h. katz:john k. ousterhout<>the design of xprs<>vldb<>david a. patterson<>
6638<>4190_5<>garth a. gibson:randy h. katz<>a case for redundant arrays of inexpensive disks (raid)<>sigmod<>david a. patterson<>
22697<>4280_60<>sampath kannan:steven rudich<>implicit representation of graphs<>stoc<>moni naor<>
22702<>4280_65<>amotz bar-noy:joseph naor<>one bit algorithms<>podc<>moni naor<>
22745<>4280_108<>david chaum:amos fiat<>untraceable electronic cash<>crypto<>moni naor<>
356<>4302_156<>janak h. patel<>a parallel processing architecture for an integrated vision system<>icpp<>alok n. choudhary<>
16125<>4347_0<>vasant dhar:barry lewis<>a knowledge-based model of audit risk<>aim<>james peters<>
3193<>4443_5<>eli gafni<>understanding and verifying distributed algorithms using stratified decomposition<>podc<>ching-tsun chou<>
3195<>4443_7<>nulo<>linear broadcast routing<>fsttcs<>ching-tsun chou<>
10977<>4566_0<>markku tamminen<>efficient component labeling of images of arbitrary dimension represented by linear bintrees<>pami<>hanan samet<>
11028<>4566_51<>clifford a. shaffer<>algorithm to expand regions represented by linear quadtrees<>ivc<>hanan samet<>
11031<>4566_54<>nulo<>hierarchical representations of collections of small rectangles<>csur<>hanan samet<>
7262<>4585_4<>robert wilensky:david n. chin:marc luria:james h. martin:james mayfield<>the berkeley unix consultant project<>coling<>dekai wu<>
34184<>4613_1<>hong-tai chou<>versions of schema for object-oriented databases<>vldb<>won kim<>
25297<>4710_2<>nulo<>parallel simulation and test of vlsi array logic<>awoc<>pradip bose<>
25301<>4710_6<>nulo<>a novel technique for efficient parallel implementation of a classical logic/fault simulation problem<>tc<>pradip bose<>
25307<>4710_12<>nulo<>interactive program improvement via eave: an expert adviser for vectorization<>ics<>pradip bose<>
25311<>4710_16<>nulo<>heuristic rule-based program transformations for enhanced vectorization<>icpp<>pradip bose<>
17481<>4714_14<>nulo<>broadcast delivery<>pieee<>j. wong<>
2224<>4765_36<>nulo<>scheduling via reinforcement<>aei<>bing liu<>
11247<>4798_0<>nulo<>prospects for cognitive science<>fgcs<>herbert a. simon<>
11260<>4800_3<>deepak kulkarni<>the processes of scientific discovery: the strategy of experimentation<>cogsci<>herbert a. simon<>
24956<>5073_26<>tao jiang<>learning regular languages from counterexamples<>colt<>oscar h. ibarra<>
25033<>5073_103<>jik h. chang:anastasios vergis<>on the power of one-way communication<>jacm<>oscar h. ibarra<>
25047<>5073_117<>david hung-chang du:j. fernando naveda<>on two-dimensional via assignment for single-row routing<>tc<>oscar h. ibarra<>
25050<>5073_120<>michael a. palis<>two-dimensional iterative arrays: characterizations and applications<>tcs<>oscar h. ibarra<>
25052<>5073_122<>jik h. chang:moon-jung chung:kotesh k. rao<>systolic tree implementation of data structures<>tc<>oscar h. ibarra<>
25054<>5073_124<>tao jiang<>relating the power of cellular arrays to their closure properties<>tcs<>oscar h. ibarra<>
25056<>5073_126<>bala ravikumar<>"sublogarithmic-space turing machines, nonuniform space complexity, and closure properties."<>mst<>oscar h. ibarra<>
24228<>5078_36<>fan r. k. chung<>explicit construction of linear sized tolerant networks<>dm<>noga alon<>
35217<>5082_39<>john a. stankovic<>on real-time transactions<>sigmod<>wei zhao<>
35235<>5082_57<>john a. stankovic:krithi ramamritham<>a multi-access window protocol for transmission of time constrained messages<>icdcs<>wei zhao<>
2997<>5094_6<>tsang ming jiang:mikio aoyama<>a specification language for real-time distributed systems<>iccl<>carl k. chang<>
22345<>5148_24<>giuseppe di battista<>object modeling based on logic<>er<>maurizio lenzerini<>
40693<>5293_10<>david eppstein:raffaele giancarlo<>speeding up dynamic programming<>focs<>zvi galil<>
40695<>5293_12<>victor y. pan<>improved processor bounds for combinatorial problems in rnc<>combinatorica<>zvi galil<>
15587<>5327_2<>gordon d. plotkin<>abstract types have existential type<>toplas<>john c. mitchell<>
24674<>5359_52<>michael merritt<>introduction to the theory of nested transactions<>tcs<>nancy a. lynch<>
24698<>5359_76<>james aspnes:alan fekete:michael merritt:william e. weihl<>a theory of timestamp-based concurrency control for nested transactions<>vldb<>nancy a. lynch<>
24727<>5359_105<>yishay mansour:alan fekete<>data link layer: two impossibility results<>podc<>nancy a. lynch<>
24750<>5359_128<>cynthia dwork:larry j. stockmeyer<>consensus in the presence of partial synchrony<>jacm<>nancy a. lynch<>
24773<>5359_151<>michael merritt:william e. weihl:alan fekete<>a theory of atomic transactions<>icdt<>nancy a. lynch<>
24783<>5359_161<>hector garcia-molina:boris kogan<>reliable broadcast in networks with nonprogrammable servers<>icdcs<>nancy a. lynch<>
14178<>5378_1<>nulo<>multiple fault detection using single fault test sets<>tcad<>joseph l. a. hughes<>
15918<>5403_0<>nulo<>finding corners<>ivc<>j. alison noble<>
10917<>5445_7<>franklin t. luk<>fault-tolerant matrix triangularizations on systolic arrays<>tc<>haesun park<>
10925<>5445_15<>franklin t. luk<>an analysis of algorithm-based fault tolerance techniques<>jpdc<>haesun park<>
34679<>5450_21<>shyh-kwei chen:chungti liang<>loops and multi-dimensional grids on hypercubes mapping and reconfiguration algorithms<>icpp<>wei-tek tsai<>
15407<>5453_3<>l. wei<>influence of workload on error recovery in random access memories<>tc<>john f. meyer<>
4110<>5473_21<>dan c. marinescu<>stochastic high-level petri nets and applications<>tc<>chuang lin<>
27476<>5672_54<>richard m. karp:prabhakar raghavan<>deferred data structuring<>siamcomp<>rajeev motwani<>
17248<>5703_6<>nulo<>on point-linear arboricity of planar graphs<>dm<>jianfang wang<>
7806<>5877_3<>jane terry nutter:thomas ahlswede:martha w. evens:judith a. markowitz<>building a large thesaurus for information retrieval<>anlp<>edward a. fox<>
7824<>5877_21<>gary l. nunn:whay c. lee<>coefficients for combining concept classes in a collection<>sigir<>edward a. fox<>
30644<>5945_14<>nulo<>all variations on perfectly orderable graphs<>jct<>stephan olariu<>
30646<>5945_16<>nulo<>no antitwins in minimal imperfect graphs<>jct<>stephan olariu<>
19674<>5985_12<>nulo<>resolving goal conflicts via negotiation<>aaai<>katia p. sycara<>
24860<>6022_52<>hugo krawczyk:michael luby<>on the existence of pseudorandom generators<>crypto<>oded goldreich<>
24889<>6022_81<>benny chor<>unbiased bits from sources of weak randomness and probabilistic communication complexity<>siamcomp<>oded goldreich<>
16912<>6071_0<>b. cordell:f. fuller:p. a. gonzalez-dewhitt:j. r. tinklenberg:h. d. davies:l. f. eng:j. a. yesavage:p. m. frossard<>ecot14i rflp found at the human amyloid beta protein gene locus<>nar<>j. e. taylor<>
33523<>6174_38<>nulo<>group-theoretic approach to intractable problems<>colog<>vladik kreinovich<>
7905<>6286_38<>a. robert calderbank:leopold flatto<>optimal directory placement on disk storage devices<>jacm<>edward g. coffman jr.<>
7943<>6287_1<>nulo<>the coding theory of finite geometries and designs<>aaecc<>e. f. assmus jr.<>
7984<>6289_2<>nulo<>chromatic polynomials of generalized trees<>dm<>earl glen whitehead jr.<>
10040<>6304_29<>david avis:binay k. bhattacharya<>computing the volume of the union of spheres<>vc<>hiroshi imai<>
13025<>6355_0<>julia hirschberg<>assigning intonational features in synthesized spoken directions<>acl<>james raymond davis<>
5617<>6375_0<>nulo<>the design philosophy of the darpa internet protocols<>sigcomm<>david d. clark<>
1465<>6481_3<>nulo<>cryptography and data security<>imycs<>arto salomaa<>
25487<>6488_4<>zvi m. kedem<>on high-speed computing with a programmable linear array<>sc<>peizong lee<>
25491<>6488_8<>zvi m. kedem<>synthesizing linear array algorithms from nested for loop algorithms<>tc<>peizong lee<>
10082<>6540_30<>kenneth c. smith<>a partial-multiple-bus computer structure with improved cost-effectiveness<>isca<>hong jiang<>
28464<>6555_83<>c. w. yan:donald c. dimitroff:timothy arndt<>an intelligent image database system<>tse<>shi-kuo chang<>
12083<>6557_26<>nulo<>parallel implementation of parlog<>icpp<>ian t. foster<>
40816<>6579_1<>pen-chung yew<>efficient interprocedural analysis for program parallelization and restructuring<>ppopp<>zhiyuan li<>
40831<>6579_16<>pen-chung yew<>interprocedural analysis for parallel programs<>icpp<>zhiyuan li<>
1352<>6584_66<>zohar manna<>the anchored version of the temporal framework<>rex<>amir pnueli<>
1363<>6584_77<>david harel:hagi lachover:amnon naamad:michal politi:rivi sherman:aharon shtull-trauring<>statemate; a working environment for the development of complex reactive systems<>icse<>amir pnueli<>
1371<>6584_85<>eyal harel<>applications of temporal logic to the specification of real-time systems<>ftrtft<>amir pnueli<>
19767<>6645_7<>masatoshi yoshikawa<>"towards abstracting complex database objects: generalization, reduction and unification of set-type objects (extended abstract)."<>icdt<>katsumi tanaka<>
19773<>6645_13<>masatoshi yoshikawa:kozo ishihara<>schema virtualization in object-oriented databases<>icde<>katsumi tanaka<>
41490<>6671_5<>nulo<>partial converse for a relay channel<>tit<>zhen zhang<>
41492<>6671_7<>toby berger<>estimation via compressed information<>tit<>zhen zhang<>
1886<>6684_23<>nulo<>an algorithm for segment-dragging and its implementation<>algorithmica<>bernard chazelle<>
1927<>6684_64<>alok aggarwal:leonidas j. guibas:colm u'dunlaing:chee-keng yap<>parallel computational geometry<>algorithmica<>bernard chazelle<>
1942<>6684_79<>nulo<>a functional approach to data structures and its use in multidimensional searching<>siamcomp<>bernard chazelle<>
1974<>6684_111<>herbert edelsbrunner<>an optimal algorithm for intersecting line segments in the plane<>focs<>bernard chazelle<>
5675<>6707_16<>frank k. hwang:g. d. song:g. y. ting<>a decomposition theorem on euclidean steiner minimal trees<>dcg<>ding-zhu du<>
5677<>6707_18<>zevi miller<>matroids and subset interconnection design<>siamdm<>ding-zhu du<>
37557<>6730_4<>nulo<>a study of associative evidential reasoning<>ijar<>yizong cheng<>
5620<>6804_0<>shahram ghandeharizadeh:donovan a. schneider<>a performance analysis of the gamma database machine<>sigmod<>david j. dewitt<>
22184<>6809_0<>nulo<>measuring parallelism in computation-intensive scientific/engineering applications<>tc<>manoj kumar<>
2344<>6889_31<>nulo<>eiffel: a language and environment for software engineering<>jss<>bertrand meyer<>
17060<>6903_57<>jyh-han lin<>learning in parallel<>colt<>jeffrey scott vitter<>
17075<>6903_72<>alok aggarwal<>the input/output complexity of sorting and related problems<>cacm<>jeffrey scott vitter<>
