15805<>0_31<>jean duprat:mario fiallos aguilar:hong-jin yeh<>delays of on-line floating point operators in borrow-save representation<>ccc<>jean-michel muller<>
26557<>17_4<>udi manber<>an algorithm for string matching with a sequence of don't cares<>ipl<>ricardo a. baeza-yates<>
26589<>17_36<>nulo<>searching subsequences<>tcs<>ricardo a. baeza-yates<>
26639<>17_86<>nulo<>height balance distribution of search trees<>ipl<>ricardo a. baeza-yates<>
23334<>18_23<>herbert edelsbrunner:raimund seidel<>on the zone theorem for hyperplane arrangements<>birthday<>micha sharir<>
23341<>18_30<>boris aronov<>on the zone of a surface in a hyperplane arrangement<>wads<>micha sharir<>
25082<>25_20<>micha sharir<>counting circular arc intersections<>compgeom<>pankaj k. agarwal<>
25087<>25_25<>jiri matousek:subhash suri<>"farthest neighbors, maximum spanning trees and related problems in higher dimensions."<>comgeo<>pankaj k. agarwal<>
25116<>25_54<>micha sharir<>applications of a new space partitioning technique<>wads<>pankaj k. agarwal<>
25182<>25_120<>micha sharir<>off-line dynamic maintenance of the width of a planar point set<>comgeo<>pankaj k. agarwal<>
8505<>26_2<>xueliang li<>on the numbers of spanning trees and eulerian tours in generalized de bruijn graphs<>dm<>fuji zhang<>
33411<>32_2<>gianluigi caldiera<>identifying and qualifying reusable software components<>computer<>victor r. basili<>
33447<>32_38<>john d. musa<>the future engineering of software: a management perspective<>computer<>victor r. basili<>
33469<>32_60<>richard w. selby<>analyzing error-prone system structure<>tse<>victor r. basili<>
26777<>50_8<>fei song<>temporal reasoning during plan recognition<>aaai<>robin cohen<>
26779<>50_10<>fei song:bruce spencer:peter van beek<>exploiting temporal and novel information from the user in plan recognition<>umuai<>robin cohen<>
26780<>50_11<>peter van beek<>resolving plan ambiguity for cooperative response generation<>ijcai<>robin cohen<>
26754<>53_9<>adrian segall<>a new scheme for dynamic management of isochronous channels in integrated rings<>infocom<>reuven cohen<>
18770<>57_16<>nicolas helft:david poole<>query answering in circumscription<>ijcai<>katsumi inoue<>
18779<>57_25<>nulo<>extended logic programs with default assumptions<>iclp<>katsumi inoue<>
18781<>57_27<>nulo<>consequence-finding based on ordered linear resolution<>ijcai<>katsumi inoue<>
23465<>106_71<>nulo<>a logic of situated know-how<>aaai<>munindar p. singh<>
14228<>111_0<>nulo<>a fast mach network ipc implementation<>mach<>joseph s. barrera iii<>
6591<>123_3<>marc g. slack<>global symbolic maps from local navigation<>aaai<>david p. miller<>
6566<>127_7<>joshua s. hodas<>logic programming in a fragment of intuitionistic linear logic<>lics<>dale miller<>
6586<>127_27<>gopalan nadathur:frank pfenning:andre scedrov<>uniform proofs as a foundation for logic programming<>apal<>dale miller<>
32832<>135_34<>nulo<>concurrent automata and parallel architecture<>icpp<>tsau young lin<>
5735<>153_6<>marshall w. bern:f. frances yao<>the expected extremes in a delaunay triangulation<>icalp<>david eppstein<>
5768<>153_39<>nulo<>the farthest point delaunay triangulation minimizes angles<>comgeo<>david eppstein<>
5804<>153_75<>nulo<>offline algorithms for dynamic minimum spanning tree problems<>wads<>david eppstein<>
5842<>153_113<>marek chrobak:giuseppe f. italiano:moti yung<>efficient sequential and parallel algorithms for computing recovery points in trees and paths<>soda<>david eppstein<>
5855<>153_126<>nulo<>dynamic three-dimensional linear programming<>focs<>david eppstein<>
5890<>153_161<>marek chrobak<>planar orientations with low out-degree and compaction of adjacency matrices<>tcs<>david eppstein<>
5892<>153_163<>marshall w. bern:f. frances yao<>the expected extremes in a delaunay triangulation<>ijcga<>david eppstein<>
40539<>174_2<>cun-quan zhang<>long path connectivity of regular graphs<>dm<>yongjin zhu<>
40543<>174_6<>feng tian:xiaotie deng<>more powerful closure operations on graphs<>dm<>yongjin zhu<>
27158<>202_13<>steffen schulze-kremer<>ipsa: inductive protein structure analysis<>ecml<>ross d. king<>
17163<>234_2<>nulo<>on p-creative sets and p-completely creative sets<>tcs<>jie wang<>
30922<>270_12<>nulo<>some observations on skip-lists<>ipl<>sandeep sen<>
30925<>270_15<>ketan mulmuley<>dynamic point location in arrangements of hyperplanes<>compgeom<>sandeep sen<>
29170<>280_11<>nulo<>panel discussion on the polyinstantiation problem: a position paper<>csfw<>sushil jajodia<>
29189<>280_30<>ravi s. sandhu<>integrity principles and mechanisms in database management systems<>compsec<>sushil jajodia<>
29201<>280_42<>ravi mukkamala<>a note on estimating the cardinality of the projection of a database relation<>tods<>sushil jajodia<>
29229<>280_70<>paul ammann<>"a timestamp ordering algorithm for secure, single-version, multi-level databases."<>dbsec<>sushil jajodia<>
29267<>280_108<>ravi s. sandhu<>a novel decomposition of multilevel relations into single-level relations<>sp<>sushil jajodia<>
29277<>280_118<>gio wiederhold:witold litwin<>dealing with granularity of time in temporal databases<>caise<>sushil jajodia<>
29290<>280_131<>ravi s. sandhu:roshan k. thomas<>supporting timing-channel free computations in multilevel secure object-oriented databases<>dbsec<>sushil jajodia<>
33775<>295_0<>chitta baral:sarit kraus:jack minker<>combining knowledge bases consisting of first order theories<>ismis<>v. s. subrahmanian<>
23647<>333_87<>nulo<>verification of concurrent programs: the automata-theoretic framework<>apal<>moshe y. vardi<>
23700<>333_140<>joseph y. halpern<>model checking vs. theorem proving: a manifesto<>kr<>moshe y. vardi<>
34428<>342_0<>jong kim:chita r. das<>a top-down processor allocation scheme for hypercube computers<>tpds<>woei lin<>
34429<>342_1<>nulo<>communication-efficient vector manipulations on binary n-cubes<>icpp<>woei lin<>
33312<>355_44<>apostolos gerasoulis<>a fast static scheduling algorithm for dags on an unbounded number of processors<>sc<>tao yang<>
10122<>368_1<>john f. lemmer<>conditions for the existence of belief functions corresponding to intervals of belief<>aaai<>henry e. kyburg jr.<>
10127<>368_6<>bulent murtezaoglu<>a modification to evidential probability<>uai<>henry e. kyburg jr.<>
10138<>368_17<>nulo<>evidential probability<>ijcai<>henry e. kyburg jr.<>
22776<>424_29<>haijo schipper<>dynamic partition trees<>bit<>mark h. overmars<>
22810<>424_63<>marc j. van kreveld<>divided k-d trees<>algorithmica<>mark h. overmars<>
22814<>424_67<>matthew j. katz:micha sharir<>efficient hidden surface removal for objects with small union size<>compgeom<>mark h. overmars<>
22865<>424_118<>mark de berg:dan halperin:jack snoeyink:marc j. van kreveld<>efficient ray shooting and hidden surface removal<>compgeom<>mark h. overmars<>
19494<>483_14<>shun-ping chung<>on nonblocking multirate interconnection networks<>siamcomp<>keith w. ross<>
19507<>483_27<>david d. yao<>optimal load balancing and scheduling in a distributed computer system<>jacm<>keith w. ross<>
19436<>485_11<>nulo<>on negation in hilog<>pods<>kenneth a. ross<>
19449<>485_24<>allen van gelder:john s. schlipf<>the well-founded semantics for general logic programs<>jacm<>kenneth a. ross<>
19465<>485_40<>nulo<>modular acyclicity and tail recursion in logic programs<>pods<>kenneth a. ross<>
15321<>527_9<>nulo<>conventional metaphor and the lexicon<>siglex<>james h. martin<>
30<>564_2<>tapas k. nayak:arun k. majumdar:santonu sarkar<>vlods: a vlsi object oriented database system<>is<>anupam basu<>
36<>564_8<>arun k. majumdar:s. sinha<>dext: an integrated knowledge-engineering environment for control-engineering applications<>kbs<>anupam basu<>
21834<>567_1<>udo hahn:thomas rose<>teamwork support in a knowledge-based information systems environment<>tse<>matthias jarke<>
27883<>576_0<>james r. driscoll:daniel dominic sleator<>fully persistent lists with catenation<>soda<>robert endre tarjan<>
27881<>579_2<>harold n. gabow<>faster scaling algorithms for general graph-matching problems<>jacm<>robert endre tarjan<>
27872<>582_8<>phillip b. gibbons:richard m. karp:vijaya ramachandran:danny soroker<>transitive compaction in parallel via branchings<>jal<>robert endre tarjan<>
6282<>594_1<>ming-hua chen:theodosios pavlidis<>residual analysis for feature detection<>pami<>david lee<>
430<>622_12<>bala bollobas<>spanning maximal planar subgraphs of random graphs<>rsa<>alan m. frieze<>
436<>622_18<>martin e. dyer<>randomized greedy matching<>rsa<>alan m. frieze<>
25762<>702_26<>avraham leff:joel l. wolf<>policies for efficient resource utilization in a remote caching architecture<>pdis<>philip s. yu<>
25765<>702_29<>ming-syan chen:kun-lung wu<>optimal all-to-all broadcasting schemes in distributed systems<>pdis<>philip s. yu<>
25868<>702_132<>joel l. wolf:daniel m. dias:john turek<>comparative performance of parallel join algorithms<>pdis<>philip s. yu<>
25883<>702_147<>douglas w. cornell<>optimal buffer allocation in a multi-query environment<>icde<>philip s. yu<>
18178<>728_2<>stephan olariu:james l. schwing<>on the power of two-dimensional processor arrays with reconfigurable bus systems<>ppl<>jingyuan zhang<>
5493<>816_2<>james h. cross:kai-hsiung chang:w. homer carlisle<>expert system assisted test data generation for software branch coverage<>dke<>david b. brown<>
5494<>816_3<>william h. deason:kai-hsiung chang:james h. cross<>a rule-based software test data generator<>tkde<>david b. brown<>
5497<>817_1<>christopher l. huntley<>a parallel heuristic for quadratic assignment problems<>cor<>donald e. brown<>
5499<>817_3<>paula gabbert:christopher l. huntley:bernard p. markowicz:david e. sappington<>a system for learning routes and schedules with genetic algorithms<>icga<>donald e. brown<>
5474<>818_10<>maryann b. spillane<>evaluating design knowledge compilation mechanisms<>ifip5-2<>david c. brown<>
21268<>832_37<>nulo<>towards a formal foundation of the specification and description language sdl<>fac<>manfred broy<>
38240<>853_0<>c. lee giles:clifford b. miller:d. chen:guo-zheng sun:h. h. chen<>extracting and learning an unknown grammar with recurrent neural networks<>nips<>y. c. lee<>
8716<>904_0<>john ioannidis:dan duchamp<>ip-based protocols for mobile internetworking<>sigcomm<>gerald q. maguire jr.<>
14605<>914_7<>umakishore ramachandran<>architectural primitives for a scalable shared memory multiprocessor<>spaa<>joonwon lee<>
12661<>919_12<>keijiro araki:zengo furukawa<>a general framework for debugging<>software<>jingde cheng<>
26084<>939_1<>m. g. rodd<>fast boundary extraction for industrial inspection<>prl<>q. m. jonathan wu<>
22898<>956_13<>narasimha b. bhat<>layout driven technology mapping<>dac<>massoud pedram<>
23042<>956_157<>narasimha b. bhat<>layout driven logic restructuring/decomposition<>iccad<>massoud pedram<>
3656<>964_1<>paul mackerras<>architecture of an extensible parallel debugger<>icpp<>chris w. johnson<>
31966<>987_6<>amer saeed:rogerio de lemos<>the role of formal methods in the requirements analysis of safety-critical systems: a train set example<>ftcs<>tom anderson<>
31996<>988_24<>henry m. levy:brian n. bershad:edward d. lazowska<>the interaction of architecture and operating system design<>asplos<>thomas e. anderson<>
32003<>988_31<>brian n. bershad:edward d. lazowska:henry m. levy<>user-level interprocess communication for shared memory multiprocessors<>tocs<>thomas e. anderson<>
23544<>1022_2<>abraham silberschatz:jeffrey d. ullman<>database systems: achievements and opportunities<>cacm<>michael stonebraker<>
38484<>1099_21<>min-siang lin:houng-wern perng:chi-yi hwang<>channel density reduction by routing over the cells<>tcad<>youn-long lin<>
38488<>1099_25<>yung-ching hsieh:chi-yi hwang:yu-chin hsu<>lib: a cmos cell compiler<>tcad<>youn-long lin<>
38489<>1099_26<>min-siang lin:hourng-wern perng:chi-yi hwang<>channel density reduction by routing over the cells<>dac<>youn-long lin<>
38429<>1100_18<>edward d. lazowska<>a time-division algorithm for parallel simulation<>tomacs<>yi-bing lin<>
38433<>1100_22<>bruno r. preiss<>optimal memory management for time warp parallel simulation<>tomacs<>yi-bing lin<>
38456<>1100_45<>edward d. lazowska<>a study of time warp rollback mechanisms<>tomacs<>yi-bing lin<>
37617<>1199_0<>shi-kuo chang<>a hypernet model for large hypertext systems<>dasfaa<>yi deng<>
37622<>1199_5<>taieb znati:brian field:shi-kuo chang<>multi-level specification and protocol design for distributed multimedia communication<>group<>yi deng<>
19864<>1276_23<>m. howard williams<>a superimposed codeword indexing scheme for handling sets in prolog databases<>dasfaa<>kam-fai wong<>
9697<>1285_27<>vasant dhar<>cognitive process as a basis for intelligent retrieval systems design<>ipm<>hsinchun chen<>
9877<>1291_5<>raimund seidel:micha sharir<>on the zone theorem for hyperplane arrangements<>birthday<>herbert edelsbrunner<>
4857<>1340_3<>sheng-de wang<>compiler techniques for extracting loop-level parallelism<>jise<>chien-min wang<>
8517<>1362_2<>anindya das:rachida dssouli:martin dubuc:abderrazak ghedamsi:gang luo<>fault models in testing<>pts<>gregor von bochmann<>
12341<>1436_7<>edward f. gehringer<>object-caching for performance in object-oriented systems<>iccd<>j. morris chang<>
16190<>1441_64<>james a. storer<>a parallel architecture for high-speed data compression<>jpdc<>john h. reif<>
16222<>1441_96<>hristo djidjev<>an efficient algorithm for the genus problem with explicit construction of forbidden subgraphs<>stoc<>john h. reif<>
13142<>1465_21<>alan h. karp:ken miura:horst d. simon<>gordon bell prize lectures<>sc<>jack dongarra<>
13144<>1465_23<>alan h. karp:ken miura:horst d. simon<>1990 gordon bell prize winners<>software<>jack dongarra<>
13195<>1465_74<>d. levine:david callahan<>a comparative study of automatic vectorizing compilers<>pc<>jack dongarra<>
13249<>1465_128<>adam beguelin<>graphical development tools for network-based concurrent supercomputing<>sc<>jack dongarra<>
30244<>1486_1<>steve a. chien:bradley l. whitehall:thomas g. dietterich:richard j. doyle:brian falkenhainer:james garrett<>machine learning in engineering automation<>icml<>stephen c. y. lu<>
30245<>1486_2<>david k. tcheng:bruce l. lambert:larry a. rendell<>aims: an adaptive interactive modeling system for supporting engineering decision making<>icml<>stephen c. y. lu<>
30246<>1486_3<>r. bharat rao:robert e. stepp<>knowledge-based equation discovery in engineering domains<>icml<>stephen c. y. lu<>
30260<>1486_17<>bradley l. whitehall<>a study of how domain knowledge improves knowledge-based learning systems<>icml<>stephen c. y. lu<>
12875<>1499_24<>kei-yong khoo<>a provable near-optimal algorithm for the channel pin assignment problem<>iccd<>jason cong<>
12885<>1499_34<>c. l. liu<>on the k-layer planar subset and topological via minimization problems<>tcad<>jason cong<>
12924<>1499_73<>khe-sing the:martin d. f. wong<>a layout modification approach to via minimization<>tcad<>jason cong<>
7669<>1520_56<>michael tarsi<>np-completeness of graph decomposition problems<>jc<>edith cohen<>
5040<>1525_0<>nulo<>a necessary and sufficient condition for a graph g with diameter 5 to be 2-diameter-stable<>dm<>chengde xu<>
8198<>1532_25<>x. sun:yinan n. shen:donatella sciuto<>protocol conformance testing by discriminating uio sequences<>pstv<>fabrizio lombardi<>
19126<>1563_45<>man leung wong<>automatic refinement of knowledge bases with fuzzy rules<>kbs<>kwong-sak leung<>
16085<>1642_4<>dina kravets<>selection and sorting in totally monotone arrays<>mst<>james k. park<>
6699<>1691_33<>richard w. selby:adam a. porter:jim berney<>metric-driven analysis and feedback systems for enabling empirically guided software development<>icse<>douglas c. schmidt<>
16997<>1706_18<>nulo<>a comparison between deductive and object-oriented database systems<>dood<>jeffrey d. ullman<>
23851<>1717_19<>kwong-sak leung<>automatic refinement of knowledge bases with fuzzy rules<>kbs<>man leung wong<>
41088<>1783_24<>oded maler:amir pnueli<>from timed to hybrid systems<>rex<>zohar manna<>
41107<>1783_43<>thomas a. henzinger:amir pnueli<>temporal proof methodologies for real-time systems<>popl<>zohar manna<>
41123<>1783_59<>amir pnueli<>completing the temporal picture<>tcs<>zohar manna<>
41124<>1783_60<>thomas a. henzinger:amir pnueli<>timed transition systems<>rex<>zohar manna<>
41133<>1783_69<>amir pnueli<>on the faithfulness of formal models<>mfcs<>zohar manna<>
8818<>1796_12<>stephen a. vavasis<>density graphs and separators<>soda<>gary l. miller<>
8833<>1796_27<>shang-hua teng:stephen a. vavasis<>a unified geometric approach to graph separators<>focs<>gary l. miller<>
8838<>1796_32<>john h. reif<>"parallel tree contraction, part 2: further applications."<>siamcomp<>gary l. miller<>
8855<>1796_49<>richard j. anderson<>deterministic parallel list ranking<>algorithmica<>gary l. miller<>
38960<>1870_22<>nathan linial:ronald l. rivest<>results on learnability and the vapnik-chervonenkis dimension<>iandc<>yishay mansour<>
39048<>1870_110<>baruch schieber:prasoon tiwari<>lower bounds for computations with the floor operation<>siamcomp<>yishay mansour<>
32457<>1898_40<>svatopluk poljak<>weak three-linking in eulerian digraphs<>siamdm<>toshihide ibaraki<>
32466<>1898_49<>susumu suzuki:masahichi kishi<>using relaxation techniques to evaluate queries in deductive databases<>dexa<>toshihide ibaraki<>
3562<>1907_34<>leo mark:nick roussopoulos<>incremental implementation model for relational databases with transaction time<>tkde<>christian s. jensen<>
9514<>1943_49<>john r. gilbert:ton kloks:hjalmtyr hafsteinsson<>"approximating treewidth, pathwidth, and minimum elimination tree height."<>wg<>hans l. bodlaender<>
9540<>1943_75<>nulo<>some lower bound results for decentralized extrema-finding in rings of processors<>jcss<>hans l. bodlaender<>
9563<>1943_98<>nulo<>on the complexity of some coloring games<>ijfcs<>hans l. bodlaender<>
9575<>1943_110<>nulo<>on disjoint cycles<>wg<>hans l. bodlaender<>
9577<>1943_112<>nulo<>new lower bound techniques for distributed leader finding and other problems on rings of processors<>tcs<>hans l. bodlaender<>
26340<>1945_29<>per-ake larson:frank pellow<>supporting database access in the hermes programming language<>cascon<>qiang zhu<>
9201<>1961_22<>tore risch<>building adaptive applications using active mediators<>dexa<>gio wiederhold<>
9221<>1961_42<>xiaolei qian<>incremental recomputation of active relational expressions<>tkde<>gio wiederhold<>
9227<>1961_48<>david beech:toshimi minoura<>multimedia database depelopment in japan<>debu<>gio wiederhold<>
11993<>1964_6<>nulo<>the chromatic difference sequence of the cartesian product of graphs<>dm<>huishan zhou<>
27900<>1997_10<>rudolf k. keller:mary cameron:dennis b. troup<>user interface development and software environments: the chiron-1 system<>icse<>richard n. taylor<>
4421<>2008_11<>nulo<>performance engineering of software systems<>cmg<>connie u. smith<>
4435<>2008_25<>nulo<>performance engineering of software systems<>sigmetrics<>connie u. smith<>
29513<>2019_3<>carlos h. diaz:yusuf leblebici<>an accurate analytical delay model for bicmos driver circuits<>tcad<>sung-mo kang<>
29549<>2019_39<>yung-ho shih:yusuf leblebici<>new simulation methods for mos vlsi timing and reliability<>iccad<>sung-mo kang<>
29550<>2019_40<>h. y. chen<>a new circuit optimization technique for high performance cmos circuits<>tcad<>sung-mo kang<>
29553<>2019_43<>yung-ho shih<>illiads: a new fast mos timing simulator using direct equation-solving approach<>dac<>sung-mo kang<>
27985<>2030_0<>dereck s. meek<>a guided clothoid spline<>cagd<>r. s. d. thomas<>
27963<>2031_18<>daniel bienstock:neil robertson:paul d. seymour<>quickly excluding a forest<>jct<>robin thomas<>
27964<>2031_19<>paul d. seymour<>an end-faithful spanning tree counterexample<>dm<>robin thomas<>
27965<>2031_20<>neil robertson:paul d. seymour<>a survey of linkless embeddings<>gst<>robin thomas<>
27974<>2031_29<>igor kriz<>analyzing nash-williams' partition theorem by means of ordinal types<>dm<>robin thomas<>
27975<>2031_30<>neil robertson:paul d. seymour<>excluding infinite minors<>dm<>robin thomas<>
27976<>2031_31<>jiri matousek<>algorithms finding tree-decompositions of graphs<>jal<>robin thomas<>
16257<>2037_0<>janet wu:seema hiranandani:harry berryman<>runtime compilation methods for multicomputers<>icpp<>joel h. saltz<>
16259<>2037_2<>ravi mirchandaney<>the preprocessed doacross loop<>icpp<>joel h. saltz<>
16269<>2037_12<>seema hiranandani:piyush mehrotra:harry berryman<>performance of hashed cache data migration schemes on multicomputers<>jpdc<>joel h. saltz<>
24447<>2083_3<>sandip kundu:sudhakar m. reddy<>design of robustly testable combinational logic circuits<>tcad<>niraj k. jha<>
24468<>2083_24<>andres r. takach<>easily testable gate-level and dcvs multipliers<>tcad<>niraj k. jha<>
24507<>2083_63<>sying-jyan wang<>design and synthesis of self-checking vlsi circuits and systems<>iccd<>niraj k. jha<>
24509<>2083_65<>nulo<>"totally self-checking checker designs for bose-lin, bose, and blaum codes."<>tcad<>niraj k. jha<>
24546<>2083_102<>konstantinos i. diamantaras<>a new transition count method for testing of logic circuits<>tcad<>niraj k. jha<>
24596<>2083_152<>bapiraju vinnakota<>design of multiprocessor systems for concurrent error detection and fault diagnosis<>ftcs<>niraj k. jha<>
31306<>2174_0<>georges g. grinstein:r. daniel bergeron<>interactive data exploration with a supercomputer<>visualization<>stuart smith<>
31308<>2174_2<>nulo<>auditory representation of scientific data<>dagstuhl<>stuart smith<>
31260<>2180_29<>hiroaki kitano:tetsuya higuchi<>ga-1: a parallel associative memory processor for rule learning with genetic algorithms<>icga<>stephen f. smith<>
7013<>2268_5<>nulo<>on the parallelization of characteristic-set-based algorithms<>acpc<>dongming wang<>
7020<>2268_12<>nulo<>mechanical manipulation for a class of differential systems<>jsc<>d. wang<>
7022<>2268_14<>bernd schurmann<>computer algebra and neurodynamics<>physik<>dongming wang<>
29878<>2273_0<>ahmed louri:sheng-chiech liang<>design and evaluation of fault-tolerant interleaved memory systems<>icpp<>sy-yen kuo<>
23204<>2291_4<>d. t. lee<>maximum independent set of a permutation graph in  tracks<>isa<>majid sarrafzadeh<>
13503<>2306_0<>e. j. farrell:g. m. constantine<>on matching coefficients<>dm<>j. m. guo<>
27794<>2308_53<>ioannis g. tollis<>representations of graphs on a cylinder<>siamdm<>roberto tamassia<>
27801<>2308_60<>ioannis g. tollis:jeffrey scott vitter<>lower bounds for planar orthogonal drawings of graphs<>ipl<>roberto tamassia<>
27850<>2308_109<>jeffrey scott vitter<>parallel transitive closure and point location in planar structures<>siamcomp<>roberto tamassia<>
27862<>2308_121<>nulo<>an incremental reconstruction method for dynamic planar point location<>ipl<>roberto tamassia<>
21433<>2326_75<>philip s. yu<>determining beneficial semijoins for a join sequence in distributed query processing<>icde<>ming-syan chen<>
21460<>2326_102<>philip s. yu:kun-lung wu<>optimal all-to-all broadcasting schemes in distributed systems<>pdis<>ming-syan chen<>
17694<>2362_0<>w. d. wallis<>on clique partitions of split graphs<>dm<>j. wu<>
1685<>2381_7<>r. mahesh:c. pandu rangan<>on finding the minimum bandwidth of interval graphs<>iandc<>aravind srinivasan<>
1720<>2381_42<>c. pandu rangan<>efficient algorithms for the minimum weighted dominating clique problem on permutation graphs<>tcs<>aravind srinivasan<>
27347<>2427_25<>helen sims-coomber:michael thorne<>a non-euclidean implementation of logo<>cg<>ralph r. martin<>
27356<>2427_34<>m. m. anguh<>"quadtrees, transforms and image coding."<>cgf<>ralph r. martin<>
27365<>2427_43<>a. david marshall:d. hutber<>automatic inspection of mechanical parts using geometric models and laser range finder data<>ivc<>ralph r. martin<>
10544<>2493_3<>nulo<>pam: a process algebra manipulator<>cav<>huimin lin<>
12431<>2522_31<>chee-keng yap<>reversal complexity<>siamcomp<>jianer chen<>
12464<>2522_64<>jim cox:bud mishra<>an nl hierarchy<>ipl<>jianer chen<>
12486<>2522_86<>nulo<>characterizing parallel hierarchies by reducibilities<>ipl<>jianer chen<>
26729<>2575_2<>yu-song hou<>a branch-and-bound algorithm for single-row routing<>jise<>rong-jaye chen<>
26985<>2589_7<>t. r. girill:thomas d. griffin<>"extended subject access to hypertext online documentation, parts i and ii: the search-support and maintenance problems."<>jasis<>robert b. jones<>
1281<>2662_2<>stan sclaroff<>closed-form solutions for physically based shape modeling and recognition<>pami<>alex pentland<>
30982<>2683_14<>haim judah<>forcing minimal degree of constructibility<>jsyml<>saharon shelah<>
31034<>2683_66<>wilfried hodges<>there are reasonably nice logics<>jsyml<>saharon shelah<>
21272<>2703_3<>luc de raedt:bern martens<>integrity constraints and interactive concept-learning<>icml<>maurice bruynooghe<>
21276<>2703_7<>luc de raedt:johan feyaerts<>acquiring object-knowledge for learning systems<>ecml<>maurice bruynooghe<>
8893<>2734_9<>nulo<>formal grammars and cognitive architectures<>fair<>gheorghe paun<>
8955<>2734_71<>nulo<>a characterization of recursively enumerable languages<>eatcs<>gheorghe paun<>
7247<>2749_16<>hermann a. maurer:arto salomaa<>bounded delay l codes<>tcs<>derick wood<>
31166<>2773_60<>nulo<>the efficient learning of multiple task sequences<>nips<>satinder p. singh<>
3103<>2785_0<>biing-feng wang:gen-huey chen<>a simple approach to implementing multiplication with small tables<>ipl<>chuen-liang chen<>
3133<>2827_2<>thomas d. c. little:c. s. chang:p. bruce berra<>multimedia synchronization<>debu<>c. y. roger chen<>
28092<>2845_0<>yair wand<>a unified model of software and data decomposition<>icis<>ron weber<>
28094<>2845_2<>yanchun zhang<>an ontological evaluation of niam's grammar for conceptual schema diagrams<>icis<>ron weber<>
4914<>2852_1<>lingtao wang<>distributed instruction set computer architecture<>tc<>chuan-lin wu<>
4917<>2852_4<>nader bagherzadeh:seng-lai heng<>a parallel asynchronous garbage collection algorithm for distributed systems<>tkde<>chuan-lin wu<>
21840<>2854_2<>nulo<>features and formulae<>coling<>mark johnson<>
4937<>2859_8<>fang-shi lai<>a hybrid number system processor with geometric and complex arithmetic capabilities<>tc<>ching-farn eric wu<>
4979<>2867_6<>guo-zhen xiao:ba-zhong shen:chi song wong<>some spectral techniques in coding theory<>dm<>chuan-kun wu<>
28055<>2871_6<>edward g. coffman jr.:costas courcoubetis:m. r. garey:david s. johnson:lyle a. mcgeoch:peter w. shor:mihalis yannakakis<>fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study<>stoc<>richard r. weber<>
10473<>2888_6<>nulo<>solving probabilistic multiobjective decision problems by constructing maximum probabilistic deduction graphs<>jise<>han-lin li<>
26222<>2902_7<>nulo<>effects of arbitration protocols on the performance of multiple-bus multiprocessors<>icpp<>qing yang<>
26231<>2902_16<>laxmi n. bhuyan<>analysis of packet-switched multiple-bus multiprocessor systems<>tc<>qing yang<>
26236<>2902_21<>hong wang<>prime cube graph approach for processor allocation in hypercube multiprocessors<>icpp<>qing yang<>
26108<>2903_10<>craig a. knoblock:josh d. tenenberg<>characterizing abstraction hierarchies for planning<>aaai<>qiang yang<>
26117<>2903_19<>fahiem bacchus<>the downward refinement property<>ijcai<>qiang yang<>
26118<>2903_20<>david e. foulser:ming li<>a quantitative theory for plan merging<>aaai<>qiang yang<>
944<>2949_16<>nulo<>hierarchical quorum consensus: a new algorithm for managing replicated data<>tc<>akhil kumar<>
29902<>3002_1<>ahmad abd. majid<>closed smooth piecewise bicubic surfaces<>tog<>seng luan lee<>
19524<>3044_5<>hongyi zhou:ahmed gheith<>real-time threads<>sigops<>karsten schwan<>
13560<>3047_34<>ichiro suzuki<>clock synchronization and the power of broadcasting<>dc<>joseph y. halpern<>
13575<>3047_49<>moshe y. vardi<>model checking vs. theorem proving: a manifesto<>kr<>joseph y. halpern<>
13600<>3047_74<>ronald fagin<>"uncertainty, belief, and probability."<>ci<>joseph y. halpern<>
13652<>3047_126<>ronald fagin:moshe y. vardi<>a model-theoretic analysis of knowledge<>jacm<>joseph y. halpern<>
13674<>3047_148<>adam j. grove<>naming and identity in a multi-agent epistemic logic<>kr<>joseph y. halpern<>
13706<>3047_180<>nulo<>knowledge and probability in distributed systems (abstract)<>tapsoft<>joseph y. halpern<>
13734<>3047_208<>nulo<>"the relationship between knowledge, belief and certainty."<>amai<>joseph y. halpern<>
29955<>3049_0<>s. c. shee<>on skolem graceful graphs<>dm<>s. m. lee<>
29957<>3049_2<>edward f. schmeichel:s. c. shee<>on felicitous graphs<>dm<>sin-min lee<>
29418<>3060_41<>david lester<>a modular fully-lazy lambda lifter in haskell<>spe<>simon l. peyton jones<>
8011<>3147_4<>nulo<>consistency in dataflow graphs<>tpds<>edward a. lee<>
6810<>3166_0<>j. h. rubinstein<>the steiner ratio conjecture for six points<>jct<>d. a. thomas<>
3874<>3175_1<>h. a. fatmi<>run-time support for parallel functional programming on shared-memory multiprocessors<>jss<>ching-cheng lee<>
5407<>3189_31<>j. richard burke:chienhua chen:tsung-ying lee<>performance analysis of single stage interconnection networks<>tc<>dharma p. agrawal<>
4329<>3195_10<>mihalis yannakakis<>"optimization, approximation, and complexity classes."<>jcss<>christos h. papadimitriou<>
39107<>3230_2<>nulo<>on the chromatic uniqueness of certain bipartite graphs<>dm<>y. h. peng<>
25422<>3278_0<>david s. touretzky<>a connectionist learning approach to analyzing linguistic stress<>nips<>prahlad gupta<>
8639<>3328_0<>biing-feng wang:chuen-liang chen<>a simple approach to implementing multiplication with small tables<>ipl<>gen-huey chen<>
20260<>3330_6<>james d. kelly jr.<>a hybrid genetic algorithm for classification<>ijcai<>lawrence davis<>
27005<>3360_0<>nulo<>information systems<>computer<>ralph h. sprague jr.<>
35712<>3371_5<>stephen s. yau:doo-hwan bae<>proof: a parallel object-oriented functional computation model<>jpdc<>xiaoping jia<>
1145<>3411_6<>bogdan s. chlebus:krzysztof diks<>optimal broadcasting in faulty hypercubes<>ftcs<>andrzej pelc<>
1151<>3411_12<>fawzi al-thukair:ivan rival:jorge urrutia<>"motion planning, two-directional point representations, and ordered sets."<>siamdm<>andrzej pelc<>
1165<>3411_26<>nulo<>broadcasting in complete networks with faulty nodes using unreliable calls<>ipl<>andrzej pelc<>
1232<>3411_93<>nulo<>undirected graph models for system-level fault diagnosis<>tc<>andrzej pelc<>
1256<>3411_117<>jurek czyzowicz:k. b. lakshmanan<>searching with a forbidden lie pattern in responses<>ipl<>andrzej pelc<>
27394<>3440_1<>smadar shiffman:alice w. wu:alex d. poon:christopher d. lane:blackford middleton:fred e. masarie jr.:gregory f. cooper:edward h. shortliffe:lawrence m. fagan<>building a speech interface to a medical diagnostic system<>expert<>randolph a. miller<>
16695<>3449_9<>richard hull<>on the expressive power of database queries with intermediate types<>jcss<>jianwen su<>
16705<>3449_19<>guozhu dong<>object behaviors and scripts<>dbpl<>jianwen su<>
16725<>3449_39<>nulo<>dynamic constraints and object migration<>vldb<>jianwen su<>
18042<>3526_11<>nulo<>unification modulo an equality theory for equational logic programming<>jcss<>jia-huai you<>
18059<>3526_28<>zhiyong liu<>realizing frequently used permutations on syncube<>icpp<>jia-huai you<>
18065<>3526_34<>li-yan yuan:cheng hui wang<>a proof-theoretic framework for nonmonotonic reasoning and logic programming<>icci<>jia-huai you<>
18077<>3526_46<>liwu li<>making default inferences from logic programs<>ci<>jia-huai you<>
12196<>3569_11<>derek g. corneil<>graph properties and hypergraph colourings<>dm<>jason i. brown<>
12200<>3569_15<>vojtech rodl<>a ramsey type problem concerning vertex colourings<>jct<>jason i. brown<>
22436<>3590_36<>avrim blum:tao jiang:john tromp:mihalis yannakakis<>linear approximation of shortest superstrings<>stoc<>ming li<>
33755<>3608_5<>nulo<>bounded degree graph inference from walks<>colt<>vijay raghavan<>
33757<>3608_7<>anand r. tripathi<>improved diagnosability algorithms<>tc<>vijay v. raghavan<>
33767<>3608_17<>anand r. tripathi<>sequential diagnosability is co-np complete<>tc<>vijay v. raghavan<>
9282<>3620_17<>baosheng hu:fuqing shao:xiaoqiu he<>gpss simulation study of quality inspection system<>ifip5-3<>gang wu<>
16507<>3658_1<>f. donelson smith<>abc: a hypermedia system for artifact-based collaboration<>ht<>john b. smith<>
16565<>3661_6<>nulo<>designing biomorphs with an interactive genetic algorithm<>icga<>joshua r. smith<>
14024<>3770_3<>nulo<>consistency of infinitesimal perturbation analysis estimators with rates<>questa<>jian-qiang hu<>
8263<>3772_2<>nulo<>inverting a vandermonde matrix in minimum parallel time<>ipl<>franco p. preparata<>
8278<>3772_17<>jean-daniel boissonnat:olivier devillers<>computing the union of 3-colored triangles<>ijcga<>franco p. preparata<>
8305<>3772_44<>panagiotis alevizos:jean-daniel boissonnat<>an optimal algorithm for the boundary of a cell in a union of rays-corrigendum<>algorithmica<>franco p. preparata<>
8353<>3772_92<>scot w. hornick<>deterministic p-ram simulation with constant redundancy<>iandc<>franco p. preparata<>
32576<>3781_21<>louis o. hertzberger:frans c. a. groen<>intelligent autonomous systems<>ras<>takeo kanade<>
32643<>3782_1<>charles e. thorpe:martial hebert:steven a. shafer<>toward autonomous driving: the cmu navlab. part i - perception<>expert<>takeo kanade<>
13349<>3809_5<>laurent mounier<>a tool set for deciding behavioral equivalences<>concur<>jean-claude fernandez<>
27556<>3877_5<>s. sudarshan<>aggregation and relevance in deductive databases<>vldb<>raghu ramakrishnan<>
27569<>3877_18<>jeffrey f. naughton<>bottom-up evaluation of logic programs<>birthday<>raghu ramakrishnan<>
27570<>3877_19<>catriel beeri<>on the power of magic<>jlp<>raghu ramakrishnan<>
6066<>3890_3<>edward g. coffman jr.:costas courcoubetis:m. r. garey:lyle a. mcgeoch:peter w. shor:richard r. weber:mihalis yannakakis<>fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study<>stoc<>david s. johnson<>
6092<>3890_29<>janos csirik<>bounded space on-line bin packing: best is better than first<>soda<>david s. johnson<>
38145<>3894_10<>philip s. yu:avraham leff<>on robust transaction routing and load sharing<>tods<>yann-hang lee<>
35757<>3970_14<>fuji zhang<>on the numbers of spanning trees and eulerian tours in generalized de bruijn graphs<>dm<>xueliang li<>
2390<>3975_10<>hongjun lu:ashvin d'souza:chee chin low<>storage management in geographic information systems<>ssd<>beng chin ooi<>
2442<>3975_62<>hweehwa pang:hongjun lu<>query processing in oodb<>dasfaa<>beng chin ooi<>
2461<>3975_81<>hweehwa pang:hongjun lu<>an efficient semantic query optimization algorithm<>icde<>beng chin ooi<>
14281<>3984_3<>richard s. rosenberg<>a measure of semantic relatedness for resolving ambiguities in natural language database requests<>dke<>julia a. johnson<>
19650<>4031_0<>bennet manvel:aaron meyerowitz:a. schwenk:paul k. stockmeyer<>reconstruction of sequences<>dm<>k. smith<>
40351<>4059_5<>winfried k. grassmann<>a numerically stable algorithm for two server queue models<>questa<>y. zhao<>
33605<>4070_16<>albert burger<>performance measurement of some main memory database recovery algorithms<>icde<>vijay kumar<>
33608<>4070_19<>albert burger:patricia simpson<>an integrated data structure with multiple access paths<>vdb<>vijay kumar<>
33615<>4070_26<>meichun hsu<>a superior two-phase locking algorithm and its performance<>isci<>vijay kumar<>
33618<>4070_29<>james mumper<>krishna - concurrency control algorithms based on dynamic attributes<>dexa<>vijay kumar<>
27019<>4105_8<>amos fiat:michael luby:lyle a. mcgeoch:daniel dominic sleator:neal e. young<>competitive paging algorithms<>jal<>richard m. karp<>
27033<>4105_22<>phillip b. gibbons:vijaya ramachandran:danny soroker:robert endre tarjan<>transitive compaction in parallel via branchings<>jal<>richard m. karp<>
27095<>4105_84<>nulo<>probabilistic recurrence relations<>stoc<>richard m. karp<>
35520<>4110_12<>john a. n. lee<>a methodology for constructing predicate transition net specifications<>spe<>xudong he<>
35493<>4112_2<>nulo<>an improved algorithm for the planar 3-cut problem<>jal<>xin he<>
35554<>4113_0<>gang wu:baosheng hu:fuqing shao<>gpss simulation study of quality inspection system<>ifip5-3<>xiaoqiu he<>
31581<>4158_0<>chien-min wang<>compiler techniques for extracting loop-level parallelism<>jise<>sheng-de wang<>
27625<>4222_7<>chris brink:ingrid rewitzky<>autodescriptivity: beware!<>cj<>renate a. schmidt<>
30324<>4241_14<>srinivas devadas:kurt keutzer<>a synthesis-based test generation and compaction algorithm for multifaults<>dac<>sharad malik<>
30335<>4241_25<>kurt keutzer:alexander saldanha<>is redundancy necessary to reduce delay?<>tcad<>sharad malik<>
38814<>4257_1<>john konvalina<>bit strings without -separation<>bit<>yi-hsin liu<>
22651<>4280_14<>manuel blum:william s. evans:peter gemmell:sampath kannan<>checking the correctness of memories<>focs<>moni naor<>
22698<>4280_61<>nulo<>bit commitment using pseudorandomness<>joc<>moni naor<>
22723<>4280_86<>amos fiat<>rigorous time/space tradeoffs for inverting functions<>stoc<>moni naor<>
22732<>4280_95<>nulo<>a lower bound on probabilistic algorithms for distributive ring coloring<>siamdm<>moni naor<>
16621<>4284_1<>grigori mints:enn tyugu<>type-theoretical semantics of some declarative languages<>balt<>jan m. smith<>
214<>4302_14<>ravi ponnusamy<>implementation and evaluation of hough transform algorithms on a shared-memory multiprocessor<>jpdc<>alok n. choudhary<>
249<>4302_49<>sanjay ranka<>mesh and pyramid algorithms for iconic indexing<>ics<>alok n. choudhary<>
340<>4302_140<>ravi ponnusamy<>guided scheduling schemes for image understanding tasks for shared and distributed memory multiprocessors<>ipps<>alok n. choudhary<>
34033<>4303_0<>p.-h. shih:k.-e. chang<>neural computation network for global routing<>cad<>w.-s. feng<>
25666<>4317_6<>nulo<>symbolic computation and parallel software<>acpc<>paul s. wang<>
9262<>4387_2<>gunter rote:binhai zhu:zhengyan wang<>counting k-subsets and convex k-gons in the plane<>ipl<>gerhard j. woeginger<>
28901<>4494_11<>nulo<>binary self-stabilization in distributed systems<>ipl<>sukumar ghosh<>
21975<>4520_4<>nulo<>interactive modelling in decision support systems<>iwc<>matthew r. jones<>
21939<>4522_5<>nulo<>bringing the c libraries with us into a multi-threaded future<>usenix<>m. b. jones<>
12537<>4562_1<>sukhamay kundu<>the strong semantics for logic programs<>ismis<>jianhua chen<>
12543<>4562_7<>wu wang<>learning by discovering problem solving heuristics through experience<>tkde<>jianhua chen<>
11046<>4566_69<>walid g. aref<>extending a dbms with spatial operations<>ssd<>hanan samet<>
11059<>4566_82<>erik g. hoel<>efficient processing of spatial queries in line segment databases<>ssd<>hanan samet<>
11326<>4654_14<>yasuo hidaka:hanpei koike:jun'ichi tatemura<>a static load partitioning method based on execution profile for committed choice languages<>slp<>hidehiko tanaka<>
36353<>4671_6<>edward m. reingold<>scheduling on a hypercube<>ipl<>xiaojun shen<>
17519<>4701_3<>muruganandan kumar<>transaction models for design environments<>jss<>johnny wong<>
25298<>4710_3<>nulo<>early performance estimation of super scalar machine models<>iccd<>pradip bose<>
857<>4743_14<>tilman becker:owen rambow<>long-distance scrambling and tree adjoining grammars<>eacl<>aravind k. joshi<>
6907<>4786_9<>nulo<>a new approach to knock-knee channel routing<>isa<>dorothea wagner<>
6923<>4786_25<>michael formann:frank wagner<>routing through a dense channel with minimum total wire length<>soda<>dorothea wagner<>
11235<>4796_6<>v. venkatakrishnan:timothy j. barth<>a mimd implementation of a parallel euler solver for unstructured grids<>ppsc<>horst d. simon<>
11238<>4796_9<>jack dongarra:alan h. karp:ken miura<>gordon bell prize lectures<>sc<>horst d. simon<>
11266<>4800_9<>jayant kalagnanam:yumi iwasaki<>the mathematical bases for qualitative reasoning<>expert<>herbert a. simon<>
18327<>4816_7<>arie segev<>evaluation of rule processing strategies in expert databases<>icde<>j. leon zhao<>
18337<>4816_17<>arie segev<>data management for large rule systems<>vldb<>j. leon zhao<>
10147<>4874_5<>nulo<>some results on ends and automorphisms of graphs<>dm<>h. a. jung<>
10152<>4874_10<>evelyne flandrin:hao li<>"hamiltonism, degree sum and neighborhood intersections."<>dm<>h. a. jung<>
22527<>4900_0<>houng-wern perng:chi-yi hwang:youn-long lin<>channel density reduction by routing over the cells<>tcad<>min-siang lin<>
22529<>4900_2<>hourng-wern perng:chi-yi hwang:youn-long lin<>channel density reduction by routing over the cells<>dac<>min-siang lin<>
15089<>4919_0<>ted g. lewis:r. currey<>data parallel program design<>acpc<>jie liu<>
17954<>5002_0<>robert korfhage<>a cautionary tale<>sigir<>jing-jye yang<>
35086<>5018_16<>stephan olariu:zhaofang wen<>a faster optimal algorithm for the measure problem<>pc<>wei xiong zhang<>
10788<>5068_0<>arto salomaa:derick wood<>bounded delay l codes<>tcs<>hermann a. maurer<>
24947<>5073_17<>j. andrew holey<>triangulation voronoi diagram and convex hull in k-space on mesh-connected arrays and hypercubes<>icpp<>oscar h. ibarra<>
24981<>5073_51<>j. andrew holey<>triangulation in a plane and 3-d convex hull on mesh-connected arrays and hypercubes<>ipps<>oscar h. ibarra<>
24998<>5073_68<>tao jiang<>learning regular languages from counterexamples<>jcss<>oscar h. ibarra<>
25040<>5073_110<>nicholas q. tran<>on space-bounded synchronized alternating turing machines<>fct<>oscar h. ibarra<>
25042<>5073_112<>hui wang<>parallel parsing on a one-way linear array of finite-state machines<>tcs<>oscar h. ibarra<>
25051<>5073_121<>tao jiang<>the power of alternating one-reversal counters and stacks<>siamcomp<>oscar h. ibarra<>
25058<>5073_128<>myung hee kim<>fast parallel algorithms for solving triangular systems of linear equations on the hypercube<>ipps<>oscar h. ibarra<>
24216<>5078_24<>colin mcdiarmid:bruce a. reed<>acyclic coloring of graphs<>rsa<>noga alon<>
24279<>5078_87<>richard a. brualdi:bryan l. shader<>multicolored forests in bipartite decompositions of graphs<>jct<>noga alon<>
32216<>5081_26<>zohar manna:amir pnueli<>timed transition systems<>rex<>thomas a. henzinger<>
32338<>5081_148<>rajeev alur<>logics and models of real time: a survey<>rex<>thomas a. henzinger<>
32359<>5081_169<>rajeev alur:tomas feder<>the benefits of relaxing punctuality<>podc<>thomas a. henzinger<>
32362<>5081_172<>zohar manna:amir pnueli<>temporal proof methodologies for real-time systems<>popl<>thomas a. henzinger<>
35194<>5082_16<>jane w.-s. liu:kwei-jay lin:wei kuan shih:albert chuang-shi yu:jen-yao chung<>algorithms for scheduling imprecise computations<>computer<>wei zhao<>
35205<>5082_27<>edwin k. p. chong<>performance evaluation of scheduling algorithms for imprecise computer systems<>jss<>wei zhao<>
9441<>5105_17<>nulo<>a monoidal closed category of event structures<>mfps<>guo-qiang zhang<>
22327<>5148_6<>andrea schaerf<>querying concept-based knowledge bases<>pdk<>maurizio lenzerini<>
22332<>5148_11<>nulo<>type data bases with incomplete information<>isci<>maurizio lenzerini<>
22342<>5148_21<>francesco m. donini:daniele nardi:werner nutt<>tractable concept languages<>ijcai<>maurizio lenzerini<>
22344<>5148_23<>andrea schaerf<>concept languages as query languages<>aaai<>maurizio lenzerini<>
22349<>5148_28<>francesco m. donini:daniele nardi:werner nutt<>the complexity of concept languages<>kr<>maurizio lenzerini<>
22371<>5148_50<>francesco m. donini:daniele nardi:andrea schaerf<>a hybrid system with datalog and concept languages<>aiia<>maurizio lenzerini<>
22379<>5148_58<>francesco m. donini:daniele nardi:werner nutt<>tractable concept languages<>dlog<>maurizio lenzerini<>
21586<>5157_17<>ellen e. witte:roger d. chamberlain<>parallel simulated annealing using speculative computation<>tpds<>mark a. franklin<>
21593<>5157_24<>roger d. chamberlain<>analysis of parallel mixed-mode simulation algorithms<>ipps<>mark a. franklin<>
21647<>5163_44<>michael j. carey:miron livny:eugene j. shekita<>data caching tradeoffs in client-server dbms architectures<>sigmod<>michael j. franklin<>
33647<>5234_0<>norman carver<>a new framework for sensor interpretation: planning to resolve sources of uncertainty<>aaai<>victor r. lesser<>
28741<>5288_31<>jeff magee<>parallel algorithm design for workstation clusters<>spe<>shing-chi cheung<>
40694<>5293_11<>giuseppe f. italiano<>maintaining biconnected components of dynamic planar graphs<>icalp<>zvi galil<>
40696<>5293_13<>giuseppe f. italiano<>data structures and algorithms for disjoint set union problems<>csur<>zvi galil<>
15684<>5326_14<>esther m. arkin:samir khuller<>geometric knapsack problems<>wads<>joseph s. b. mitchell<>
15717<>5326_47<>esther m. arkin:l. paul chew:daniel p. huttenlocher:klara kedem<>an efficiently computable metric for comparing polygonal shapes<>pami<>joseph s. b. mitchell<>
15733<>5326_63<>erik l. wynters<>finding optimal bipartitions of points and polygons<>wads<>joseph s. b. mitchell<>
15734<>5326_64<>esther m. arkin:klara kedem:josef sprinzak:michael werman<>matching points into noise regions: combinatorial bounds and algorithms<>soda<>joseph s. b. mitchell<>
15747<>5326_77<>leonidas j. guibas:john hershberger:jack snoeyink<>approximating polygons and subdivisions with minimum link paths<>isa<>joseph s. b. mitchell<>
15594<>5327_9<>eugenio moggi<>kripke-style models for typed lambda calculus<>apal<>john c. mitchell<>
15605<>5327_20<>nulo<>type inference with simple subtypes<>jfp<>john c. mitchell<>
15613<>5327_28<>luca cardelli<>operations on records<>mscs<>john c. mitchell<>
15656<>5327_71<>paris c. kanellakis:harry g. mairson<>unification and ml-type reconstruction<>birthday<>john c. mitchell<>
15657<>5327_72<>nulo<>on abstraction and the expressive power of programming languages<>tacs<>john c. mitchell<>
2533<>5328_37<>rodrigo a. botafogo<>identifying aggregates in hypertext structures<>ht<>ben shneiderman<>
26403<>5357_8<>thomas a. henzinger<>logics and models of real time: a survey<>rex<>rajeev alur<>
26439<>5357_44<>tomas feder:thomas a. henzinger<>the benefits of relaxing punctuality<>podc<>rajeev alur<>
26449<>5357_54<>costas courcoubetis:david l. dill<>verifying automata specifications of probabilistic real-time systems<>rex<>rajeev alur<>
24694<>5359_72<>frits w. vaandrager<>forward and backward simulations for timing-based systems<>rex<>nancy a. lynch<>
24763<>5359_141<>hagit attiya:cynthia dwork:larry j. stockmeyer<>bounds on the time to reach agreement in the presence of timing uncertainty<>stoc<>nancy a. lynch<>
15167<>5368_6<>jiafu xu<>development transformation based on higher order type theory<>constructivity<>jianguo lu<>
14143<>5376_3<>robert c. zeleznik:d. brookshire conner:matthias m. wloka:daniel g. aliaga:nathan t. huang:philip m. hubbard:brian knep:henry kaufman:andries van dam<>an object-oriented framework for the integration of interactive animation techniques<>siggraph<>john f. hughes<>
14145<>5376_5<>tinsley a. galyean<>sculpting: an interactive volumetric modeling technique<>siggraph<>john f. hughes<>
14195<>5386_14<>ryszard kubiak:john launchbury<>implementing projection-based strictness analysis<>fp<>john hughes<>
14236<>5390_4<>nulo<>fuzzy modeling using generalized neural networks and kalman filter algorithm<>aaai<>jyh-shing roger jang<>
20611<>5413_0<>abdol-hossein esfahanian:bruce e. sagan<>the twisted n-cube with application to multiprocessing<>tc<>lionel m. ni<>
10914<>5445_4<>nulo<>a parallel algorithm for the unbalanced orthogonal procrustes problem<>pc<>h. park<>
10920<>5445_10<>l. magnus ewerbring<>an algorithm for the generalized singular value decomposition on massively parallel computers<>ics<>haesun park<>
4044<>5451_5<>j. lee:lawrence snyder<>programming simple for parallel portability<>lcpc<>calvin lin<>
4055<>5451_16<>lawrence snyder<>portable parallel programming: cross machine comparisons for simple<>ppsc<>calvin lin<>
15405<>5453_1<>william h. sanders<>reduced base model construction methods for stochastic activity networks<>jsac<>john f. meyer<>
15424<>5453_20<>b. e. aupperle<>state space generation for degradable multiprocessor systems<>ftcs<>john f. meyer<>
15431<>5456_5<>roel wieringa:hans weigand:frank dignum<>the inheritance of dynamic and deontic integrity constraints<>amai<>john-jules ch. meyer<>
7465<>5470_5<>lorenzo martino<>object-oriented database management systems: concepts and issues<>computer<>elisa bertino<>
7515<>5470_55<>fausto rabitti:won kim:darrell woelk<>a model of authorization for next-generation database systems<>tods<>elisa bertino<>
4087<>5474_12<>c. s. george lee<>neural-network-based fuzzy logic control and decision system<>tc<>chin-teng lin<>
16892<>5509_5<>nulo<>findings from observational studies of collaborative work<>ijmms<>john c. tang<>
16900<>5509_13<>scott l. minneman<>videodraw: a video interface for collaborative drawing<>tois<>john c. tang<>
8614<>5573_0<>yung-chen hung<>the quickest path problem in distributed computing systems<>wdag<>gen-huey chen<>
8616<>5573_2<>yung-chen hung<>on the quickest path problem<>icci<>gen-huey chen<>
35409<>5621_2<>yongjin zhu:feng tian<>more powerful closure operations on graphs<>dm<>xiaotie deng<>
8687<>5648_30<>nulo<>approaches to physical optimization<>ppsc<>geoffrey fox<>
27512<>5672_90<>tomas feder<>"clique partitions, graph compression, and speeding-up algorithms"<>stoc<>rajeev motwani<>
28535<>5729_6<>richard e. ladner<>safety and liveness of omega-context-free languages<>ipl<>soma chaudhuri<>
33265<>5740_3<>ryohei nakano<>conventional genetic algorithm for job shop problems<>icga<>takeshi yamada<>
26943<>5764_0<>c. bernard shung:ken rimey:edward wang:mani b. srivastava:brian c. richards:erik lettang:syed khalid azim:lars e. thon:paul n. hilfinger:jan m. rabaey:robert w. brodersen<>an integrated cad system for algorithm-specific ic design<>tcad<>rajeev jain<>
26939<>5776_2<>nulo<>the art of computer systems performance analysis<>cmg<>raj jain<>
7817<>5877_14<>nulo<>advances in interactive digital multimedia systems<>computer<>edward a. fox<>
16680<>5885_3<>krithi ramamritham<>the spring kernel: a new paradigm for real-time systems<>software<>john a. stankovic<>
4771<>5894_2<>gina goff:ken kennedy<>practical dependence testing<>pldi<>chau-wen tseng<>
4774<>5894_5<>ken kennedy:kathryn s. mckinley<>interactive parallel programming using the parascope editor<>tpds<>chau-wen tseng<>
4779<>5894_10<>seema hiranandani:ken kennedy<>compiler optimizations for fortran d on mimd distributed-memory machines<>sc<>chau-wen tseng<>
4802<>5894_33<>ken kennedy:kathryn s. mckinley<>analysis and transformation in the parascope editor<>ics<>chau-wen tseng<>
31666<>5902_1<>nulo<>the chromatic uniqueness of complete bipartite graphs<>dm<>shaoji xu<>
31667<>5902_2<>nulo<>relations between parameters of a graph<>dm<>shaoji xu<>
4510<>5968_2<>alex pothen<>distributed multifrontal factorization using clique trees<>ppsc<>chunguang sun<>
21214<>5976_1<>david cordes<>the literate-programming paradigm<>computer<>marcus brown<>
21225<>5981_0<>thomas a. defanti<>visualization in scientific computing<>ac<>maxine d. brown<>
19685<>5985_23<>steven p. roth:norman m. sadeh:mark s. fox<>resource allocation in distributed factory scheduling<>expert<>katia p. sycara<>
19710<>5985_48<>dundee navinchandra<>index transformation techniques for facilitating creative use of multiple cases<>ijcai<>katia p. sycara<>
25399<>5991_9<>nulo<>integrated interfaces for decision-support with simulation<>wsc<>philip r. cohen<>
25410<>5991_20<>hector j. levesque<>confirmations and joint action<>ijcai<>philip r. cohen<>
22250<>6013_65<>tok wang ling<>a prolog implementation of an entity-relationship based database management system<>er<>mong-li lee<>
24919<>6022_111<>erez petrank<>quantifying knowledge complexity<>focs<>oded goldreich<>
28289<>6045_0<>biswanath mukherjee<>alternative strategies for improving the fairness in and an analytical model of dqdb networks<>infocom<>subrata banerjee<>
28291<>6045_2<>biswanath mukherjee<>"an efficient channel-feedback-based adaptive protocol for scheduling variable-length messages on slotted, high-speed fiber optic-lans/mans."<>wsc<>subrata banerjee<>
36280<>6242_1<>nulo<>a matching game<>dm<>xiaoyun lu<>
36286<>6242_7<>nulo<>on claws belonging to every tournament<>combinatorica<>xiaoyun lu<>
7872<>6286_5<>b. m. igelnik:yakov a. kogan<>controlled stochastic model of a communication system with multiple sources<>tit<>edward g. coffman jr.<>
10012<>6304_1<>nobuhiko kojiro:ken'ichi miura:yahiko kambayashi<>performance evaluation of automatic name placement functions for geographical database systems<>dasfaa<>hiroshi imai<>
10035<>6304_24<>susumu hasegawa:koji hakata<>an analysis of randomized shear sort on the mesh computer<>isa<>hiroshi imai<>
10039<>6304_28<>alok aggarwal:naoki katoh:subhash suri<>finding k points with minimum diameter and related problems<>jal<>hiroshi imai<>
33854<>6339_1<>young man kim:ming t. liu<>a modular high-speed switching network for integration of heterogeneous computing resources<>icpp<>wen-shyen e. chen<>
33859<>6339_6<>young man kim:kyungsook y. lee:ming t. liu<>a distributed congestion-prevention scheme for atm switching fabrics. based on buffered delta networks<>infocom<>wen-shyen e. chen<>
586<>6344_4<>terry e. weymouth:ramesh jain<>an extended object-oriented data model for large image bases<>ssd<>amarnath gupta<>
623<>6344_41<>terry e. weymouth:ramesh jain<>semantic queries in image databases<>vdb<>amarnath gupta<>
719<>6348_17<>russell impagliazzo<>computing planar intertwines<>focs<>arvind gupta<>
669<>6352_3<>alfred j. boals:naveed a. sherwani<>on optimal embeddings into incomplete hypercubes<>ipps<>ajay k. gupta<>
671<>6352_5<>susanne e. hambrusch<>embedding complete binary trees into butterfly networks<>tc<>ajay k. gupta<>
1589<>6370_7<>herve j. touati<>reducing and manipulating complex trace data<>spe<>alan jay smith<>
3815<>6437_9<>chin-teng lin<>neural-network-based fuzzy logic control and decision system<>tc<>c. s. george lee<>
1470<>6481_8<>hermann a. maurer:derick wood<>bounded delay l codes<>tcs<>arto salomaa<>
36099<>6514_3<>dagobert soergel:gary marchionini<>a self-organizing semantic map for information retrieval<>sigir<>xia lin<>
36102<>6514_6<>peter liebscher:gary marchionini<>graphical representations of electronic search patterns<>jasis<>xia lin<>
10052<>6540_0<>laxmi n. bhuyan<>performance analysis of layered task graphs<>icpp<>hong jiang<>
28407<>6555_26<>maurizio tucci:gennaro costagliola<>a remark on np-completeness of picture matching<>ipl<>shi-kuo chang<>
28423<>6555_42<>taieb znati:yi deng:brian field<>multi-level specification and protocol design for distributed multimedia communication<>group<>shi-kuo chang<>
28430<>6555_49<>gennaro costagliola:masaru tomita<>a generalized parser for 2-d languages<>vl<>shi-kuo chang<>
28460<>6555_79<>yi deng<>a hypernet model for large hypertext systems<>dasfaa<>shi-kuo chang<>
12058<>6557_1<>william h. winsborough<>copy avoidance through compile-time analysis and local reuse<>slp<>ian t. foster<>
12075<>6557_18<>william gropp:rick l. stevens<>parallel scalability of the spectral transform method<>ppsc<>ian t. foster<>
12082<>6557_25<>nulo<>a declarative state transition system<>jlp<>ian t. foster<>
12085<>6557_28<>nulo<>efficient computation control in concurrent logic languages<>ngc<>ian t. foster<>
12088<>6557_31<>ross a. overbeek<>aligning multiple rna sequences<>birthday<>ian t. foster<>
12097<>6557_40<>nulo<>automatic generation of self-scheduling programs<>tpds<>ian t. foster<>
21822<>6571_0<>michio nakanishi:yoshiki katsuyama:akihiro hashimoto<>on designing relational database schemes for efficient query processing<>icci<>minoru ito<>
21824<>6571_2<>toru fujiwara:tadao kasami:mitsuteru kataoka:jun okui<>performance analysis of disk allocation method using error-correcting codes<>tit<>minoru ito<>
20702<>6573_0<>nulo<>two classes of perfect graphs<>jct<>liping sun<>
20688<>6576_10<>nulo<>on a problem of j. csima<>dm<>liang sun<>
40830<>6579_15<>nulo<>compiler algorithms for event variable synchronization<>ics<>zhiyuan li<>
40832<>6579_17<>rudolf eigenmann:jay hoeflinger:greg jaxon:david a. padua<>restructuring fortran programs for cedar<>icpp<>zhiyuan li<>
40834<>6579_19<>rudolf eigenmann:jay hoeflinger:david a. padua<>experience in the automatic parallelization of four perfect-benchmark programs<>lcpc<>zhiyuan li<>
1291<>6584_5<>zohar manna<>on the faithfulness of formal models<>mfcs<>amir pnueli<>
1312<>6584_26<>oded maler:zohar manna<>from timed to hybrid systems<>rex<>amir pnueli<>
1313<>6584_27<>doron peled:shmuel katz<>specifying and proving serializability in temporal logic<>lics<>amir pnueli<>
1316<>6584_30<>m. shalev<>what is in a step: on the semantics of statecharts<>tacs<>amir pnueli<>
1338<>6584_52<>oded maler<>on the learnability of infinitary regular sets<>colt<>amir pnueli<>
1375<>6584_89<>alon kleinman:yael moscowitz:ehud y. shapiro<>communication with directed logic variables<>popl<>amir pnueli<>
1386<>6584_100<>zohar manna<>completing the temporal picture<>tcs<>amir pnueli<>
1397<>6584_111<>thomas a. henzinger:zohar manna<>temporal proof methodologies for real-time systems<>popl<>amir pnueli<>
19762<>6645_2<>susumu kobayashi:tomomi sakanoue<>uncertainty management in object-oriented database systems<>dexa<>katsumi tanaka<>
19766<>6645_6<>n. nishikawa:s. hirayama:k. nanba<>query pairs as hypertext links<>icde<>katsumi tanaka<>
41487<>6671_2<>nulo<>linear inequalities for covering codes: part i: pair covering inequalities<>tit<>zhen zhang<>
1883<>6684_20<>herbert edelsbrunner:leonidas j. guibas:richard pollack:raimund seidel:micha sharir:jack snoeyink<>counting and cutting cycles of lines and rods in space<>comgeo<>bernard chazelle<>
1889<>6684_26<>burton rosenberg<>the complexity of computing partial sums off-line<>ijcga<>bernard chazelle<>
1890<>6684_27<>nulo<>triangulating a simple polygon in linear time<>dcg<>bernard chazelle<>
1932<>6684_69<>herbert edelsbrunner:michelangelo grigni:leonidas j. guibas:john hershberger:micha sharir:jack snoeyink<>ray shooting in polygons using geodesic triangulations<>icalp<>bernard chazelle<>
1955<>6684_92<>nulo<>computational geometry for the gourmet: old fare and new dishes<>icalp<>bernard chazelle<>
1969<>6684_106<>boris aronov:herbert edelsbrunner<>points and triangles in the plane and halving planes in space<>dcg<>bernard chazelle<>
1976<>6684_113<>herbert edelsbrunner:leonidas j. guibas:micha sharir:jack snoeyink<>computing a face in an arrangement of line segments<>soda<>bernard chazelle<>
5684<>6707_25<>d. frank hsu:frank k. hwang:x. m. zhang<>the hamiltonian property of generalized de bruijn digraphs<>jct<>ding-zhu du<>
26389<>6741_31<>ulf schreier:hamid pirahesh:c. mohan<>alert: an architecture for transforming a passive dbms into an active dbms<>vldb<>rakesh agrawal<>
3347<>6743_15<>clifford b. miller:d. chen:guo-zheng sun:h. h. chen:y. c. lee<>extracting and learning an unknown grammar with recurrent neural networks<>nips<>c. lee giles<>
770<>6782_0<>farshid farrokhnia<>unsupervised texture segmentation using gabor filters<>pr<>anil k. jain<>
753<>6789_5<>alex waibel:arthur e. mcnair:joe tebelskis:louise osterholtz:hiroaki saito:otto schmidbauer:tilo sloboda:monika woszczyna<>janus: speech-to-speech translation using connectionist and non-connectionist techniques<>nips<>ajay n. jain<>
754<>6789_6<>nulo<>generalization performance in parsec - a structured connectionist parsing architecture<>nips<>ajay n. jain<>
5630<>6804_10<>jeffrey f. naughton:donovan a. schneider<>parallel sorting on a shared-nothing architecture using probabilistic splitting<>pdis<>david j. dewitt<>
5644<>6804_24<>hui-i hsiao<>a performance study of three high availability data replication strategies<>pdis<>david j. dewitt<>
5179<>6856_0<>kencheng zeng:dah-yea wei:t. r. n. rao<>pseudorandom bit generators in stream-cipher cryptography<>computer<>chung-huang yang<>
7351<>6861_2<>toby j. teorey<>usage refinement for er-to-relation design transformations<>isci<>dongqing yang<>
17025<>6903_22<>mark h. nodine:daniel p. lopresti<>i/o overhead and parallel vlsi architectures for lattice computations<>tc<>jeffrey scott vitter<>
17037<>6903_34<>paul g. howard<>analysis of arithmetic coding for data compression<>dcc<>jeffrey scott vitter<>
17062<>6903_59<>roberto tamassia<>parallel transitive closure and point location in planar structures<>siamcomp<>jeffrey scott vitter<>
17095<>6903_92<>paul g. howard<>new methods for lossless image compression using arithmetic coding<>dcc<>jeffrey scott vitter<>
17103<>6903_100<>jyh-han lin<>complexity results on learning by neural nets<>ml<>jeffrey scott vitter<>
