26558<>17_5<>gaston h. gonnet<>a new approach to text searching<>cacm<>ricardo a. baeza-yates<>
26593<>17_40<>gaston h. gonnet:nivio ziviani<>improved bounds for the expected behaviour of avl trees<>bit<>ricardo a. baeza-yates<>
26623<>17_70<>walter cunto<>unbalanced multiway trees improved by partial expansions<>acta<>ricardo a. baeza-yates<>
26642<>17_89<>mireille regnier<>average running time of the boyer-moore-horspool algorithm<>tcs<>ricardo a. baeza-yates<>
23351<>18_40<>jiri matousek:emo welzl<>a subexponential bound for linear programming<>compgeom<>micha sharir<>
25070<>25_8<>jiri matousek<>relative neighborhood graphs in three dimensions<>soda<>pankaj k. agarwal<>
25131<>25_69<>micha sharir:sivan toledo<>applications of parametric searching in geometric optimization<>soda<>pankaj k. agarwal<>
25140<>25_78<>jiri matousek<>ray shooting and parametric search<>stoc<>pankaj k. agarwal<>
25157<>25_95<>boris aronov<>counting facets and incidences<>dcg<>pankaj k. agarwal<>
25163<>25_101<>jiri matousek<>relative neighborhood graphs in three dimensions<>comgeo<>pankaj k. agarwal<>
25174<>25_112<>nulo<>ray shooting and other applications of spanning trees with low stabbing number<>siamcomp<>pankaj k. agarwal<>
33418<>32_9<>william m. thomas:alex delis<>an evaluation of ada source code reuse<>adaEurope<>victor r. basili<>
33425<>32_16<>lionel c. briand:william m. thomas<>a pattern recognition approach for software engineering data analysis<>tse<>victor r. basili<>
33440<>32_31<>nulo<>the experimental paradigm in software engineering<>dagstuhl<>victor r. basili<>
33442<>32_33<>markku oivo<>representing software engineering models: the tame goal oriented approach<>tse<>victor r. basili<>
33481<>32_72<>gianluigi caldiera:giovanni cantone<>a reference architecture for the component factory<>tosem<>victor r. basili<>
6016<>40_0<>douglas b. terry:david nichols:brian m. oki<>continuous queries over append-only databases<>sigmod<>david goldberg<>
5992<>42_19<>kalyanmoy deb<>analyzing deception in trap functions<>foga<>david e. goldberg<>
26794<>51_0<>giuseppe di battista:roberto tamassia:ioannis g. tollis:paola bertolazzi<>a framework for dynamic graph drawing<>compgeom<>robert f. cohen<>
26751<>53_6<>yoram ofek:adrian segall<>a new label-based source routing for multi-ring networks<>phsn<>reuven cohen<>
26753<>53_8<>adrian segall<>a new scheme for dynamic management of isochronous channels in integrated rings<>cn<>reuven cohen<>
18771<>57_17<>yoshihiko ohta<>a forward-chaining hypothetical reasoner based on upside-down meta-interpretation<>fgcs<>katsumi inoue<>
18776<>57_22<>nulo<>linear resolution for consequence finding<>ai<>katsumi inoue<>
18793<>57_39<>miyuki koshimura:ryuzo hasegawa<>embedding negation as failure into a model generation theorem prover<>cade<>katsumi inoue<>
6616<>120_2<>pavol hell<>achromatic numbers and graph operations<>dm<>donald j. miller<>
6578<>127_19<>nulo<>unification under a mixed prefix<>jsc<>dale miller<>
32807<>135_9<>nulo<>attribute based data model and polyinstantiation<>ifip<>tsau young lin<>
6804<>136_0<>lawrence moore<>project calc: calculus as a laboratory course<>iccal<>david smith<>
5741<>153_12<>nulo<>new algorithms for minimum area -gons<>soda<>david eppstein<>
5760<>153_31<>giuseppe f. italiano:roberto tamassia:robert endre tarjan:jeffery westbrook:moti yung<>maintenance of a minimum spanning forest in a dynamic plane graph<>jal<>david eppstein<>
5786<>153_57<>mark h. overmars:gunter rote:gerhard j. woeginger<>finding minimum area k-gons<>dcg<>david eppstein<>
5787<>153_58<>marshall w. bern:david p. dobkin<>triangulating polygons without large angles<>compgeom<>david eppstein<>
5807<>153_78<>zvi galil:raffaele giancarlo:giuseppe f. italiano<>sparse dynamic programming ii: convex and concave cost functions<>jacm<>david eppstein<>
5830<>153_101<>nulo<>finding the  smallest spanning trees<>bit<>david eppstein<>
5868<>153_139<>nulo<>parallel recognition of series-parallel graphs<>iandc<>david eppstein<>
5882<>153_153<>zvi galil:raffaele giancarlo:giuseppe f. italiano<>sparse dynamic programming i: linear cost functions<>jacm<>david eppstein<>
5894<>153_165<>lane a. hemachandra:james tisdall:bulent yener<>simultaneous strong separations of probabilistic and unambiguous complexity classes<>mst<>david eppstein<>
40537<>174_0<>bill jackson:hao li<>dominating cycles in regular 3-connected graphs<>dm<>yongjin zhu<>
40540<>174_3<>cun-quan zhang<>factorizations of regular graphs<>jct<>yongjin zhu<>
40541<>174_4<>hao li<>hamilton cycles in regular 3-connected graphs<>dm<>yongjin zhu<>
27162<>202_17<>a. sutherland:bob henery:rafael molina:c. c. taylor<>statistical methods in learning<>ipmu<>ross d. king<>
17168<>234_7<>jay belanger<>on average p vs. average np<>coco<>jie wang<>
17169<>234_8<>nulo<>"polynomial time productivity, approximations, and levelability."<>siamcomp<>jie wang<>
17172<>234_11<>jay belanger<>on average p vs. average np<>dagstuhl<>jie wang<>
30917<>270_7<>nulo<>fractional cascading simplified<>swat<>sandeep sen<>
30920<>270_10<>sanguthevar rajasekaran<>on parallel integer sorting<>acta<>sandeep sen<>
30930<>270_20<>john h. reif<>optimal randomized parallel algorithms for computational geometry<>algorithmica<>sandeep sen<>
29178<>280_19<>ravi s. sandhu<>eliminating polyinstantiation securely<>compsec<>sushil jajodia<>
29217<>280_58<>ouri wolfson<>distributed algorithms for dynamic replication of data<>pods<>sushil jajodia<>
29311<>280_152<>ouri wolfson<>an algorithm for dynamic data distribution<>wmrd<>sushil jajodia<>
29320<>280_161<>vinti doshi<>referential integrity in multilevel secure database management systems<>sec<>sushil jajodia<>
23591<>333_31<>ronald fagin:joseph y. halpern<>what is an inference rule?<>jsyml<>moshe y. vardi<>
23593<>333_33<>surajit chaudhuri<>on the equivalence of recursive and nonrecursive datalog programs<>pods<>moshe y. vardi<>
23597<>333_37<>serge abiteboul:victor vianu<>"fixpoint logics, relational machines, and computational complexity."<>coco<>moshe y. vardi<>
23634<>333_74<>phokion g. kolaitis<>infinitary logics and 0-1 laws<>iandc<>moshe y. vardi<>
23732<>333_172<>costas courcoubetis:pierre wolper:mihalis yannakakis<>memory-efficient algorithms for the verification of temporal properties<>fmsd<>moshe y. vardi<>
31414<>334_10<>john hershberger:monika rauch<>fully dynamic 2-edge-connectivity in planar graphs<>swat<>subhash suri<>
33310<>355_42<>apostolos gerasoulis<>static scheduling of parallel programs for message passing architectures<>conpar<>tao yang<>
10128<>368_7<>nulo<>semantics for probabilistic inference<>uai<>henry e. kyburg jr.<>
10137<>368_16<>michael pittarelli<>some problems for convex bayesians<>uai<>henry e. kyburg jr.<>
33322<>371_0<>shashi shekhar<>mobile files and efficient processing of path queries on scientific data<>icde<>toneluh andrew yang<>
14636<>403_0<>zheng geng:leonard s. haynes:robert l. carroll<>on the dynamic model and kinematic analysis of a class of stewart platforms<>ras<>james d. lee<>
22754<>424_7<>mark de berg:otfried schwarzkopf<>computing and verifying depth orders<>compgeom<>mark h. overmars<>
22759<>424_12<>dan halperin:micha sharir<>efficient motion planning for an l-shaped object<>siamcomp<>mark h. overmars<>
22760<>424_13<>matthew j. katz:micha sharir<>efficient hidden surface removal for objects with small union size<>comgeo<>mark h. overmars<>
22765<>424_18<>micha sharir<>a simple output-sensitive algorithm for hidden surface removal<>tog<>mark h. overmars<>
22773<>424_26<>marc j. van kreveld:pankaj k. agarwal<>intersection queries in sets of disks<>bit<>mark h. overmars<>
22853<>424_106<>david eppstein:gunter rote:gerhard j. woeginger<>finding minimum area k-gons<>dcg<>mark h. overmars<>
22854<>424_107<>nulo<>point location in fat subdivisions<>ipl<>mark h. overmars<>
22868<>424_121<>mark de berg:svante carlsson<>a general approach to dominance in the plane<>jal<>mark h. overmars<>
1096<>481_4<>stuart a. friedberg<>a state machine approach to reliable distributed systems<>srds<>alvin s. lim<>
19432<>485_7<>yehoshua sagiv<>monotonic aggregation in deductive databases<>pods<>kenneth a. ross<>
19462<>485_37<>nulo<>relations with relation names as arguments: algebra and calculus<>pods<>kenneth a. ross<>
19474<>485_49<>inderpal singh mumick<>an architecture for declarative object-oriented databases<>deductive<>kenneth a. ross<>
39263<>512_0<>jan treur<>constructive default logic and the control of defeasible reasoning<>ecai<>yao-hua tan<>
15314<>527_2<>nulo<>computer understanding of conventional metaphoric language<>cogsci<>james h. martin<>
15325<>527_13<>keith vander linden:susanna cumming<>using system networks to build rhetorical structures<>nlg<>james h. martin<>
33920<>529_15<>howard r. turtle<>a comparison of text retrieval models<>cj<>w. bruce croft<>
33935<>529_30<>james p. callan:stephen m. harding<>the inquery retrieval system<>dexa<>w. bruce croft<>
33937<>529_32<>nulo<>the university of massachusetts tipster project<>sigir<>w. bruce croft<>
33953<>529_48<>robert krovetz<>lexical ambiguity and information retrieval<>tois<>w. bruce croft<>
38<>563_1<>nulo<>optimal discretization for stereo reconstruction<>prl<>anup basu<>
21836<>565_0<>nulo<>strategies for integrating case environments<>software<>matthias jarke<>
21837<>565_1<>john mylopoulos:joachim w. schmidt:yannis vassiliou<>daida: an environment for evolving information systems<>tois<>matthias jarke<>
27871<>582_7<>bhubaneswar mishra<>a linear-time algorithm for finding an ambitus<>algorithmica<>robert endre tarjan<>
6252<>591_31<>chun-wu roger leng<>optimal weight assignment for signature generation<>tods<>dik lun lee<>
6341<>592_31<>nulo<>rectilinear paths among rectilinear obstacles<>isaac<>d. t. lee<>
442<>622_24<>tomasz luczak<>on the independence and chromatic numbers of random regular graphs<>jct<>alan m. frieze<>
445<>622_27<>neil j. calkin:brendan d. mckay<>on subgraph sizes in random graphs<>cpc<>alan m. frieze<>
487<>622_69<>stephen suen<>counting the number of hamilton cycles in random digraphs<>rsa<>alan m. frieze<>
492<>622_74<>andrei z. broder:eli shamir:eli upfal<>near-perfect token distribution<>icalp<>alan m. frieze<>
29723<>679_1<>garth isaak:terry a. mckee:fred r. mcmorris:fred s. roberts<>2-competition graphs<>siamdm<>suh-ryung kim<>
25746<>702_10<>asit dan<>impact of workload partitionability on the performance of coupling architectures for transaction processing<>spdp<>philip s. yu<>
25750<>702_14<>calton pu:danilo florissi:patricia soares:kun-lung wu<>performance comparison of active-sender and active-receiver policies for distributed caching<>hpdc<>philip s. yu<>
25772<>702_36<>ming-syan chen:kun-lung wu<>scheduling and processor allocation for parallel execution of multi-join queries<>icde<>philip s. yu<>
25793<>702_57<>bruno ciciani:daniel m. dias<>analysis of concurrency-coherency control protocols for distributed transaction processing systems with regional locality<>tse<>philip s. yu<>
25844<>702_108<>asit dan:jen-yao chung<>characterization of database access skew in a transaction processing environment<>sigmetrics<>philip s. yu<>
25846<>702_110<>ming-syan chen:kun-lung wu<>efficient decentralized consensus protocols in a distributed computing system<>icdcs<>philip s. yu<>
25863<>702_127<>ming-syan chen:ming-ling lo:honesty c. young<>using segmented right-deep trees for the execution of pipelined hash joins<>vldb<>philip s. yu<>
25865<>702_129<>asit dan<>performance analysis of coherency control policies through lock retention<>sigmod<>philip s. yu<>
25869<>702_133<>kun-lung wu:calton pu<>divergence control for epsilon-serializability<>icde<>philip s. yu<>
25879<>702_143<>daniel m. dias<>analysis of hybrid concurrency control schemes for a high data contention environment<>tse<>philip s. yu<>
25882<>702_146<>ming-syan chen<>interleaving a join sequence with semijoins in distributed query processing<>tpds<>philip s. yu<>
18181<>728_5<>dharmavani bhagavathi:peter j. looges:stephan olariu:james l. schwing<>a fast selection algorithm for meshes with multiple broadcasting<>icpp<>jingyuan zhang<>
18182<>728_6<>stephan olariu:james l. schwing<>optimal parallel encoding and decoding algorithms for trees<>ijfcs<>jingyuan zhang<>
18183<>728_7<>dharmavani bhagavathi:stephan olariu:james l. schwing<>convex polygon problems on meshes with multiple broadcasting<>ppl<>jingyuan zhang<>
18188<>728_12<>stephan olariu:james l. schwing<>optimal parallel algorithms for problems modeled by a family of intervals<>tpds<>jingyuan zhang<>
18193<>728_17<>stephan olariu:james l. schwing<>a constant-time channel-assignment algorithm on reconfigurable meshes<>bit<>jingyuan zhang<>
12320<>759_27<>graham russell:afzal ballim:susan warwick-armstrong<>a practical approach to multiple default inheritance for unification-based lexicons<>coling<>john carroll<>
22548<>800_2<>nulo<>distributed computing<>acm<>ming t. liu<>
31642<>804_1<>udi manber<>path-matching problems<>algorithmica<>sun wu<>
21235<>832_4<>claus dendorfer<>modelling operating system structures by timed stream processing functions<>jfp<>manfred broy<>
21260<>832_29<>nulo<>operational and denotational semantics with explicit concurrency<>fuin<>manfred broy<>
14629<>913_0<>myoung-ho kim:yoon-joon lee<>a knowledge-based approach to rank documents for boolean queries<>future<>joon ho lee<>
12668<>919_19<>nulo<>task dependence net as a representation for concurrent ada programs<>adaEurope<>jingde cheng<>
3634<>963_9<>michael d. harrison<>using temporal logic to support the specification and prototyping of interactive control systems<>ijmms<>c. w. johnson<>
30750<>973_0<>p. sadayappan:frank k. hwang:peter w. shor<>the rectilinear steiner arborescence problem<>algorithmica<>sailesh k. rao<>
31961<>987_1<>rogerio de lemos:amer saeed<>a train set as a case study for the requirements analysis of safety-critical systems<>cj<>tom anderson<>
31970<>987_10<>rogerio de lemos:amer saeed<>analysis of timeliness requirements in safety-critical systems<>ftrtft<>tom anderson<>
31998<>988_26<>susan s. owicki:james b. saxe:charles p. thacker<>high speed switch scheduling for local area networks<>asplos<>thomas e. anderson<>
23556<>1022_14<>nulo<>the integration of rule systems and database systems<>tkde<>michael stonebraker<>
737<>1038_1<>nulo<>formal hardware verification methods: a survey<>fmsd<>aarti gupta<>
33079<>1087_3<>herbert edelsbrunner<>an upper bound for conforming delaunay triangulations<>compgeom<>tiow seng tan<>
38476<>1099_13<>tsing-fa lee:allen c.-h. wu:daniel gajski<>an effective methodology for functional pipelining<>iccad<>youn-long lin<>
38420<>1100_9<>nulo<>parallelism analyzers for parallel discrete event simulation<>tomacs<>yi-bing lin<>
3331<>1130_0<>ibrahim kamel<>parallel r-trees<>sigmod<>christos faloutsos<>
19865<>1276_24<>colin j. skelton:carsten hammer:m. lopez:mike reeve:paul townsend<>eds: a parallel computer system for advanced information processing<>parle<>kam-fai wong<>
9903<>1287_4<>ernst p. mucke<>three-dimensional alpha shapes<>vvs<>herbert edelsbrunner<>
12701<>1295_2<>jong h. nang:d. w. shin:seungryul r. maeng<>a parallel execution of functional logic language with lazy evaluation<>fgcs<>jung wan cho<>
12705<>1295_6<>byeong man kim<>a new subsumption method in the connection graph proof procedure<>tcs<>jung wan cho<>
12706<>1295_7<>byeong man kim:sang ho lee:seung ryoul maeng<>a new algorithm for subsumption test<>fgcs<>jung wan cho<>
32782<>1364_6<>nulo<>blind identification and deconvolution of linear systems driven by binary random sequences<>tit<>ta-hsin li<>
4761<>1414_3<>yung-nien sun<>a new model-based approach for industrial visual inspection<>pr<>ching-tsorng tsai<>
23224<>1433_19<>yuetsu kodama:shuichi sakai:yoshinori yamaguchi:yasuhito koumura<>thread-based programming for the em-4 hybrid dataflow machine<>isca<>mitsuhisa sato<>
16143<>1441_17<>stephen r. tate<>on threshold circuits and polynomial computation<>siamcomp<>john h. reif<>
16155<>1441_29<>peter mills:lars s. nyland:jan prins<>prototyping n-body simulation in proteus<>ipps<>john h. reif<>
16173<>1441_47<>william l. hightower:jan prins<>implementations of randomized sorting on large parallel machines<>spaa<>john h. reif<>
16182<>1441_56<>tassos markas<>quad tree structures for image compression applications<>ipm<>john h. reif<>
16183<>1441_57<>sandeep sen<>optimal randomized parallel algorithms for computational geometry<>algorithmica<>john h. reif<>
16221<>1441_95<>yijie han:victor y. pan<>efficient parallel algorithms for computing all pair shortest paths in directed graphs<>spaa<>john h. reif<>
16230<>1441_104<>akitoshi yoshida<>optical techniques for image compression<>dcc<>john h. reif<>
14487<>1462_1<>eugene w. myers<>approximate regular expression pattern matching with concave gap penalties<>cpm<>james r. knight<>
13194<>1465_73<>robert a. van de geijn<>reduction to condensed form for the eigenvalue problem on distributed memory architectures<>pc<>jack dongarra<>
40589<>1473_11<>wolfgang maass<>on-line learning of rectangles<>colt<>zhixiang chen<>
30247<>1486_4<>sudhakar yerramareddy:david k. tcheng:dennis n. assanis<>creating and using models for engineering design: a machine-learning approach<>expert<>stephen c. y. lu<>
30248<>1486_5<>r. bharat rao<>learning engineering models with the minimum description length principle<>aaai<>stephen c. y. lu<>
30251<>1486_8<>allen e. herman:karl f. arnold<>tops: an intelligent associate for turning operation planning<>aai<>stephen c. y. lu<>
8992<>1492_7<>laura giordano:alberto martelli<>extending horn clause logic with implication goals<>tcs<>gianfranco rossi<>
8993<>1492_8<>iliano cervesato<>logic meta-programming facilities in 'log<>meta<>gianfranco rossi<>
9005<>1492_20<>agostino dovier:eugenio g. omodeo:enrico pontelli<>embedding finite sets in a logic programming language<>elp<>gianfranco rossi<>
12929<>1499_78<>kuang-chien chen:yuzheng ding:andrew b. kahng:peter trajmar<>dag-map: graph-based fpga technology mapping for delay optimization<>dt<>jason cong<>
12938<>1499_87<>yuzheng ding<>an optimal technology mapping algorithm for delay optimization in lookup-table based fpga designs<>iccad<>jason cong<>
12975<>1499_124<>andrew b. kahng:gabriel robins:majid sarrafzadeh:chak-kuen wong<>provably good performance-driven global routing<>tcad<>jason cong<>
7642<>1520_29<>nimrod megiddo<>new algorithms for generalized network flows<>istcs<>edith cohen<>
7672<>1520_59<>nulo<>approximate max flow on small depth networks<>focs<>edith cohen<>
8197<>1532_24<>chao feng:wei-kang huang<>detection and location of multiple faults in baseline interconnection networks<>tc<>fabrizio lombardi<>
18938<>1553_11<>michael i. schwartzbach:erik meineche schmidt<>a new formalism for relational algebra<>ipl<>kim s. larsen<>
18957<>1553_30<>joan boyar<>efficient rebalancing of chromatic search trees<>swat<>kim s. larsen<>
18994<>1554_26<>anders borjesson:arne skou<>generality in design and compositional verification using tav<>forte<>kim guldstrand larsen<>
30517<>1627_16<>h. ramesh<>string matching under a general matching relation<>fsttcs<>s. muthukrishnan<>
14526<>1761_6<>jin ho kwak<>isomorphism classes of cycle permutation graphs<>dm<>jaeun lee<>
36593<>1781_0<>alexander albicki:andrzej krasniewski<>design of robust-path-delay-fault-testable combinational circuits by boolean space expansion<>iccd<>xiaodong xie<>
41075<>1783_11<>richard j. waldinger<>fundamentals of deductive program synthesis<>tse<>zohar manna<>
41076<>1783_12<>amir pnueli<>verifying hybrid systems<>hybrid<>zohar manna<>
41081<>1783_17<>thomas a. henzinger:amir pnueli<>towards refining temporal specifications into hybrid systems<>hybrid<>zohar manna<>
41125<>1783_61<>amir pnueli<>time for concurrency<>inria<>zohar manna<>
41130<>1783_66<>thomas a. henzinger:amir pnueli<>what good are digital clocks?<>icalp<>zohar manna<>
41131<>1783_67<>edward y. chang:amir pnueli<>characterization of temporal property classes<>icalp<>zohar manna<>
8836<>1796_30<>stephen guattery<>a contraction procedure for planar directed graphs<>spaa<>gary l. miller<>
8871<>1796_65<>vijaya ramachandran<>a new graph triconnectivity algorithm and its parallelization<>combinatorica<>gary l. miller<>
1483<>1816_1<>sharad malik:luciano lavagno:robert k. brayton<>symbolic minimization of multilevel logic and the input encoding problem<>tcad<>alberto l. sangiovanni-vincentelli<>
27714<>1817_0<>douglas d. grant<>undergraduate software engineering - an innovative degree at swinburne<>acj<>ross smith<>
37534<>1857_1<>youn-long lin:long-wen chang<>a systolic algorithm for the k-nearest neighbors problem<>tc<>yirng-an chen<>
38978<>1870_40<>baruch awerbuch<>an efficient topology update protocol for dynamic networks<>wdag<>yishay mansour<>
39054<>1870_116<>nader h. bshouty:baruch schieber:prasoon tiwari<>fast exponentiation using the truncation operation<>cc<>yishay mansour<>
32478<>1898_61<>hiroshi nagamochi<>a linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph<>algorithmica<>toshihide ibaraki<>
32486<>1898_69<>hiroshi nagamochi<>computing edge-connectivity in multigraphs and capacitated graphs<>siamdm<>toshihide ibaraki<>
3542<>1907_14<>richard t. snodgrass<>temporal specialization<>icde<>christian s. jensen<>
3578<>1907_50<>leo mark<>queries on change in an extended relational model<>tkde<>christian s. jensen<>
3585<>1907_57<>james clifford:shashi k. gadia:arie segev:richard t. snodgrass<>a glossary of temporal database concepts<>sigmod<>christian s. jensen<>
3715<>1937_0<>james h. cross ii:elliot j. chikofsky<>reverse engineering<>ac<>charles h. may jr.<>
9470<>1943_5<>michael r. fellows:tandy warnow<>two strikes against perfect phylogeny<>icalp<>hans l. bodlaender<>
9472<>1943_7<>ton kloks<>approximating treewidth and pathwidth of some classes of perfect graphs<>isaac<>hans l. bodlaender<>
9507<>1943_42<>klaus jansen:gerhard j. woeginger<>scheduling with incompatible jobs<>trier<>hans l. bodlaender<>
9512<>1943_47<>ton kloks<>testing superperfection of k-trees<>swat<>hans l. bodlaender<>
9517<>1943_52<>ton kloks<>a simple linear time algorithm for triangulating three-colored graphs<>stacs<>hans l. bodlaender<>
9527<>1943_62<>nulo<>kayles on special classes of graphs - an application of sprague-grundy theory<>wg<>hans l. bodlaender<>
9539<>1943_74<>klaus jansen:gerhard j. woeginger<>scheduling with incompatible jobs<>wg<>hans l. bodlaender<>
9543<>1943_78<>dieter kratsch<>the complexity of coloring games on perfect graphs<>tcs<>hans l. bodlaender<>
9593<>1943_128<>goos kant<>triangulating planar graphs while minimizing the maximum degree<>swat<>hans l. bodlaender<>
26323<>1945_12<>nulo<>query optimization in multidatabase systems<>cascon<>qiang zhu<>
34924<>1955_3<>p. spee:m. sato:e. goto<>evaluation of the continuation bit in the cyclic pipeline computer<>pc<>weng-fai wong<>
34931<>1955_10<>chung-kwong yuen<>a model of speculative parallelism<>ppl<>weng-fai wong<>
31354<>1959_15<>yves robert<>new techniques for cycle shrinking<>parle<>siang w. song<>
31356<>1959_17<>afonso ferreira<>achieving optimality for gate matrix layout and pla folding: a graph theoretic approach<>latin<>siang w. song<>
31361<>1959_22<>yves robert<>revisiting cycle shrinking<>pc<>siang w. song<>
11998<>1964_11<>nulo<>on the nonmultiplicativity of oriented cycles<>siamdm<>huishan zhou<>
4673<>1995_19<>maw-shang chang:richard c. t. lee<>solving the euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs<>dam<>chuan yi tang<>
27898<>1997_8<>david l. levine:cheryl d. kelly<>structural testing of concurrent programs<>tse<>richard n. taylor<>
29522<>2019_12<>yung-ho shih<>analytic transient solution of general mos circuit primitives<>tcad<>sung-mo kang<>
29525<>2019_15<>abhijit dharchoudhury<>an integrated approach to realistic worst-case design optimization of mos analog circuits<>dac<>sung-mo kang<>
29527<>2019_17<>carlos h. diaz<>new algorithms for circuit simulation of device breakdown<>tcad<>sung-mo kang<>
29543<>2019_33<>yusuf leblebici<>modeling of nmos transistors for simulation of hot-carrier-induced device and circuit degradation<>tcad<>sung-mo kang<>
29546<>2019_36<>mysore sriram<>detailed layer assignment for mcm routing<>iccad<>sung-mo kang<>
16270<>2037_13<>sesh venugopal:vijay k. naik<>performance of distributed sparse cholesky factorization with pre-scheduling<>sc<>joel h. saltz<>
32175<>2058_0<>liang-gee chen:yi-shing chang<>design of concurrent error-detectable vlsi-based array dividers<>iccd<>thou-ho chen<>
24449<>2083_5<>shalini yajnik<>design and analysis of fault-detecting and fault-locating schedules for computation dags<>ipps<>niraj k. jha<>
24489<>2083_45<>tien-chien lee:wayne wolf<>behavioral synthesis for easy testability in data path scheduling<>iccad<>niraj k. jha<>
24506<>2083_62<>irith pomeranz:sudhakar m. reddy:robert j. miller<>synthesis of multi-level combinational circuits for complete robust path delay fault testability<>ftcs<>niraj k. jha<>
24553<>2083_109<>tien-chien lee:wayne wolf:john m. acken<>behavioral synthesis for easy testability in data path allocation<>iccd<>niraj k. jha<>
24605<>2083_161<>sying-jyan wang:phillip c. gripka<>multiple input bridging fault detection in cmos sequential circuits<>iccd<>niraj k. jha<>
41585<>2140_4<>olivier d. faugeras<>estimation of displacements from two 3-d frames obtained from stereo<>pami<>zhengyou zhang<>
14303<>2168_2<>nulo<>is engineering software amenable to formal specification?<>larch<>john w. baugh jr.<>
4310<>2226_26<>sankar k. pal<>bounds for membership functions: a correlation-based approach<>isci<>c. a. murthy<>
7010<>2268_2<>bernd schurmann<>computer aided analysis and derivation for artificial neural systems<>tse<>dongming wang<>
7015<>2268_7<>nulo<>a strategy for speeding-up the computation of characteristic sets<>mfcs<>dongming wang<>
3453<>2285_0<>keh-jiann chen<>a chinese corpus for linguistic research<>coling<>chu-ren huang<>
23200<>2291_0<>ruey-der lou<>circular permutation graph family with applications<>dam<>majid sarrafzadeh<>
27746<>2308_5<>franco p. preparata<>efficient point location in a convex spatial cell-complex<>siamcomp<>roberto tamassia<>
27770<>2308_29<>robert f. cohen:giuseppe di battista:ioannis g. tollis:paola bertolazzi<>a framework for dynamic graph drawing<>compgeom<>roberto tamassia<>
27790<>2308_49<>giuseppe di battista:ioannis g. tollis<>constrained visibility representations of graphs<>ipl<>roberto tamassia<>
27791<>2308_50<>yi-jen chiang<>dynamization of the trapezoid method for planar point location in monotone subdivisions<>ijcga<>roberto tamassia<>
27806<>2308_65<>giuseppe di battista:ioannis g. tollis<>area requirement and symmetry display of planar upward drawings<>dcg<>roberto tamassia<>
27823<>2308_82<>sairam sairam:jeffrey scott vitter<>a divide and conquer approach to shortest paths in planar layered digraphs<>spdp<>roberto tamassia<>
27846<>2308_105<>david eppstein:giuseppe f. italiano:robert endre tarjan:jeffery westbrook:moti yung<>maintenance of a minimum spanning forest in a dynamic plane graph<>jal<>roberto tamassia<>
21398<>2326_40<>philip s. yu<>interleaving a join sequence with semijoins in distributed query processing<>tpds<>ming-syan chen<>
21421<>2326_63<>ming-ling lo:philip s. yu:honesty c. young<>using segmented right-deep trees for the execution of pipelined hash joins<>vldb<>ming-syan chen<>
21431<>2326_73<>philip s. yu:hans-ulrich heiss:sukho lee<>on workload characterization of relational database environments<>tse<>ming-syan chen<>
21438<>2326_80<>philip s. yu:kun-lung wu<>scheduling and processor allocation for parallel execution of multi-join queries<>icde<>ming-syan chen<>
21449<>2326_91<>kun-lung wu:philip s. yu<>efficient decentralized consensus protocols in a distributed computing system<>icdcs<>ming-syan chen<>
21352<>2327_17<>p. townsend:c. y. wang<>a development environment for constructing graph-based editing tools<>cgf<>m. chen<>
39968<>2334_5<>nulo<>on affine scaling algorithms for nonconvex quadratic programming<>mp<>yinyu ye<>
39979<>2334_16<>masakazu kojima:nimrod megiddo<>an interior point potential reduction algorithm for the linear complementarity problem<>mp<>yinyu ye<>
17553<>2361_16<>ke huang<>balanced hypercubes<>icpp<>jie wu<>
17603<>2361_66<>eduardo b. fernandez<>broadcasting in faulty cube-connected-cycles with minimum recovery time<>conpar<>jie wu<>
17674<>2361_137<>jace w. krull:andres m. molina<>evaluation of a fault tolerant distributed broadcast algorithm in hypercube multicomputers<>acm<>jie wu<>
1696<>2381_18<>alessandro panconesi<>improved distributed algorithms for coloring and network decomposition problems<>stoc<>aravind srinivasan<>
12777<>2394_1<>timothy j. hickey:v. deschamps<>meta-level interpretation of constraint languages a case study: logical primitives<>ngc<>jacques cohen<>
12788<>2394_12<>aline weitzman<>software tools for micro-analysis of programs<>spe<>jacques cohen<>
12814<>2394_38<>timothy j. hickey:hitofumi hotta:thierry petitjean<>computer-assisted microanalysis of parallel programs<>toplas<>jacques cohen<>
31659<>2457_0<>h. c. lai<>extremal points and optimal solutions for general capacity problems<>mp<>s. y. wu<>
10545<>2493_4<>nulo<>an interactive proof tool for process algebras<>stacs<>huimin lin<>
12402<>2522_2<>jonathan l. gross<>limit points for average genus. i. 3-connected and 2-connected simplicial graphs<>jct<>jianer chen<>
12427<>2522_27<>jonathan l. gross<>limit points for average genus ii. 2-connected non-simplicial graphs<>jct<>jianer chen<>
12476<>2522_76<>nulo<>a linear time algorithm for isomorphism of graphs of bounded average genus<>wg<>jianer chen<>
5326<>2544_16<>yongjin zhu<>factorizations of regular graphs<>jct<>cun-quan zhang<>
26731<>2575_4<>jer-shyan wu<>the towers of hanoi problem with parallel moves<>ipl<>rong-jaye chen<>
26732<>2575_5<>yu-song hou<>non-associative parallel prefix computation<>ipl<>rong-jaye chen<>
26969<>2590_2<>nulo<>tail recursion without space leaks<>jfp<>richard jones<>
26972<>2590_5<>peter j. brown<>marking ep coursework using electronic communication<>epodd<>r. e. jones<>
8138<>2649_1<>ming t. liu<>protocol validation for large-scale applications<>software<>fuchun j. lin<>
31001<>2683_33<>menachem kojman<>the universality spectrum of stable unsuperstable theories<>apal<>saharon shelah<>
31025<>2683_57<>tomek bartoszynski<>closed measure zero sets<>apal<>saharon shelah<>
31066<>2683_98<>jorg brendle:haim judah<>combinatorial properties of hechler forcing<>apal<>saharon shelah<>
21271<>2703_2<>hilde ade:luc de raedt<>inverse resolution in an integrated inductive-deductive learning system<>ecai<>maurice bruynooghe<>
21273<>2703_4<>luc de raedt<>interactive concept-learning and constructive induction by analogy<>ml<>maurice bruynooghe<>
21277<>2703_8<>luc de raedt<>belief updating from integrity constraints and queries<>ai<>maurice bruynooghe<>
21279<>2703_10<>luc de raedt:johan feyaerts<>acquiring object-knowledge<>jetai<>maurice bruynooghe<>
8954<>2734_70<>miklos szijarto:sorina vicolov<>further remarks on reduced languages<>fuin<>gheorghe paun<>
31126<>2773_20<>nulo<>scaling reinforcement learning algorithms by learning variable temporal resolution models<>icml<>satinder p. singh<>
31154<>2773_48<>nulo<>transfer of learning by composing solutions of elemental sequential tasks<>ml<>satinder p. singh<>
31173<>2773_67<>nulo<>reinforcement learning with a hierarchy of abstract models<>aaai<>satinder p. singh<>
28089<>2840_3<>claus dendorfer<>an informal introduction to the design method focus<>fbt<>rainer weber<>
4927<>2852_14<>thang tran<>limitation of superscalar microprocessor performance<>micro<>chuan-lin wu<>
4928<>2852_15<>manjai lee<>performance analysis of multistage interconnection network configurations and operations<>tc<>chuan-lin wu<>
6185<>2862_1<>william r. taylor:janet m. thornton<>the rapid generation of mutation data matrices from protein sequences<>bioinformatics<>david t. jones<>
10468<>2888_1<>nulo<>an approximate method for local optima for nonlinear mixed integer programming problems<>cor<>han-lin li<>
36658<>2900_19<>robert l. hemminger<>on 3-connected graphs with contractible edge covers of size k<>dm<>xingxing yu<>
36659<>2900_20<>nulo<>cyclomatic numbers of connected induced subgraphs<>dm<>xingxing yu<>
36660<>2900_21<>m. r. hart<>on a problem of hendry<>dm<>xingxing yu<>
26238<>2902_23<>liping wu yang<>a novel cache design for vector processing<>isca<>qing yang<>
26107<>2903_9<>david e. foulser:ming li<>theory and algorithms for plan merging<>ai<>qiang yang<>
26119<>2903_21<>dana s. nau:james a. hendler<>merging separately generated plans with restricted interactions<>ci<>qiang yang<>
26161<>2903_63<>raghu karinthi:dana s. nau<>handling feature interactions in process-planning<>aai<>qiang yang<>
26175<>2903_77<>nulo<>a theory of conflict resolution in planning<>ai<>qiang yang<>
26211<>2903_113<>fahiem bacchus<>the expected value of hierarchical problem-solving<>aaai<>qiang yang<>
21287<>2954_1<>michael j. franklin<>client-server caching revisited<>oodbs<>michael j. carey<>
19537<>3044_18<>ahmed gheith:hongyi zhou<>building families of object-based multiprocessor kernels<>ipps<>karsten schwan<>
19577<>3044_58<>hongyi zhou:ian f. akyildiz<>performance effects of information sharing in a distributed multiprocessor real-time scheduler<>rtss<>karsten schwan<>
19588<>3044_69<>hongyi zhou:ahmed gheith<>multiprocessor real-time threads<>sigops<>karsten schwan<>
19606<>3044_87<>hongyi zhou<>dynamic scheduling of hard real-time tasks and real-time threads<>tse<>karsten schwan<>
13523<>3046_17<>cynthia dwork:orli waarts<>performing work efficiently in the presence of faults<>podc<>joseph y. halpern<>
13564<>3047_38<>ronald fagin:moshe y. vardi<>what is an inference rule?<>jsyml<>joseph y. halpern<>
13580<>3047_54<>ronald fagin:moshe y. vardi<>what can machines know? on the properties of knowledge in distributed systems<>jacm<>joseph y. halpern<>
13584<>3047_58<>bruce m. kapron<>zero-one laws for modal logic<>lics<>joseph y. halpern<>
13634<>3047_108<>fahiem bacchus:adam j. grove:daphne koller<>from statistics to beliefs<>aaai<>joseph y. halpern<>
13683<>3047_157<>lenore d. zuck<>a little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols<>jacm<>joseph y. halpern<>
13684<>3047_158<>adam j. grove:daphne koller<>asymptotic conditional probabilities for first-order logic<>stoc<>joseph y. halpern<>
13709<>3047_183<>yoram moses<>a guide to completeness and complexity for modal logics of knowledge and belief<>ai<>joseph y. halpern<>
13720<>3047_194<>daphne koller<>a logic for approximate reasoning<>kr<>joseph y. halpern<>
13730<>3047_204<>adam j. grove:daphne koller<>random worlds and maximum entropy<>lics<>joseph y. halpern<>
25699<>3109_2<>denis hanson:leif k. jorgensen<>on cages with given degree sets<>dm<>ping wang<>
34081<>3116_8<>nulo<>a simple test for the consecutive ones property<>isaac<>wen-lian hsu<>
6813<>3166_3<>j. h. rubinstein<>graham's problem on shortest networks for points on a circle<>algorithmica<>d. a. thomas<>
35690<>3284_0<>michael s. waterman<>dynamic programming algorithms for restriction map comparison<>bioinformatics<>x. huang<>
27729<>3335_0<>zelda b. zabinsky<>pure adaptive search in global optimization<>mp<>robert l. smith<>
35706<>3376_0<>yiping qiu<>the maximum size of graphs satisfying a degree condition<>dm<>xiao feng jia<>
16232<>3396_0<>simon h. lavington:m. e. waite:neil dewhurst<>exploiting parallelism in primitive operations on bulk data types<>parle<>jerome robinson<>
1154<>3411_15<>krzysztof diks<>almost safe gossiping in bounded degree networks<>siamdm<>andrzej pelc<>
1208<>3411_69<>douglas m. blough<>complexity of fault diagnosis in comparison models<>tc<>andrzej pelc<>
1248<>3411_109<>nulo<>broadcasting time in sparse networks with faulty transmissions<>ppl<>andrzej pelc<>
1267<>3411_128<>nulo<>optimal fault diagnosis in comparison models<>tc<>andrzej pelc<>
26699<>3504_5<>suresh chari:desh ranjan:pankaj rohatgi<>relativization: a revisionistic retrospective<>eatcs<>richard chang<>
26701<>3504_7<>nulo<>on the structure of bounded queries to arbitrary np sets<>siamcomp<>richard chang<>
12194<>3569_9<>nulo<>a vertex critical graph without critical edges<>dm<>jason i. brown<>
9051<>3575_0<>andrzej ehrenfeucht<>angular 2-structures<>tcs<>grzegorz rozenberg<>
22406<>3590_6<>paul m. b. vitanyi<>optimality of wait-free atomic multiwriter variables<>ipl<>ming li<>
22430<>3590_30<>paul m. b. vitanyi<>inductive reasoning and kolmogorov complexity<>jcss<>ming li<>
22435<>3590_35<>luc longpre:paul m. b. vitanyi<>the power of the queue<>siamcomp<>ming li<>
16508<>3658_2<>kevin jeffay:jin-kun lin:j. menges:f. donelson smith<>architecture of the artifact-based collaboration system matrix<>cscw<>john b. smith<>
34981<>3740_0<>jean dollimore:claudio nascimento<>fine object migration<>oodbs<>wang xu<>
14021<>3770_0<>michael c. fu:rakesh nagi<>bias properties of infinitesimal perturbation analysis for systems with parallel servers<>cor<>jian-qiang hu<>
8388<>3771_3<>david e. muller<>parallel restructuring and evaluation of expressions<>jcss<>franco p. preparata<>
8393<>3771_8<>gianfranco bilardi<>horizons of parallel computation<>inria<>franco p. preparata<>
8315<>3772_54<>roberto tamassia<>efficient point location in a convex spatial cell-complex<>siamcomp<>franco p. preparata<>
8330<>3772_69<>jeffrey scott vitter<>a simplified technique for hidden-line elimination in terrains<>stacs<>franco p. preparata<>
8340<>3772_79<>nancy m. amato<>the parallel 3d convex hull problem revisited<>ijcga<>franco p. preparata<>
8355<>3772_94<>victor y. pan<>supereffective slow-down of parallel computations<>spaa<>franco p. preparata<>
13350<>3809_6<>hubert garavel:laurent mounier:anne rasse:carlos rodriguez:joseph sifakis<>a toolbox for the verification of lotos programs<>icse<>jean-claude fernandez<>
16941<>3812_16<>sergio r. cardenas:marvin v. zelkowitz<>an application of decision theory for the evaluation of software prototypes<>jss<>jianhui tian<>
16945<>3812_20<>marvin v. zelkowitz<>a formal program complexity model and its application<>jss<>jianhui tian<>
1429<>3834_4<>david kinny:magnus ljungberg:liz sonenberg:gil tidhar:eric werner<>planned team activity<>maamaw<>anand s. rao<>
38178<>3893_0<>kazuaki iwata:yoshiro fukuda<>flow control strategy for flexible machining and assembly system<>prolamat<>young hae lee<>
38197<>3903_10<>joon ho lee:myoung-ho kim<>a knowledge-based approach to rank documents for boolean queries<>future<>yoon-joon lee<>
2443<>3975_63<>hongjun lu:cheng hian goh<>on global multidatabase query optimization<>sigmod<>beng chin ooi<>
2475<>3975_95<>chee yong chan:hongjun lu<>extensible buffer management of indexes<>vldb<>beng chin ooi<>
2480<>3975_100<>chee chin low:hongjun lu<>h-trees: a dynamic associative search index for oodb<>sigmod<>beng chin ooi<>
14275<>3995_12<>nulo<>selectors: going beyond user-interface widgets<>chi<>jeff a. johnson<>
33121<>4000_20<>fausto giunchiglia<>tree subsumption: reasoning with outlines<>ecai<>toby walsh<>
33153<>4000_52<>alex nunes:alan bundy<>the use of proof plans to sum series<>cade<>toby walsh<>
33172<>4000_71<>fausto giunchiglia<>a theory of abstraction<>ai<>toby walsh<>
33180<>4000_79<>david a. basin<>difference matching<>cade<>toby walsh<>
33600<>4070_11<>judy mullins<>an integrated data structure with multiple access paths for database systems<>acm<>vijay kumar<>
33617<>4070_28<>albert burger<>performance measurement of main memory database recovery algorithms based on update-in-place and shadow approaches<>tkde<>vijay kumar<>
21748<>4104_87<>nulo<>a polygonal approach to hidden-line and hidden-surface elimination<>cvgip<>michael t. goodrich<>
27016<>4105_5<>nulo<>three-stage generalized connectors<>siamdm<>richard m. karp<>
27021<>4105_10<>alan m. frieze:bruce a. reed<>when is the assignment bound tight for the asymmetric traveling salesman problem?<>ipco<>richard m. karp<>
27051<>4105_40<>nulo<>on-line algorithms versus off-line algorithms: how much is it worth to know the future?<>ifip<>richard m. karp<>
27067<>4105_56<>ran el-yaniv:amos fiat:g. turpin<>competitive analysis of financial games<>focs<>richard m. karp<>
27103<>4105_92<>michael luby:friedhelm meyer auf der heide<>efficient pram simulation on a distributed memory machine<>stoc<>richard m. karp<>
35510<>4110_2<>yingjia ding<>a temporal logic approach for analyzing safety properties of predicate transition nets<>ifip<>xudong he<>
34971<>4130_4<>mao-jiun j. wang:chih-ming liu<>performance evaluation of some noise reduction methods<>cvgip<>wen-yen wu<>
16659<>4233_0<>b. chandrasekaran:todd r. johnson<>task-structure analysis for knowledge modeling<>aifipp<>jack w. smith<>
16660<>4233_1<>b. chandrasekaran:todd r. johnson<>task-structure analysis for knowledge modeling<>cacm<>jack w. smith<>
16663<>4235_0<>howard jay siegel:seth abraham:william l. bain:kenneth e. batcher:thomas l. casavant:doug degroot:jack b. dennis:david c. douglas:tse-yun feng:james r. goodman:alan huang:harry f. jordan:j. robert jamp:yale n. patt:alan jay smith:lawrence snyder:harold s. stone:russ tuck:benjamin w. wah<>report of the purdue workshop on grand challenges in computer architecture for the support of high performance computing<>jpdc<>james e. smith<>
16642<>4236_1<>nulo<>quasigroups and quandles<>dm<>jonathan d. h. smith<>
30330<>4241_20<>srinivas devadas:kurt keutzer:albert wang<>verification of asynchronous interface circuits with bounded wire delays<>iccad<>sharad malik<>
30343<>4241_33<>pranav ashar:sujit dey<>exploiting multi-cycle false paths in the performance optimization of sequential circuits<>iccad<>sharad malik<>
16631<>4279_2<>jane m. fraser:philip j. smith<>a catalog of errors<>ijmms<>jack w. smith<>
22638<>4280_1<>sampath kannan:steven rudich<>implicit representation of graphs<>siamdm<>moni naor<>
22727<>4280_90<>noga alon:jehoshua bruck:joseph naor:ron m. roth<>construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs<>tit<>moni naor<>
22737<>4280_100<>miklos ajtai:noga alon:jehoshua bruck:robert cypher:ching-tien ho:endre szemeredi<>"fault tolerant graphs, perfect hash functions and disjoint paths"<>focs<>moni naor<>
22744<>4280_107<>cynthia dwork<>pricing via processing or combatting junk mail<>crypto<>moni naor<>
20845<>4301_15<>erkki oja:ching y. suen<>modified hebbian learning for curve and surface fitting<>nn<>lei xu<>
277<>4302_77<>senthil krishnamoorthy<>shared-memory multiprocessor simulations to study dynamic characteristics of two-level caches<>ijcs<>alok n. choudhary<>
295<>4302_95<>sanjay ranka<>mesh and pyramid algorithms for iconic indexing<>pr<>alok n. choudhary<>
303<>4302_103<>salim hariri:behcet sarikaya<>architectural support for designing fault-tolerant open distributed systems<>computer<>alok n. choudhary<>
324<>4302_124<>rajeev thakur<>evaluation of connected component labeling algorithms on shared and distributed memory multiprocessors<>ipps<>alok n. choudhary<>
343<>4302_143<>ravi ponnusamy:joel h. saltz:raja das:charles koelbel<>embedding data mappers with distributed memory machine compilers<>sigplanW<>alok n. choudhary<>
25663<>4317_3<>nulo<>parallel univariate -adic lifting on shared-memory multiprocessors<>issac<>paul s. wang<>
25639<>4324_10<>nulo<>intelligent pattern recognition and applications<>icpia<>patrick shen-pei wang<>
9261<>4387_1<>david eppstein:mark h. overmars:gunter rote<>finding minimum area k-gons<>dcg<>gerhard j. woeginger<>
9237<>4388_0<>herbert fleischner<>detecting cycles through three fixed vertices in a graph<>ipl<>gerhard j. woeginger<>
9254<>4388_17<>nulo<>computing maximum valued regions<>actaC<>gerhard j. woeginger<>
9259<>4388_22<>klaus jansen<>the complexity of detecting crossingfree configurations in the plane<>trier<>gerhard j. woeginger<>
20231<>4457_1<>thou-ho chen:yi-shing chang<>design of concurrent error-detectable vlsi-based array dividers<>iccd<>liang-gee chen<>
21969<>4518_11<>nulo<>a theory of qualified types<>esop<>mark p. jones<>
10399<>4533_2<>bill jackson:yongjin zhu<>dominating cycles in regular 3-connected graphs<>dm<>hao li<>
10411<>4533_14<>yongjin zhu<>hamilton cycles in regular 3-connected graphs<>dm<>hao li<>
11034<>4566_57<>robert e. webber<>linear-time border-tracing algorithms for quadtrees<>algorithmica<>hanan samet<>
11075<>4566_98<>erik g. hoel<>a qualitative comparison study of data structures for large line segment databases<>sigmod<>hanan samet<>
11078<>4566_101<>nulo<>spatial databases<>vldb<>hanan samet<>
12624<>4572_1<>john staples<>soft sorting in logic programming<>alpuk<>jian chen<>
34160<>4616_3<>nulo<>chair's message<>sigmod<>won kim<>
34163<>4616_6<>nulo<>chair's message<>sigmod<>won kim<>
11328<>4654_16<>yasuo hidaka:hanpei koike<>architecture of parallel management kernel for pie64<>parle<>hidehiko tanaka<>
31313<>4661_1<>gul agha:ian a. mason:carolyn l. talcott<>towards a theory of actor computation<>concur<>scott f. smith<>
1507<>4692_8<>robert l. read:donald s. fussell<>a multi-resolution relational data model<>vldb<>abraham silberschatz<>
17516<>4701_0<>robyn r. lutz<>detecting unsafe error recovery schedules<>tse<>johnny s. wong<>
25309<>4710_14<>david lapotin:gopalakrishnan vijayan:sungho kim<>workload-driven floorplanning for mips optimization<>iccd<>pradip bose<>
18861<>4716_0<>james bowen:dennis bahler<>lexical imprecision in fuzzy constraint networks<>aaai<>k. robert lai<>
6903<>4786_5<>frank wagner<>an efficient parallel logarithmic time algorithm for the channel routing problem<>dam<>dorothea wagner<>
6951<>4788_2<>nulo<>on the perfect one - factorization conjecture<>dm<>david g. wagner<>
11231<>4796_2<>alan h. karp:ken miura<>gordon bell prize lectures 1992<>sc<>horst d. simon<>
11232<>4796_3<>christian h. bischof<>the implementation of the u.s. high performance computing and communications program<>supercomputer<>horst d. simon<>
11236<>4796_7<>david h. bailey:leonardo dagum:e. barszcz<>nas parallel benchmark results<>sc<>horst d. simon<>
11263<>4800_6<>jayant kalagnanam<>directions for qualitative reasoning<>ci<>herbert a. simon<>
28350<>4830_0<>maurice a. w. houtsma:arthur m. keller:pierangela samarati<>the case for independent updates<>wmrd<>stefano ceri<>
22009<>4885_4<>fang wan<>not all planar digraphs have small cycle separators<>ipl<>ming-yang kao<>
11166<>4942_15<>nulo<>improved universal k-selection in hypercubes<>pc<>hong shen<>
33036<>4985_14<>nulo<>equivalence-preserving first-order unfold/fold transformation systems<>tcs<>taisuke sato<>
898<>5011_0<>gabriel robins<>a new class of iterative steiner tree heuristics with good performance<>tcad<>andrew b. kahng<>
35071<>5018_1<>richard e. korf<>an average-case analysis of branch-and-bound with applications: summary of results<>aaai<>weixiong zhang<>
13858<>5026_23<>alexander aiken:jennifer widom<>"behavior of database production rules: termination, confluence, and observable determinism."<>sigmod<>joseph m. hellerstein<>
13864<>5026_29<>hamid pirahesh:waqar hasan<>extensible/rule based query rewrite optimization in starburst<>sigmod<>joseph m. hellerstein<>
18656<>5059_1<>paul hudak:martin odersky<>parametric type classes<>lfp<>kung chen<>
10802<>5068_14<>nulo<>why hypermedia systems are important<>iccal<>hermann a. maurer<>
24933<>5073_3<>j. andrew holey<>iterative algorithms for the planar convex hull problem on mesh-connected arrays<>pc<>oscar h. ibarra<>
24966<>5073_36<>tao jiang:hui wang<>a characterization of exponential-time languages by alternating context-free grammars<>tcs<>oscar h. ibarra<>
24974<>5073_44<>nicholas q. tran<>on space-bounded synchronized alternating turing machines<>tcs<>oscar h. ibarra<>
24975<>5073_45<>tao jiang:hui wang<>string editing on a one-way linear array of finite-state machines<>tc<>oscar h. ibarra<>
24990<>5073_60<>nicholas q. tran<>new results concerning synchronized finite automata<>icalp<>oscar h. ibarra<>
25011<>5073_81<>tao jiang:hui wang:qi zheng<>a hierarchy result for 2-dimensional tm's operating in small space<>isci<>oscar h. ibarra<>
25046<>5073_116<>myung hee kim<>quadtree building algorithms on an simd hypercube<>ipps<>oscar h. ibarra<>
24195<>5078_3<>michael tarsi<>colorings and orientations of graphs<>combinatorica<>noga alon<>
24202<>5078_10<>yossi azar<>on-line steiner trees in the euclidean plane<>compgeom<>noga alon<>
24222<>5078_30<>colin mcdiarmid:bruce a. reed<>star arboricity<>combinatorica<>noga alon<>
24238<>5078_46<>nulo<>choice numbers of graphs: a probabilistic approach<>cpc<>noga alon<>
32256<>5081_66<>zohar manna:amir pnueli<>towards refining temporal specifications into hybrid systems<>hybrid<>thomas a. henzinger<>
32278<>5081_88<>zohar manna:amir pnueli<>what good are digital clocks?<>icalp<>thomas a. henzinger<>
32297<>5081_107<>nulo<>sooner is safer than later<>ipl<>thomas a. henzinger<>
32302<>5081_112<>rajeev alur:costas courcoubetis:pei-hsin ho<>hybrid automata: an algorithmic approach to the specification and verification of hybrid systems<>hybrid<>thomas a. henzinger<>
32314<>5081_124<>rajeev alur<>back to the future: towards a theory of timed regular languages<>focs<>thomas a. henzinger<>
32358<>5081_168<>xavier nicollin:joseph sifakis:sergio yovine<>symbolic model checking for real-time systems<>lics<>thomas a. henzinger<>
9431<>5105_7<>nulo<>di-domains as prime information systems<>iandc<>guo-qiang zhang<>
9448<>5105_24<>nulo<>disjunctive systems and l-domains<>icalp<>guo-qiang zhang<>
3261<>5126_1<>j. s. h. yang:yeh-hao chin<>many-sorted first-order logic database language<>cj<>c. g. chung<>
22333<>5148_12<>francesco m. donini:daniele nardi:andrea schaerf:werner nutt<>adding epistemic operators to concept languages<>kr<>maurizio lenzerini<>
22341<>5148_20<>francesco m. donini:daniele nardi:bernhard hollunder:werner nutt:alberto marchetti-spaccamela<>the complexity of existential quantification in concept languages<>ai<>maurizio lenzerini<>
23154<>5149_52<>gianpiero cabodi:paolo camurati:fulvio corno:paolo prinetto<>sequential circuit diagnosis based on formal verification techniques<>itc<>matteo sonza reorda<>
23189<>5149_87<>gianpiero cabodi:paolo camurati:fulvio corno:silvano gai:paolo prinetto<>a new model for improving symbolic product machine traversal<>dac<>matteo sonza reorda<>
21626<>5163_23<>michael j. zwilling:c. k. tan:michael j. carey:david j. dewitt<>crash recovery in client-server exodus<>sigmod<>michael j. franklin<>
21631<>5163_28<>michael j. carey:miron livny<>global memory management in client-server database architectures<>vldb<>michael j. franklin<>
21635<>5163_32<>michael j. carey<>client-server caching revisited<>oodbs<>michael j. franklin<>
6453<>5207_1<>nulo<>a probabilistic network of predicates<>uai<>dekang lin<>
28110<>5255_2<>monica s. lam<>limits of control flow on parallelism<>isca<>robert p. wilson<>
28115<>5262_1<>gary chartrand:hector hevia<>the ubiquitous petersen graph<>dm<>robin j. wilson<>
28759<>5286_5<>francis c. m. lau<>mesh permutation routing with locality<>ipl<>steven cheung<>
40688<>5293_5<>giuseppe f. italiano<>fully dynamic algorithms for 2-edge connectivity<>siamcomp<>zvi galil<>
15739<>5326_69<>subhash suri<>separation and approximation of polyhedral objects<>soda<>joseph s. b. mitchell<>
15602<>5327_17<>kim b. bruce<>"per models of subtyping, recursive types and higher-order polymorphism."<>popl<>john c. mitchell<>
15616<>5327_31<>andre scedrov<>notes on sconing and relators<>csl<>john c. mitchell<>
15652<>5327_67<>patrick lincoln:andre scedrov:natarajan shankar<>decision problems for propositional linear logic<>apal<>john c. mitchell<>
15658<>5327_73<>patrick lincoln<>algorithmic aspects of type inference with subtypes<>popl<>john c. mitchell<>
2547<>5330_1<>rodrigo a. botafogo:ehud rivlin<>structural analysis of hypertexts: identifying hierarchies and useful metrics<>tois<>ben shneiderman<>
26426<>5357_31<>thomas a. henzinger<>back to the future: towards a theory of timed regular languages<>focs<>rajeev alur<>
26465<>5357_70<>costas courcoubetis:thomas a. henzinger:pei-hsin ho<>hybrid automata: an algorithmic approach to the specification and verification of hybrid systems<>hybrid<>rajeev alur<>
26471<>5357_76<>costas courcoubetis:nicolas halbwachs:david l. dill:howard wong-toi<>minimization of timed transition systems<>concur<>rajeev alur<>
26474<>5357_79<>alon itai:robert p. kurshan:mihalis yannakakis<>timing verification by successive approximation<>cav<>rajeev alur<>
24645<>5359_23<>hagit attiya<>using mappings to prove timing properties<>dc<>nancy a. lynch<>
24648<>5359_26<>maurice herlihy:michael merritt:william e. weihl<>on the correctness of orphan management algorithms<>jacm<>nancy a. lynch<>
24657<>5359_35<>frits w. vaandrager<>action transducers and timed automata<>concur<>nancy a. lynch<>
24666<>5359_44<>nir shavit<>timing-based mutual exclusion<>rtss<>nancy a. lynch<>
24690<>5359_68<>george varghese<>a tradeoff between safety and liveness for randomized coordinated attack protocols<>podc<>nancy a. lynch<>
24692<>5359_70<>alan fekete:william e. weihl<>hybrid atomicity for nested transactions<>icdt<>nancy a. lynch<>
24778<>5359_156<>michael j. fischer:nancy d. griffeth:leonidas j. guibas<>optimal placement of identical resources in a tree<>iandc<>nancy a. lynch<>
15170<>5368_9<>bo yi<>an approach to analogical theorem proving<>iwar<>jianguo lu<>
13451<>5369_4<>nulo<>database and transaction processing benchmarks<>sigmod<>jim gray<>
14149<>5376_9<>nulo<>scheduled fourier volume morphing<>siggraph<>john f. hughes<>
14150<>5376_10<>william m. hsu:henry kaufman<>direct manipulation of free-form deformations<>siggraph<>john f. hughes<>
14154<>5376_14<>t. j. true<>volume warping<>visualization<>j. f. hughes<>
14160<>5376_20<>alan h. barr:bena l. currin:steven gabriel<>smooth interpolation of orientations with angular velocity constraints using quaternions<>siggraph<>john f. hughes<>
14185<>5386_4<>john launchbury:andy gill:simon marlow:simon l. peyton jones:philip wadler<>avoiding unnecessary updates<>fp<>john hughes<>
14187<>5386_6<>alex ferguson<>"a loop-detecting interpreter for lazy, higher-order programs."<>fp<>john hughes<>
14190<>5386_9<>john launchbury<>reversing abstract interpretations<>esop<>john hughes<>
14197<>5386_16<>john launchbury<>projections for polymorphic first-order strictness analysis<>mscs<>john hughes<>
15920<>5403_2<>nulo<>images as functions and sets<>ivc<>j. alison noble<>
26549<>5422_0<>steve bankes:carl builder:richard a. bitzinger:hugh desantis:constance greaser:peter jacobson:dana johnson:richard leghorn:jeff marquis:marc dean millot:david ronfeldt:norman shapiro<>seizing the moment: harnessing the information technologies<>tis<>robert anderson<>
37207<>5431_6<>laxmi n. bhuyan<>extending multistage interconnection networks for multitasking<>icpp<>yeimkuan chang<>
15409<>5453_5<>nulo<>performability: a retrospective and some pointers to the future<>pe<>john f. meyer<>
15411<>5453_7<>nulo<>the role of modeling and evaluation in the design process<>ifip<>john f. meyer<>
15523<>5459_1<>marie-claude heydemann:jaroslav opatrny:dominique sotteau<>forwarding indices of -connected graphs<>dam<>j. c. meyer<>
7473<>5470_13<>sandro bottarelli:maria damiani:m. marcadella:m. migliorati:paolo randi<>a knowledge based information system<>ifip<>elisa bertino<>
7503<>5470_43<>daniela musto<>query optimization by using knowledge about data semantics<>dke<>elisa bertino<>
7521<>5470_61<>mauro negri:giuseppe pelagatti:licia sbattella<>object-oriented query languages: the notion and the issues<>tkde<>elisa bertino<>
40916<>5479_3<>nulo<>experiential logic<>iwar<>zuoquan lin<>
39267<>5489_0<>a. nagasaki:m. akaishi:t. noguchi<>a synthetic media architecture for an object-oriented open platform<>ifip<>y. tanaka<>
30814<>5507_0<>u. k. sarkar:p. p. chakrabarti:sujoy ghose<>effective use of memory in iterative deepening search<>ipl<>s. c. de sarkar<>
1520<>5540_0<>carlos henggeler antunes:maria joao alves:joio c. n. climaco<>an integrated molp method base package - a guided tour of tommix<>cor<>ana l. silva<>
28973<>5558_0<>dhiraj k. pradhan<>can concurrent checkers help bist?<>itc<>sandeep k. gupta<>
8615<>5573_1<>yung-chen hung<>a layered communication system generator<>jss<>gen-huey chen<>
8617<>5573_3<>yung-chen hung<>distributed algorithms for the quickest path problem<>pc<>gen-huey chen<>
29042<>5612_0<>mukul k. sinha<>design validation using probe mechanism<>ifip<>suresh c. gupta<>
36997<>5638_18<>shin-ichi nakano:hitoshi suzuki:takao nishizeki<>an efficient algorithm for edge-coloring series-parallel multigraphs<>latin<>xiao zhou<>
8659<>5648_2<>ravi ponnusamy:rajeev thakur:alok n. choudhary<>scheduling regular and irregular communication patterns on the cm-5<>sc<>geoffrey fox<>
8690<>5648_33<>nashat mansour<>parallel physical optimization algorithms for data mapping<>conpar<>geoffrey fox<>
27435<>5672_13<>leonidas j. guibas:prabhakar raghavan<>the robot localization problem in two dimensions<>soda<>rajeev motwani<>
27457<>5672_35<>amotz bar-noy:joseph naor<>the greedy algorithm is optimal for on-line edge coloring<>ipl<>rajeev motwani<>
17250<>5703_8<>yousef alavi:jiuqiang liu:zhongfu zhang<>on total covers of graphs<>dm<>jianfang wang<>
17343<>5726_0<>marc moeneclaey<>hybrid ds/sfh spread-spectrum multiple access with predetection diversity and coding for indoor radio<>jsac<>jiangzhou wang<>
33264<>5740_2<>ryohei nakano<>a genetic algorithm applicable to large-scale job-shop problems<>ppsn<>takeshi yamada<>
10386<>5766_10<>nulo<>on finite automata with limited nondeterminism<>mfcs<>hing leung<>
26901<>5769_54<>nulo<>myths about congestion management in high speed networks<>indc<>raj jain<>
40896<>5831_0<>nulo<>different retinal ganglion cells have different functional goals<>ijns<>zhaoping li<>
40405<>5871_17<>josef pieprzyk:jennifer seberry<>haval - a one-way hashing algorithm with variable length of output<>asiacrypt<>yuliang zheng<>
40424<>5871_36<>thomas hardjono<>a practical digital multisignature scheme based on discrete logarithms<>asiacrypt<>yuliang zheng<>
7807<>5877_4<>m. prabhakar koushik:joseph a. shaw:russell modlin:durgesh rao<>combining evidence from multiple searches<>trec<>edward a. fox<>
7827<>5877_24<>lenwood s. heath:qi fan chen:amjad m. daoud<>practical minimal perfect hash functions for large databases<>cacm<>edward a. fox<>
7849<>5877_46<>qi fan chen:lenwood s. heath<>a faster algorithm for constructing minimal perfect hash functions<>sigir<>edward a. fox<>
19364<>5882_6<>michael kaufmann<>on local routing of two-terminal nets<>jct<>kurt mehlhorn<>
4780<>5894_11<>seema hiranandani:ken kennedy<>compiling fortran d for mimd distributed memory machines<>cacm<>chau-wen tseng<>
4788<>5894_19<>mary w. hall:seema hiranandani:ken kennedy<>interprocedural compilation of fortran d for mimd distributed-memory machines<>sc<>chau-wen tseng<>
4789<>5894_20<>seema hiranandani:ken kennedy<>evaluation of compiler optimizations for fortran d on mimd distributed memory machines<>ics<>chau-wen tseng<>
19997<>5917_1<>calton pu:danilo florissi:patricia soares:philip s. yu<>performance comparison of active-sender and active-receiver policies for distributed caching<>hpdc<>kun-lung wu<>
20012<>5917_16<>ming-syan chen:philip s. yu<>efficient decentralized consensus protocols in a distributed computing system<>icdcs<>kun-lung wu<>
20017<>5917_21<>ming-syan chen:philip s. yu<>scheduling and processor allocation for parallel execution of multi-join queries<>icde<>kun-lung wu<>
20019<>5917_23<>philip s. yu:calton pu<>divergence control for epsilon-serializability<>icde<>kun-lung wu<>
20882<>5928_0<>qing yang<>a novel cache design for vector processing<>isca<>liping wu yang<>
30631<>5945_1<>nulo<>"on sources in comparability graphs, with applications."<>dm<>stephan olariu<>
30638<>5945_8<>chanh t. hoang:frederic maffray:myriam preissmann<>a charming class of perfectly orderable graphs<>dm<>stephan olariu<>
19686<>5985_24<>yalin xiong:norman m. sadeh<>intelligent backtracking techniques for job shop scheduling<>kr<>katia p. sycara<>
25408<>5991_18<>nulo<>the role of natural language in a multimodal interface<>uist<>philip r. cohen<>
363<>6001_3<>louise e. moser:p. m. melliar-smith<>pal: a language for parallel asynchronous computation<>icpp<>amitabha das<>
24830<>6022_22<>shai ben-david:benny chor:michael luby<>on the theory of average case complexity<>jcss<>oded goldreich<>
24834<>6022_26<>guy even:michael luby:noam nisan:boban velickovic<>approximations of general independent distributions<>stoc<>oded goldreich<>
24924<>6022_116<>mihir bellare<>on defining proofs of knowledge<>crypto<>oded goldreich<>
15574<>6024_0<>francis s. hill<>computer graphics<>cg<>james c. miller<>
30157<>6066_1<>christof koch:binnal mathur:john g. harris:jin luo:massimo sivilotti<>object-based analog vlsi vision circuits<>nips<>shih-chii liu<>
775<>6086_0<>marek j. sergot<>formal specification of security requirements using the theory of normative positions<>esorics<>andrew j. i. jones<>
12157<>6178_0<>michael matessa<>"explorations of an incremental, bayesian algorithm for categorization."<>ml<>john r. anderson<>
24345<>6192_51<>nulo<>towards a cooperation knowledge level for collaborative problem solving<>ecai<>nicholas r. jennings<>
24411<>6192_117<>e. h. mamdani<>using joint responsibility to coordinate collaborative problem solving in dynamic environments<>aaai<>nicholas r. jennings<>
20577<>6251_0<>wei sun:weining zhang:john craig comfort<>intelligent ocr processing<>jasis<>lon-mu liu<>
7953<>6287_11<>nulo<>on the reed-muller codes<>dm<>e. f. assmus jr.<>
7987<>6289_5<>nian-zu li<>the chromatic uniqueness of w<>dm<>earl glen whitehead jr.<>
10021<>6304_10<>koji hakata<>the longest common subsequence problem for small alphabet size between many strings<>isaac<>hiroshi imai<>
10036<>6304_25<>ken-ichiro kakihara<>notes on the pac learning of geometric concepts with additional information<>alt<>hiroshi imai<>
590<>6344_8<>a. bagchi<>learning object models in visual semantic networks<>ictai<>a. gupta<>
703<>6348_1<>samuel r. buss:s. cook:v. ramachandran<>an optimal parallel algorithm for formula evaluation<>siamcomp<>a. gupta<>
718<>6348_16<>nulo<>a constructive proof that trees are well-quasi-ordered under minors<>lfcs<>arvind gupta<>
677<>6352_11<>susanne e. hambrusch<>load balanced tree embeddings<>pc<>ajay k. gupta<>
678<>6352_12<>hong wang<>on embedding ternary trees into boolean hypercubes<>spdp<>ajay k. gupta<>
679<>6352_13<>hong wang<>generalized compressed tree machines<>ipps<>ajay gupta<>
13015<>6353_2<>dinesh batra<>conceptual data modelling in database design: similarities and differences between expert and novice designers<>ijmms<>joseph g. davis<>
1616<>6370_34<>howard jay siegel:seth abraham:william l. bain:kenneth e. batcher:thomas l. casavant:doug degroot:jack b. dennis:david c. douglas:tse-yun feng:james r. goodman:alan huang:harry f. jordan:j. robert jamp:yale n. patt:james e. smith:lawrence snyder:harold s. stone:russ tuck:benjamin w. wah<>report of the purdue workshop on grand challenges in computer architecture for the support of high performance computing<>jpdc<>alan jay smith<>
26691<>6426_3<>ellen sentovich:kanwar jit singh:cho w. moon:hamid savoj:alberto l. sangiovanni-vincentelli<>sequential circuit design using synthesis and optimization<>iccd<>robert k. brayton<>
41233<>6430_0<>nulo<>on disjoint residue classes<>dm<>zhi-wei sun<>
3806<>6437_0<>john t. feddema:o. robert mitchell<>model-based visual feedback control for a hand-eye coordinated robotic system<>computer<>c. s. george lee<>
18095<>6460_0<>frederick t. sheldon:krishna m. kavi:robert tausworthe:ralph brettschneider:william w. everett<>reliability measurement: from theory to practice<>software<>james t. yu<>
36103<>6514_7<>nulo<>visualization for the document space<>visualization<>x. lin<>
10092<>6540_40<>ashwini k. nanda<>analysis of directory based cache coherence schemes with multistage networks<>acm<>hong jiang<>
29150<>6545_1<>lane a. hemachandra:nikolai k. vereshchagin<>banishing robust turing completeness<>lfcs<>sanjay jain<>
39306<>6550_21<>young man kim:ten-hwang lai<>compacting free buddy subcubes in a hypercube<>icpp<>yu-chee tseng<>
39326<>6550_41<>ten-hwang lai:xuefeng dong<>a more efficient message-optimal algorithm for distributed termination detection<>ipps<>yu-chee tseng<>
28475<>6552_0<>jui-cheng yen:f. j. chang<>a new architecture for motion-compensated image coding<>pr<>shyang chang<>
28395<>6555_14<>chyi-ren dow:mary lou soffa<>a visual optimization specification language<>avi<>shi-kuo chang<>
28401<>6555_20<>yi deng<>unifying multi-paradigms in software system design<>seke<>shi-kuo chang<>
28404<>6555_23<>gennaro costagliola:masaru tomita<>parsing 2d languages by a pictorial glr parser<>avi<>shi-kuo chang<>
28406<>6555_25<>sergio orefice:giuseppe polese:maurizio tucci:genoveffa tortora:gennaro costagliola<>a 2d interactive parser for iconic languages<>vl<>shi-kuo chang<>
28440<>6555_59<>maria francesca costabile:stefano levialdi<>a framework for intelligent visual interface design for database systems<>ids<>shi-kuo chang<>
12073<>6557_16<>robert olson:steven tuecke<>productive parallel programming: the pcn approach<>sp<>ian t. foster<>
1303<>6584_17<>zohar manna<>time for concurrency<>inria<>amir pnueli<>
1319<>6584_33<>thomas a. henzinger:zohar manna<>what good are digital clocks?<>icalp<>amir pnueli<>
1342<>6584_56<>thomas a. henzinger:zohar manna<>towards refining temporal specifications into hybrid systems<>hybrid<>amir pnueli<>
1343<>6584_57<>nulo<>system specification and refinement in temporal logic<>fsttcs<>amir pnueli<>
1344<>6584_58<>yonit kesten<>timed and hybrid statecharts and their textual representation<>ftrtft<>amir pnueli<>
1359<>6584_73<>zohar manna<>verifying hybrid systems<>hybrid<>amir pnueli<>
1378<>6584_92<>yonit kesten:joseph sifakis:sergio yovine<>integration graphs: a class of decidable hybrid systems<>hybrid<>amir pnueli<>
1402<>6584_116<>edward y. chang:zohar manna<>characterization of temporal property classes<>icalp<>amir pnueli<>
39149<>6593_5<>nulo<>verifying local stratifiability of logic programs and databases<>ngc<>yi-dong shen<>
33239<>6641_0<>michael a. bauer<>strategies for distributed search<>acm<>tong wang<>
19760<>6645_0<>qing qian<>two-level schemata and generalized links for hypertext database models<>future<>katsumi tanaka<>
41499<>6671_14<>chiaming lo<>"lower bounds on t[n, k] from linear inequalities."<>tit<>zhen zhang<>
1891<>6684_28<>nulo<>an optimal algorithm for intersecting three-dimensional convex polyhedra<>siamcomp<>bernard chazelle<>
1964<>6684_101<>herbert edelsbrunner<>an optimal algorithm for intersecting line segments in the plane<>jacm<>bernard chazelle<>
5663<>6707_4<>frank k. hwang<>a proof of the gilbert-pollak conjecture on the steiner ratio<>algorithmica<>ding-zhu du<>
5674<>6707_15<>d. frank hsu:g. w. peck<>connectivity of consecutive- digraphs<>dam<>ding-zhu du<>
6659<>6719_18<>guy kortsarz<>generating sparse 2-spanners<>swat<>david peleg<>
6663<>6719_22<>guy kortsarz<>approximation algorithms for minimum time broadcast<>istcs<>david peleg<>
26363<>6741_5<>sakti p. ghosh:tomasz imielinski:balakrishna r. iyer:arun n. swami<>an interval classifier for database mining applications<>vldb<>rakesh agrawal<>
3339<>6743_7<>hava t. siegelmann:eduardo d. sontag<>the complexity of language recognition by neural networks<>ifip<>c. lee giles<>
3355<>6743_23<>christian w. omlin<>training second-order recurrent neural networks using hints<>icml<>c. lee giles<>
29763<>6748_0<>john n. tsitsiklis:sanjoy k. mitter:ofer zeitouni<>pac learning with generalized samples and an application to stochastic geometry<>colt<>sanjeev r. kulkarni<>
2812<>6757_11<>jorma rissanen:terry p. speed<>density estimation by stochastic complexity<>tit<>bin yu<>
5621<>6804_1<>jeffrey f. naughton:donovan a. schneider:s. seshadri<>practical skew handling in parallel joins<>vldb<>david j. dewitt<>
5624<>6804_4<>michael j. franklin:michael j. zwilling:c. k. tan:michael j. carey<>crash recovery in client-server exodus<>sigmod<>david j. dewitt<>
5629<>6804_9<>seth j. white<>a performance study of alternative object faulting and pointer swizzling strategies<>vldb<>david j. dewitt<>
21198<>6805_2<>nulo<>an interval-based temporal logic in a multivalued setting<>cade<>mathias bauer<>
21195<>6806_0<>tong wang<>strategies for distributed search<>acm<>michael a. bauer<>
2345<>6889_32<>nulo<>"applying ""design by contract""."<>computer<>bertrand meyer<>
17028<>6903_25<>jyh-han lin<>learning in parallel<>iandc<>jeffrey scott vitter<>
17048<>6903_45<>franco p. preparata<>a simplified technique for hidden-line elimination in terrains<>stacs<>jeffrey scott vitter<>
17059<>6903_56<>paul g. howard<>analysis of arithmetic coding for data compression<>ipm<>jeffrey scott vitter<>
17083<>6903_80<>jyh-han lin<>approximation algorithms for geometric median problems<>ipl<>jeffrey scott vitter<>
17085<>6903_82<>paul g. howard<>error modeling for hierarchical lossless image compression<>dcc<>jeffrey scott vitter<>
17089<>6903_86<>paul g. howard<>parallel lossless image compression using huffman and arithmetic coding<>dcc<>jeffrey scott vitter<>
17091<>6903_88<>paul g. howard<>new methods for lossless image compression using arithmetic coding<>ipm<>jeffrey scott vitter<>
17099<>6903_96<>jyh-han lin<>a theory for memory-based learning<>colt<>jeffrey scott vitter<>
