15785<>0_11<>jean duprat<>the cordic algorithm: new results for fast vlsi implementation<>tc<>jean-michel muller<>
5948<>3_1<>ehud hrushovski<>on the automorphism groups of finite covers<>apal<>david m. evans<>
26559<>17_6<>paul s. amerins:derick wood<>on efficient entreeings<>acta<>ricardo a. baeza-yates<>
26562<>17_9<>mireille regnier<>fast two-dimensional pattern matching<>ipl<>ricardo a. baeza-yates<>
26566<>17_13<>joseph c. culberson:gregory j. e. rawlins<>searching in the plane<>iandc<>ricardo a. baeza-yates<>
26614<>17_61<>jose a. pino<>visual and collaborative tools for software engineering education<>ifip3-4<>ricardo a. baeza-yates<>
23313<>18_2<>boris aronov:marco pellegrini<>on the zone of a surface in a hyperplane arrangement<>dcg<>micha sharir<>
23318<>18_7<>boris aronov<>the union of convex polyhedra in three dimensions<>focs<>micha sharir<>
23320<>18_9<>herbert edelsbrunner:raimund seidel<>on the zone theorem for hyperplane arrangements<>siamcomp<>micha sharir<>
23331<>18_20<>mark de berg:mark h. overmars:leonidas j. guibas:otfried schwarzkopf:monique teillaud:dan halperin<>reaching a goal with directional uncertainty<>isaac<>micha sharir<>
23345<>18_34<>matthew j. katz<>an expander-based approach to geometric optimization<>compgeom<>micha sharir<>
25073<>25_11<>marc j. van kreveld:mark h. overmars<>intersection queries in curved objects<>jal<>pankaj k. agarwal<>
25077<>25_15<>noga alon:boris aronov:subhash suri<>can visibility graphs be represented compactly?<>compgeom<>pankaj k. agarwal<>
25089<>25_27<>jiri matousek<>ray shooting and parametric search<>siamcomp<>pankaj k. agarwal<>
25111<>25_49<>marco pellegrini:micha sharir<>counting circular arc intersections<>siamcomp<>pankaj k. agarwal<>
25143<>25_81<>micha sharir<>circle shooting in a simple polygon<>jal<>pankaj k. agarwal<>
25144<>25_82<>boris aronov:micha sharir:subhash suri<>selecting distances in the plane<>algorithmica<>pankaj k. agarwal<>
25148<>25_86<>alon efrat:micha sharir:sivan toledo<>computing a segment center for a planar point set<>jal<>pankaj k. agarwal<>
25164<>25_102<>micha sharir<>applications of a new space-partitioning technique<>dcg<>pankaj k. agarwal<>
33410<>32_1<>nulo<>the experience factory and its relationship to other improvement paradigms<>esec<>victor r. basili<>
33441<>32_32<>lionel c. briand:sandro morasca<>measuring and assessing maintainability at the end of high level design<>icsm<>victor r. basili<>
33445<>32_36<>salwa k. abd-el-hafiz<>documenting programs using a library of tree structured plans<>icsm<>victor r. basili<>
26749<>53_4<>adrian segall<>multiple logical token-rings in a single high-speed ring<>infocom<>reuven cohen<>
26768<>53_23<>nulo<>one-bit delay in ring networks<>tc<>reuven cohen<>
18760<>57_6<>chiaki sakama<>relating disjunctive logic programs to default theories<>lpnmr<>katsumi inoue<>
18765<>57_11<>chiaki sakama<>transforming abductive logic programs to disjunctive programs<>iclp<>katsumi inoue<>
18766<>57_12<>yoshihiko ohta<>incorporating top-down information into bottom-up hypothetical reasoning<>ngc<>katsumi inoue<>
18775<>57_21<>yoshihiko ohta:ryuzo hasegawa:makoto nakashima<>bottom-up abduction by model generation<>ijcai<>katsumi inoue<>
18786<>57_32<>chiaki sakama<>negation in disjunctive logic programs<>iclp<>katsumi inoue<>
23431<>106_37<>michael n. huhns:larry m. stephens<>declarative representations of multiagent systems<>tkde<>munindar p. singh<>
23432<>106_38<>nulo<>a semantics for speech acts<>amai<>munindar p. singh<>
23459<>106_65<>paul c. attie:amit p. sheth:marek rusinkiewicz<>specifying and enforcing intertask dependencies<>vldb<>munindar p. singh<>
6588<>123_0<>nulo<>a twelve-step program to more efficient robotics<>aim<>david p. miller<>
32803<>135_5<>nulo<>fuzzy reasoning and rough sets<>rsctc<>tsau young lin<>
6805<>137_0<>nulo<>optimally reliable graphs for both vertex and edge failures<>cpc<>d. h. smith<>
5732<>153_3<>kenneth l. clarkson:gary l. miller:carl sturtivant:shang-hua teng<>approximating center points with iterated radon points<>compgeom<>david eppstein<>
5751<>153_22<>nulo<>improved bounds for intersecting triangles and halving planes<>jct<>david eppstein<>
5761<>153_32<>marshall w. bern<>worst-case bounds for subadditive geometric graphs<>compgeom<>david eppstein<>
5808<>153_79<>david p. dobkin<>computing the discrepancy<>compgeom<>david eppstein<>
5811<>153_82<>marshall w. bern:shang-hua teng<>parallel construction of quadtrees and quality triangulations<>wads<>david eppstein<>
5817<>153_88<>gary l. miller:shang-hua teng<>a deterministic linear time algorithm for geometric separators and its applications<>compgeom<>david eppstein<>
5820<>153_91<>jeff erickson<>iterated nearest neighbors and finding minimal polytopes<>soda<>david eppstein<>
5821<>153_92<>zvi galil:giuseppe f. italiano:thomas h. spencer<>separator based sparsification for dynamic planar graph algorithms<>stoc<>david eppstein<>
5881<>153_152<>marshall w. bern:herbert edelsbrunner:sandra l. mitchell:tio seng tan<>edge insertion for optimal triangulations<>dcg<>david eppstein<>
27173<>202_28<>dominic a. clark:jack shirazi:michael j. e. sternberg<>discovery of protein structural constraints in a deductive database using inductive logic programming<>mi<>ross d. king<>
21522<>207_0<>david g. payne:michael j. wenger<>cognitive processing and hypermedia comprehension: a preliminary synthesis<>hci<>maxine s. cohen<>
17212<>221_12<>ming-hwa sheu:jau-yien lee:an-nan suen:lian-ying liu<>a high throughput-rate architecture for 8*8 2-d dct<>iscas<>jhing-fa wang<>
1839<>225_0<>nelson l. max:roger crawfis<>flow volumes for interactive vector field visualization<>visualization<>barry g. becker<>
1842<>225_3<>nelson l. max<>smooth transitions between bump rendering algorithms<>siggraph<>barry g. becker<>
39133<>245_2<>masaharu munetomo:yoshiaki takai<>an efficient migration scheme for subpopulation-based asynchronously parallel genetic algorithms<>icga<>yoshiharu sato<>
30938<>270_28<>yishay mansour:james k. park:baruch schieber<>improved selection in totally monotone arrays<>ijcga<>s. sen<>
29161<>280_2<>paul ammann<>distributed timestamp generation in planar lattice networks<>tocs<>sushil jajodia<>
29175<>280_16<>elisa bertino:pierangela samarati<>high assurance discretionary access control for object bases<>ccs<>sushil jajodia<>
29194<>280_35<>elisa bertino:pierangela samarati<>enforcing mandatory access control in object bases<>oopsla<>sushil jajodia<>
29198<>280_39<>ravi mukkamala<>measuring the effect of commutative transactions on distributed database performance<>isci<>sushil jajodia<>
29305<>280_146<>elisa bertino<>modeling multilevel entities using single level objects<>dood<>sushil jajodia<>
29345<>280_186<>vijayalakshmi atluri:elisa bertino<>achieving stricter correctness requirements in multilevel secure databases: the dynamic case<>dbsec<>sushil jajodia<>
29361<>280_202<>catherine d. mccollum:barbara t. blaustein<>integrating concurrency control and commit algorithms in distributed multilevel secure databases<>dbsec<>sushil jajodia<>
3767<>289_0<>nulo<>on the size of graphs with all cycle having distinct length<>dm<>chunhui lai<>
23650<>333_90<>tomas feder<>monotone monadic snp and constraint satisfaction<>stoc<>moshe y. vardi<>
23733<>333_173<>rajeev alur:thomas a. henzinger<>parametric real-time reasoning<>stoc<>moshe y. vardi<>
31411<>334_7<>john hershberger<>efficient computation of euclidean shortest paths in the plane<>focs<>subhash suri<>
33293<>355_25<>apostolos gerasoulis<>on the granularity and clustering of directed acyclic task graphs<>tpds<>tao yang<>
22766<>424_19<>mark de berg:leonidas j. guibas:otfried schwarzkopf:monique teillaud:dan halperin:micha sharir<>reaching a goal with directional uncertainty<>isaac<>mark h. overmars<>
22795<>424_48<>prosenjit bose:leonidas j. guibas:anna lubiw:diane l. souvaine:jorge urrutia<>the floodlight problem<>cccg<>mark h. overmars<>
22818<>424_71<>marc j. van kreveld<>union-copy structures and dynamic segment trees<>jacm<>mark h. overmars<>
22823<>424_76<>mark de berg:marko de groot<>perfect binary space partitions<>cccg<>mark h. overmars<>
22824<>424_77<>pankaj k. agarwal:marc j. van kreveld<>intersection queries in curved objects<>jal<>mark h. overmars<>
22846<>424_99<>a. frank van der stappen:dan halperin<>the complexity of the free space for a robot moving amidst fat obstacles<>comgeo<>mark h. overmars<>
14689<>471_0<>william a. kretzschmar jr.<>spatial analysis of linguistic data with gis functions<>gis<>jay lee<>
19488<>483_8<>shun-ping chung:arik n. kashper<>computing approximate blocking probabilities for large loss networks with state-dependent routing<>ton<>keith w. ross<>
19496<>483_16<>sanjay gupta:magda el zarki<>on routing in atm networks<>atmn<>keith w. ross<>
19439<>485_14<>inderpal singh mumick<>noodle: a language for declarative querying in an object-oriented database<>dood<>kenneth a. ross<>
24183<>489_0<>arun krishnan<>range estimation from focus using a non-frontal imaging camera<>aaai<>narendra ahuja<>
24189<>489_6<>a. lynn abbott<>"active stereo: integrating disparity, vergence, focus, aperture and calibration for surface estimation."<>pami<>narendra ahuja<>
33906<>529_1<>james p. callan:john broglio<>trec-2 routing and ad-hoc retrieval evaluation using the inquery system<>trec<>w. bruce croft<>
33912<>529_7<>howard r. turtle<>retrieval strategies for hypertext<>ipm<>w. bruce croft<>
33928<>529_23<>david haines<>relevance feedback and inference networks<>sigir<>w. bruce croft<>
33970<>529_65<>nulo<>knowledge-based and statistical approaches to text retrieval<>expert<>w. bruce croft<>
33983<>541_0<>nulo<>"ernest davis, representations of commonsense knowledge."<>ai<>william croft<>
25372<>544_0<>jyuo-min shyu:liang-gee chen<>hardware verification using symbolic state transition graphs<>iccd<>pinhong chen<>
25363<>550_1<>nulo<>a climate simulation case study<>visualization<>p. c. chen<>
39<>563_2<>nulo<>active calibration<>icra<>anup basu<>
33<>564_5<>raj s. mitra:biswaroop guha<>rapid prototyping of microprocessor-based systems<>iccad<>anupam basu<>
21833<>567_0<>manfred a. jeusfeld:peter szczurko<>three aspects of intelligent cooperation in the quality cycle<>ijcis<>matthias jarke<>
6323<>592_13<>majid sarrafzadeh<>maximum independent set of a permutation graph in k tracks<>ijcga<>d. t. lee<>
6327<>592_17<>mikhail j. atallah:danny z. chen<>"an optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications."<>esa<>d. t. lee<>
6283<>594_2<>grzegorz w. wasilkowski:rajiv mehrotra<>a new zero-crossing-based discontinuity detector<>tip<>david lee<>
6288<>594_7<>grzegorz w. wasilkowski<>discontinuity detection and thresholding-a stochastic approach<>jc<>david lee<>
6296<>594_15<>mihalis yannakakis<>an efficient algorithm for minimizing real-time transition systems<>cav<>david lee<>
6302<>594_21<>krishan k. sabnani:david m. kristol:sanjoy paul:m. umit uyar<>conformance testing of protocols specified as communicating fsms<>infocom<>david lee<>
6307<>594_26<>david m. kristol:arun n. netravali:krishan k. sabnani<>a polynomial algorithm for gateway generation from formal specifications<>ton<>david lee<>
28821<>603_0<>puhua guan<>a spanning tree of the 2-dimensional hypercube with maximum number of degree-preserving vertices<>dm<>sul-young choi<>
434<>622_16<>bruce reed<>polychromatic hamilton cycles<>dm<>alan frieze<>
443<>622_25<>a. j. radcliffe:stephen suen<>analysis of a simple greedy matching algorithm on random cubic graphs<>soda<>alan m. frieze<>
29722<>679_0<>terry a. mckee:fred r. mcmorris:fred s. roberts<>-competition numbers<>dam<>suh-ryung kim<>
25741<>702_5<>ming-syan chen<>combining join and semi-join operations for distributed query processing<>tkde<>philip s. yu<>
25786<>702_50<>avraham leff:joel l. wolf<>replication algorithms in a remote caching architecture<>tpds<>philip s. yu<>
25813<>702_77<>asit dan:jen-yao chung<>database access characterization for buffer hit prediction<>icde<>philip s. yu<>
25829<>702_93<>dinkar sitaram:asit dan<>issues in the design of multi-server file systems to cope with load skew<>pdis<>philip s. yu<>
25843<>702_107<>kun-lung wu:ming-syan chen<>dynamic finite versioning: an effective versioning approach to concurrent transaction and query processing<>icde<>philip s. yu<>
25851<>702_115<>ming-syan chen:joel l. wolf:john turek<>parallel query processing<>lncs<>philip s. yu<>
25856<>702_120<>calton pu:wenwey hseush:gail e. kaiser:kun-lung wu<>distributed divergence control for epsilon serializability<>icdcs<>philip s. yu<>
25866<>702_130<>daniel m. dias<>performance analysis of concurrency control using locking with deferred blocking<>tse<>philip s. yu<>
25889<>702_153<>ming-syan chen:hui-i hsiao<>applying hash filters to improving the execution of bushy trees<>vldb<>philip s. yu<>
25892<>702_156<>ming-ling lo:ming-syan chen:chinya v. ravishankar<>on optimal processor allocation to support pipelined hash joins<>sigmod<>philip s. yu<>
18179<>728_3<>stephan olariu:james l. schwing<>optimal convex hull algorithms on enhanced meshes<>bit<>jingyuan zhang<>
18187<>728_11<>stephan olariu:james l. schwing<>computing the hough transform on reconfigurable meshes<>ivc<>jingyuan zhang<>
18191<>728_15<>stephan olariu:james l. schwing<>applications of reconfigurable meshes to constant-time computations<>pc<>jingyuan zhang<>
18192<>728_16<>dharmavani bhagavathi:himabindu gurla:stephan olariu:rong lin:james l. schwing<>square meshes are not optimal for convex hull computation<>icpp<>jingyuan zhang<>
18195<>728_19<>rong lin:stephan olariu:james l. schwing<>"simulating enhanced meshes, with applications."<>ppl<>jingyuan zhang<>
21558<>749_2<>nulo<>lambda-calculus schemata<>lisp<>michael j. fischer<>
5510<>789_0<>nulo<>letters to the editor<>nn<>dale a. brown<>
31649<>807_0<>robert h. storer:pei-chann chang<>one-machine rescheduling heuristics with efficiency and stability as criteria<>cor<>s. david wu<>
21264<>832_33<>nulo<>functional specification of time-sensitive communicating systems<>tosem<>manfred broy<>
40677<>836_2<>nulo<>spanning closed trails in graphs<>dm<>zhi-hong chen<>
8715<>905_1<>william c. bulko<>diagrams and text as computer input<>vlc<>gordon s. novak jr.<>
34127<>907_0<>michael a. glover<>a massively-parallel {simd} processor for neural network and machine vision applications<>nips<>w. thomas miller iii<>
14631<>913_2<>won yong kim:myoung-ho kim:yoon-joon lee<>enhancing the fuzzy set model with positively compensatory operators<>dasfaa<>joon ho lee<>
14633<>913_4<>myoung-ho kim:yoon-joon lee<>analysis of fuzzy operators for high quality information retrieval<>ipl<>joon ho lee<>
12655<>919_6<>nulo<>nondeterministic parallel control-flow / definition-use nets and their applications<>parco<>jingde cheng<>
12663<>919_14<>nulo<>dependence-based complexity metrics for distributed programs<>icpp<>jingde cheng<>
26095<>933_0<>john r. anderson<>strategy choice and change in programming<>ijmms<>quanfeng wu<>
26096<>934_0<>john darlington:a. j. field:peter g. harrison:paul h. j. kelly:david w. n. sharp<>parallel programming using skeleton functions<>parle<>qian wu<>
22888<>956_3<>bahman s. nobandegani:bryan preas<>architecture and routability analysis for row-based fpgas<>iccad<>massoud pedram<>
22914<>956_29<>chi-ying tsui:alvin m. despain<>technology decomposition and mapping targeting low power dissipation<>dac<>massoud pedram<>
22981<>956_96<>debaditya mukherjee:melvin a. breuer<>merging multiple fsm controllers for dft/bist hardware<>iccad<>massoud pedram<>
23028<>956_143<>yung-te lai:sarma b. k. vrudhula<>bdd based decomposition of logic functions with application to fpga synthesis<>dac<>massoud pedram<>
23032<>956_147<>hirendu vaishnav<>routability-driven fanout optimization<>dac<>massoud pedram<>
31972<>988_0<>wayne a. christopher:steven j. procter<>the nachos instructional operating system<>usenix<>thomas e. anderson<>
31980<>988_8<>margaret martonosi:anoop gupta<>effectiveness of trace sampling for performance debugging tools<>sigmetrics<>thomas e. anderson<>
32000<>988_28<>randolph y. wang<>xfs: a wide area mass storage file system<>hotos<>thomas e. anderson<>
32001<>988_29<>susan s. owicki:james b. saxe:charles p. thacker<>high speed switch scheduling for local area networks<>tocs<>thomas e. anderson<>
32006<>988_34<>keith krueger:david loftesness:amin vahdat<>tools for the development of application-specific virtual memory management<>oopsla<>thomas e. anderson<>
32009<>988_37<>robert wahbe:steven lucco:susan l. graham<>efficient software-based fault isolation<>sosp<>thomas e. anderson<>
19422<>992_3<>nulo<>real-time databases<>dpd<>krithi ramamritham<>
23551<>1022_9<>jolly chen:nobuko nathan:caroline paxson:jiang wu<>tioga: providing data management support for scientific visualization applications<>vldb<>michael stonebraker<>
736<>1038_0<>allan l. fisher<>parametric circuit representation using inductive boolean functions<>cav<>aarti gupta<>
22054<>1047_31<>joachim von zur gathen:igor shparlinski<>counting curves and their projections<>stoc<>marek karpinski<>
22075<>1047_52<>thorsten werther<>vc dimension and uniform learnability of sparse polynomials and rational functions<>siamcomp<>marek karpinski<>
22095<>1047_72<>rutger verbeek<>on randomized versus deterministic computation<>icalp<>marek karpinski<>
22111<>1047_88<>peter burgisser:thomas lickteig<>on randomized semi-algebraic test complexity<>jc<>marek karpinski<>
22114<>1047_91<>mikael goldmann<>simulating threshold circuits by majority circuits<>stoc<>marek karpinski<>
37093<>1068_42<>pavol hell:huishan zhou<>homomorphisms to oriented cycles<>combinatorica<>xuding zhu<>
33078<>1087_2<>marshall w. bern:herbert edelsbrunner:david eppstein:sandra l. mitchell<>edge insertion for optimal triangulations<>dcg<>tio seng tan<>
38498<>1097_1<>nulo<>perfectly overlapped generation of long runs for sorting large files<>jpdc<>yen-chun lin<>
38477<>1099_14<>cheng-tsung hwang:yu-chin hsu<>pls: a scheduler for pipeline synthesis<>tcad<>youn-long lin<>
38439<>1100_28<>nulo<>parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy<>ipl<>yi-bing lin<>
38454<>1100_43<>nulo<>determining the global progress of parallel simulation<>jise<>yi-bing lin<>
38499<>1104_0<>mario gerla<>induction and deduction for autonomous networks<>jsac<>ying-dar jason lin<>
3326<>1128_10<>rakesh agrawal:arun n. swami<>efficient similarity search in sequence databases<>fodo<>christos faloutsos<>
6397<>1142_0<>w. bruce croft<>guest editor's introduction<>expert<>dik lun lee<>
37621<>1199_4<>raimund k. ege:wei sun<>executable specifications for the design of object-oriented systems<>seke<>yi deng<>
19962<>1262_2<>mark a. franklin<>distributed computing systems and checkpointing<>hpdc<>kenneth f. wong<>
19916<>1273_11<>scott r. tilley:hausi a. muller:michael j. whitney<>domain-retargetable reverse engineering<>icsm<>kenny wong<>
19919<>1273_14<>hausi a. muller:scott r. tilley<>understanding software systems using reverse engineering technology perspectives from the rigi project<>cascon<>kenny wong<>
9899<>1287_0<>nulo<>the union of balls and its dual shape<>compgeom<>herbert edelsbrunner<>
9875<>1291_3<>tamal k. dey<>counting triangle crossings and halving planes<>compgeom<>herbert edelsbrunner<>
9879<>1291_7<>raimund seidel:micha sharir<>on the zone theorem for hyperplane arrangements<>siamcomp<>herbert edelsbrunner<>
12702<>1295_3<>k. ryu:seung ryoul maeng<>concurrency and inheritance in actor-based object-oriented languages<>jss<>jung wan cho<>
4863<>1344_0<>robert h. sturges<>concurrent product/process design with multiple representations of parts<>icra<>cheng-hua wang<>
32779<>1364_3<>benjamin kedem<>strong consistency of the contraction mapping method for frequency estimation<>tit<>ta-hsin li<>
3753<>1368_9<>xiang-gen xia:zhen zhang<>design of optimal fir prefilters for wavelet coefficient computation<>iscas<>c. c. jay kuo<>
3755<>1368_11<>xiang-gen xia:zhen zhang<>signal extrapolation based on wavelet transform<>iscas<>c. c. jay kuo<>
3756<>1368_12<>tianhorng chang<>texture analysis and classification with tree-structured wavelet transform<>tip<>c. c. jay kuo<>
4758<>1414_0<>jiann-shu lee:yung-nien sun:chin-hsing chen<>wavelet based corner detection<>pr<>ching-tsorng tsai<>
4759<>1414_1<>yung-nien sun:pau-choo chung:jiann-shu lee<>endocardial boundary detection using a neural network<>pr<>ching-tsorng tsai<>
23232<>1433_27<>yuetsu kodama:yasuhito koumura:hirohumi sakane:shuichi sakai:yoshinori yamaguchi<>emc-y: parallel processing element optimizing communication and computation<>ics<>mitsuhisa sato<>
12346<>1436_12<>edward f. gehringer<>evaluation of an object-caching coprocessor design for object-oriented systems<>iccd<>j. morris chang<>
12363<>1436_29<>edward f. gehringer<>performance of object caching for object-oriented systems<>vlsi<>j. morris chang<>
16134<>1441_8<>shenfeng chen<>"using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs"<>focs<>john h. reif<>
16140<>1441_14<>stephen r. tate<>the complexity of n-body simulation<>icalp<>john h. reif<>
16142<>1441_16<>tassos markas<>multispectral image compression algorithms<>dcc<>john h. reif<>
16146<>1441_20<>deganit armon<>a dynamic separator algorithm<>wads<>john h. reif<>
16184<>1441_58<>bruce randall donald:patrick g. xavier:john f. canny<>kinodynamic motion planning<>jacm<>john h. reif<>
16188<>1441_62<>victor y. pan<>fast and efficient parallel solution of sparse linear systems<>siamcomp<>john h. reif<>
14483<>1460_0<>raul san martin<>operations research in the high-level synthesis of integrated circuits<>cor<>john p. knight<>
13126<>1465_5<>adam beguelin:al geist:robert manchek:keith moore:vaidy s. sunderam<>tools for heterogeneous network computing<>ppsc<>jack dongarra<>
13196<>1465_75<>robert a. van de geijn:r. clinton whaley<>two dimensional basic linear algebra communication subprograms<>ppsc<>jack dongarra<>
13260<>1465_139<>adam beguelin:al geist:vaidy s. sunderam<>visualization and debugging in a heterogeneous environment<>computer<>jack dongarra<>
40568<>1471_2<>shinn-ying ho<>incremental model building of polyhedral objects using structured light<>pr<>zen chen<>
40604<>1473_26<>nulo<>learning unions of two rectangles in the plane with equivalence queries<>colt<>zhixiang chen<>
30253<>1486_10<>david mattox:kenneth smith<>tracking causal dependencies in an active object-oriented database<>dood<>stephen c. y. lu<>
8987<>1492_2<>nulo<>programs as data in an extended prolog<>cj<>gianfranco rossi<>
8996<>1492_11<>agostino dovier<>embedding extensional finite sets in clp<>slp<>gianfranco rossi<>
9001<>1492_16<>agostino dovier<>un linguaggio logico con insiemi finiti inserito nello schema clp<>agp<>gianfranco rossi<>
9012<>1492_27<>iliano cervesato<>a wam implementation for the logic meta programming language 'log<>agp<>gianfranco rossi<>
12864<>1499_13<>moazzem hossain:naveed a. sherwani<>a provably good multilayer topological planar routing algorithm in ic layout designs<>tcad<>jason cong<>
12867<>1499_16<>andrew b. kahng:gabriel robins<>matching-based methods for high-performance clock routing<>tcad<>jason cong<>
12869<>1499_18<>kwok-shing leung:dian zhou<>performance-driven interconnect design based on distributed rc delay model<>dac<>jason cong<>
12912<>1499_61<>kwok-shing leung<>optimal wiresizing under the distributed elmore delay model<>iccad<>jason cong<>
12917<>1499_66<>yuzheng ding<>on area/depth trade-off in lut-based fpga technology mapping<>dac<>jason cong<>
12927<>1499_76<>yuzheng ding<>beyond the combinatorial limit in depth minimization for lut-based fpga designs<>iccad<>jason cong<>
12985<>1499_134<>kei-yong khoo<>an efficient multilayer mcm router based on four-via routing<>dac<>jason cong<>
7614<>1520_1<>nulo<>efficient parallel shortest-paths in digraphs with a separator decomposition<>spaa<>edith cohen<>
7652<>1520_39<>nimrod megiddo<>strongly polynomial-time and nc algorithms for detecting cycles in periodic graphs<>jacm<>edith cohen<>
7654<>1520_41<>nulo<>using selective path-doubling for parallel shortest-path computations<>istcs<>edith cohen<>
8180<>1532_7<>hannu kari:heikki saikkonen<>detection of defective media in disks<>dft<>fabrizio lombardi<>
8214<>1532_41<>chao feng:laxmi n. bhuyan<>an adaptive system-level diagnosis approach for hypercube multiprocessors<>spdp<>fabrizio lombardi<>
28855<>1545_0<>neal brand:stephen m. curran:tom jacob<>probability of diameter two for steinhaus graphs<>dam<>sajal k. das<>
18986<>1554_18<>karlis cerans:jens chr. godskesen<>timed modal specification - theory and tools<>cav<>kim guldstrand larsen<>
19004<>1554_36<>klaus havelund<>the fork calculus<>icalp<>kim guldstrand larsen<>
19133<>1556_2<>jason cong<>optimal wiresizing under the distributed elmore delay model<>iccad<>kwok-shing leung<>
19134<>1556_3<>jason cong:dian zhou<>performance-driven interconnect design based on distributed rc delay model<>dac<>kwok-shing leung<>
19087<>1563_6<>y. t. so<>consistency checking for fuzzy expert systems<>ijar<>kwong-sak leung<>
10715<>1596_19<>philip n. klein:robert h. b. netzer<>detecting race conditions in parallel programs that use one semaphore<>wads<>hsueh-i lu<>
13772<>1619_30<>jim welsh<>object organisation in software environments for formal methods<>tapsoft<>jun han<>
30540<>1627_39<>krishna v. palem<>highly efficient dictionary matching in parallel<>spaa<>s. muthukrishnan<>
30577<>1627_76<>nulo<>detecting false matches in string matching algorithms<>cpm<>s. muthukrishnan<>
30601<>1627_100<>richard cole:maxime crochemore:zvi galil:leszek gasieniec:ramesh hariharan:kunsoo park:wojciech rytter<>optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions<>focs<>s. muthukrishnan<>
16086<>1642_5<>yishay mansour:baruch schieber:s. sen<>improved selection in totally monotone arrays<>ijcga<>james k. park<>
37790<>1646_12<>carlos r. p. hartmann:chih-chieh chen<>efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes<>tit<>yunghsiang s. han<>
28629<>1667_1<>nulo<>aligning sentences in bilingual corpora using lexical information<>acl<>stanley f. chen<>
25722<>1683_0<>gail c. murphy<>towards a testing methodology for object-oriented systems<>oopsm<>pok sze wong<>
6747<>1690_8<>kyung-goo doh<>action semantics-directed prototyping<>cl<>david a. schmidt<>
41086<>1783_22<>yonit kesten:amir pnueli<>temporal verification of simulation and refinement<>rex<>zohar manna<>
41089<>1783_25<>yonit kesten:hugh mcguire:amir pnueli<>a decision algorithm for full propositional temporal logic<>cav<>zohar manna<>
41113<>1783_49<>amir pnueli<>models for reactivity<>acta<>zohar manna<>
3978<>1788_5<>c. k. lee<>minimum cross entropy thresholding<>pr<>chun hung li<>
8848<>1796_42<>david eppstein:shang-hua teng<>a deterministic linear time algorithm for geometric separators and its applications<>compgeom<>gary l. miller<>
8850<>1796_44<>kenneth l. clarkson:david eppstein:carl sturtivant:shang-hua teng<>approximating center points with iterated radon points<>compgeom<>gary l. miller<>
38974<>1870_36<>james k. park:baruch schieber:s. sen<>improved selection in totally monotone arrays<>ijcga<>yishay mansour<>
38984<>1870_46<>eyal kushilevitz<>learning decision trees using the fourier spectrum<>siamcomp<>yishay mansour<>
38995<>1870_57<>eyal kushilevitz:michael o. rabin:david zuckerman<>lower bounds for randomized mutual exclusion<>stoc<>yishay mansour<>
39014<>1870_76<>boaz patt-shamir<>greedy packet scheduling on shortest paths<>jal<>yishay mansour<>
39017<>1870_79<>nathan linial:noam nisan<>"constant depth circuits, fourier transform, and learnability."<>jacm<>yishay mansour<>
39043<>1870_105<>don coppersmith:hugo krawczyk<>the shrinking generator<>crypto<>yishay mansour<>
39044<>1870_106<>baruch awerbuch:shay kutten:boaz patt-shamir:george varghese<>time optimal self-stabilizing synchronization<>stoc<>yishay mansour<>
17755<>1888_7<>nulo<>local strongly arc-connectivity in regular bipartite digraphs<>jct<>juming xu<>
2923<>1895_0<>michael j. black:yiannis aloimonos:ian horswill:jitendra malik:giulio sandini:michael j. tarr<>action representation and purpose: re-evaluating the foundations of computational vision<>ijcai<>christopher m. brown<>
3538<>1907_10<>leo mark:nick roussopoulos:timos k. sellis<>using differential techniques to efficiently support transaction time<>vldb<>christian s. jensen<>
3591<>1907_63<>michael d. soo:richard t. snodgrass<>unification of temporal data models<>icde<>christian s. jensen<>
9479<>1943_14<>nulo<>on reduction algorithms for graphs with small treewidth<>wg<>hans l. bodlaender<>
9481<>1943_16<>nulo<>on linear time minor tests with depth-first search<>jal<>hans l. bodlaender<>
9502<>1943_37<>nulo<>a tourist guide through treewidth<>actaC<>hans l. bodlaender<>
9504<>1943_39<>ton kloks:haiko muller:dieter kratsch<>computing treewidth and minimum fill-in: all you need are the minimal separators<>esa<>hans l. bodlaender<>
9521<>1943_56<>nulo<>complexity of path-forming games<>tcs<>hans l. bodlaender<>
9532<>1943_67<>rolf h. mohring<>the pathwidth and treewidth of cographs<>siamdm<>hans l. bodlaender<>
9544<>1943_79<>nulo<>a linear time algorithm for finding tree-decompositions of small treewidth<>stoc<>hans l. bodlaender<>
9566<>1943_101<>klaus jansen<>on the complexity of scheduling incompatible jobs with unit-times<>mfcs<>hans l. bodlaender<>
9570<>1943_105<>nulo<>dynamic algorithms for graphs with treewidth 2<>wg<>hans l. bodlaender<>
9582<>1943_117<>ton kloks<>a simple linear time algorithm for triangulating three-colored graphs<>jal<>hans l. bodlaender<>
26315<>1945_4<>nulo<>an integrated method for estimating selectivities in a multidatabase system<>cascon<>qiang zhu<>
26336<>1945_25<>per-ake larson<>query optimization using fuzzy set theory for multidatabase systems<>cascon<>qiang zhu<>
34954<>1947_0<>nulo<>local disk depot - customizing the software environment<>lisa<>walter c. wong<>
9183<>1961_4<>wolfgang nejdl:stefano ceri<>evaluating recursive queries in distributed databases<>tkde<>gio wiederhold<>
9234<>1961_55<>nulo<>intelligent integration of information<>sigmod<>gio wiederhold<>
11988<>1964_1<>nulo<>inequalities with respect to graph homomorphism<>dm<>huishan zhou<>
11989<>1964_2<>nulo<>chromatic difference sequences and homomorphisms<>dm<>huishan zhou<>
11990<>1964_3<>nulo<>characterization of the homomorphic preimages of certain oriented cycles<>siamdm<>huishan zhou<>
11994<>1964_7<>pavol hell:xuding zhu<>homomorphisms to oriented cycles<>combinatorica<>huishan zhou<>
4656<>1995_2<>ju yuan hsiao:ruay shiung chang<>the summation and bottleneck minimization for single-step searching on weighted graphs<>isci<>chuan yi tang<>
27915<>1997_25<>gregory f. johnson<>separations of concerns in the chiron-1 user interface development and management system<>chi<>richard n. taylor<>
4428<>2008_18<>nulo<>software performance engineering<>sigmetrics<>connie u. smith<>
29519<>2019_9<>carlos h. diaz:charvaka duvvury<>thermal failure simulation for electrical overstress in semiconductor devices<>iscas<>sung-mo kang<>
29531<>2019_21<>sachin s. sapatnekar:pravin m. vaidya<>convexity-based algorithms for design centering<>iccad<>steve m. kang<>
29539<>2019_29<>sachin s. sapatnekar:pravin m. vaidya<>feasible region approximation using convex polytopes<>iscas<>sung-mo kang<>
29487<>2020_18<>katsushi ikeuchi<>the complex egi: a new representation for 3-d pose determination<>pami<>sing bing kang<>
27986<>2030_1<>dereck s. meek<>hermite interpolation with a pair of spirals<>cagd<>r. s. d. thomas<>
27950<>2031_5<>neil robertson:paul d. seymour<>hadwiger's conjecture for k -free graphs<>combinatorica<>robin thomas<>
27956<>2031_11<>paul d. seymour<>graph searching and a min-max theorem for tree-width<>jct<>robin thomas<>
27980<>2031_35<>bogdan oporowski:james g. oxley<>typical subgraphs of 3- and 4-connected graphs<>jct<>robin thomas<>
27942<>2033_3<>nulo<>a proposal for object oriented modula-2<>oopsm<>richard thomas<>
16264<>2037_7<>gagan agrawal:alan sussman<>compiler and runtime support for structured and block structured applications<>sc<>joel h. saltz<>
39850<>2041_27<>christopher g. chute<>an application of least squares fit mapping to text information retrieval<>sigir<>yiming yang<>
12029<>2049_2<>sayed atef banawan<>modeling and analysis of concurrent maintenance policies for data structures using pointers<>tse<>ing-ray chen<>
12052<>2049_25<>farokh b. bastani<>the reliability of embedded ai systems<>expert<>ing-ray chen<>
24476<>2083_32<>bapiraju vinnakota<>synthesis of algorithm-based fault-tolerant systems from dependence graphs<>tpds<>niraj k. jha<>
24490<>2083_46<>sandeep bhatia<>synthesis of sequential circuits for robust path delay fault testability<>vlsid<>niraj k. jha<>
24513<>2083_69<>sying-jyan wang<>design and synthesis of self-checking vlsi circuits<>tcad<>niraj k. jha<>
24537<>2083_93<>ramesh k. sitaraman<>optimal design of checks for error detection and location in fault-tolerant multiprocessor systems<>tc<>niraj k. jha<>
24539<>2083_95<>nulo<>fault detection in cvs parity trees with application to strongly self-checking parity and two-rail checkers<>tc<>niraj k. jha<>
24569<>2083_125<>tien-chien lee:wayne wolf<>behavioral synthesis of highly testable data paths under the non-scan and partial scan environments<>dac<>niraj k. jha<>
24613<>2083_169<>bapiraju vinnakota<>diagnosability and diagnosis of algorithm-based fault-tolerant systems<>tc<>niraj k. jha<>
24616<>2083_172<>santhanam srinivasan<>efficient diagnosis in algorithm-based fault tolerant multiprocessor systems<>iccd<>niraj k. jha<>
41000<>2121_0<>ding-zhu du:biao gao:ronald l. graham:peng-jun wan<>minimum steiner trees in normed planes<>dcg<>zi-cheng liu<>
14472<>2132_0<>bernard p. zeigler<>asynchronous genetic algorithms on parallel computers<>icga<>jinwoo kim<>
14451<>2148_3<>sung-kwong park<>geometrical learning algorithm for multilayer neural networks in a binary field<>tc<>jung h. kim<>
14454<>2148_6<>phill k. rhee<>the rule-based approach to reconfiguration of 2-d processor arrays<>tc<>jung hwan kim<>
40928<>2152_2<>eitan altman<>improving the stability characteristics of asynchronous traffic in fddi token ring<>dcsp<>zhen liu<>
14296<>2166_2<>william d. richard:brian l. gottlieb:ken krieger<>the washington university multimedia system<>mms<>jerome r. cox jr.<>
31253<>2180_22<>david perry greene<>competition-based induction of decision models from examples<>ml<>stephen f. smith<>
31258<>2180_27<>cheng-chung cheng<>slack-based heuristics for constraint satisfaction scheduling<>aaai<>stephen f. smith<>
31263<>2180_32<>ora lassila<>configurable systems for reactive production management<>ifip5-7<>stephen f. smith<>
40198<>2194_4<>alan k. mackworth<>constraint programming in constraint nets<>ppcp<>ying zhang<>
6988<>2267_10<>nulo<>pattern recognition: neural networks in perspective<>expert<>deliang l. wang<>
7021<>2268_13<>nulo<>an elimination method for polynomial systems<>jsc<>dongming wang<>
27744<>2308_3<>michael t. goodrich<>dynamic ray shooting and shortest paths via balanced geodesic triangulations<>compgeom<>roberto tamassia<>
27752<>2308_11<>robert f. cohen:sairam sairam:jeffrey scott vitter<>dynamic algorithms for optimization problems in bounded tree-width graphs<>ipco<>roberto tamassia<>
27764<>2308_23<>goos kant:giuseppe liotta:ioannis g. tollis<>area requirement of visibility representations of trees<>cccg<>roberto tamassia<>
27773<>2308_32<>robert f. cohen:giuseppe di battista:arkady kanevsky<>reinventing the wheel: an optimal data structure for connectivity queries<>stoc<>roberto tamassia<>
27798<>2308_57<>ashim garg:michael t. goodrich<>area-efficient upward tree drawings<>compgeom<>roberto tamassia<>
27818<>2308_77<>yi-jen chiang:franco p. preparata<>"a unified approach to dynamic point location, ray shooting, and shortest paths in planar maps."<>soda<>roberto tamassia<>
27826<>2308_85<>david eppstein:giuseppe f. italiano:robert endre tarjan:jeffery westbrook:moti yung<>corrigendum: maintenance of a minimum spanning forest in a dynamic plane graph<>jal<>roberto tamassia<>
27835<>2308_94<>paola bertolazzi:giuseppe di battista:carlo mannino<>optimal upward planarity testing of single-source digraphs<>esa<>roberto tamassia<>
27843<>2308_102<>sairam sairam:jeffrey scott vitter<>a complexity theoretic approach to incremental computation<>stacs<>roberto tamassia<>
21372<>2326_14<>hui-i hsiao:philip s. yu<>applying hash filters to improving the execution of bushy trees<>vldb<>ming-syan chen<>
21394<>2326_36<>philip s. yu:kun-lung wu<>decentralized consensus protocols with multi-port communication<>icdcs<>ming-syan chen<>
21412<>2326_54<>philip s. yu:joel l. wolf:john turek<>parallel query processing<>lncs<>ming-syan chen<>
17594<>2361_57<>kejun yao<>multicasting in injured hypercubes using limited global information<>spdp<>jie wu<>
32187<>2375_1<>takanori shibata<>coordinative behavior by genetic algorithm and fuzzy in evolutionary multi-agent system<>icra<>toshio fukuda<>
1737<>2381_59<>jeanette p. schmidt:alan siegel<>chernoff-hoeffding bounds for applications with limited independence<>soda<>aravind srinivasan<>
1740<>2381_62<>suresh chari:pankaj rohatgi<>"randomness-optimal unique element isolation, with applications to perfect matching and related problems."<>stoc<>aravind srinivasan<>
39677<>2410_0<>you-liang gu<>a normal form augmentation approach to adaptive control of space robot systems<>icra<>yangsheng xu<>
39681<>2410_4<>jie yang:c. s. chen<>hidden markov model approach to skill learning and its application in telerobotics<>icra<>yangsheng xu<>
39682<>2410_5<>nulo<>the measure of dynamic coupling of space robot systems<>icra<>yangsheng xu<>
27336<>2427_14<>m. m. anguh<>a truncation method for computing walsh transforms with applications to image processing<>cvgip<>ralph r. martin<>
27369<>2427_47<>david beasley<>disassembly sequences for objects built from unit cubes<>cad<>ralph r. martin<>
27374<>2427_52<>david beasley:david r. bull<>reducing epistasis in combinatorial problems by expansive coding<>icga<>ralph r. martin<>
39554<>2482_0<>grace wahba:chong gu:ronald klein:barbara klein<>"structured machine learning for soft classification with smoothing spline anova and stacked tuning, testing, and evaluation."<>nips<>yuedong wang<>
10547<>2493_6<>nulo<>a verification tool for value-passing processes<>pstv<>h. lin<>
10550<>2493_9<>matthew hennessy<>proof systems for message-passing process algebras<>concur<>h. lin<>
12848<>2499_1<>dominique perrin:jean-eric pin<>on the expressive power of temporal logic<>jcss<>joelle cohen<>
12526<>2503_6<>craig a. kaplan:justine fenwick<>adaptive hypertext navigation based on user goals and context<>umuai<>james chen<>
12480<>2522_80<>liming cai<>on fixed-parameter tractability and approximability of -hard optimization problems<>istcs<>jianer chen<>
26728<>2575_1<>been-chian chien:wei-pang yang<>manipulating multiple stacks with ordered-heap<>isci<>rong-jaye chen<>
26970<>2590_3<>rafael dueire lins<>cyclic weighted reference counting without delay<>parle<>richard e. jones<>
30969<>2683_1<>tapani hyttinen:heikki tuuri<>remarks on strong nonstructure theorems<>ndjfl<>saharon shelah<>
30983<>2683_15<>heikki tuuri:jouko a. vaananen<>on the number of automorphisms of uncountable models<>jsyml<>saharon shelah<>
30999<>2683_31<>alain louveau:boban velickovic<>borel partitions of infinite subtrees of a perfect tree<>apal<>saharon shelah<>
31004<>2683_36<>martin goldstern:haim judah<>strong measure zero sets without cohen reals<>jsyml<>saharon shelah<>
31021<>2683_53<>rvszard frankiewicz:pawel zbierski<>on closed p-sets with ccc in the space omega<>jsyml<>saharon shelah<>
31023<>2683_55<>moti gitik<>more on simple forcing notions and forcings with ideals<>apal<>saharon shelah<>
31029<>2683_61<>michael c. laskowski<>on the existence of atomic models<>jsyml<>saharon shelah<>
31033<>2683_65<>john t. baldwin:michael c. laskowski<>forcing isomorphism<>jsyml<>saharon shelah<>
31074<>2683_106<>d. h. fremlin<>pointwise compact and stable sets of measurable functions<>jsyml<>saharon shelah<>
21280<>2703_11<>luc de raedt<>a theory of clausal discovery<>ijcai<>maurice bruynooghe<>
3070<>2708_5<>k. m. koh:y. h. peng<>on the higher-order edge toughness of a graph<>dm<>c. c. chen<>
13074<>2721_11<>roger duke<>class union and polymorphism<>tools<>jin song dong<>
13077<>2721_14<>roger duke<>an object-oriented approach to the formal specification of odp trader<>odp<>jin song dong<>
3073<>2722_0<>jianfang wang<>factors in graphs with odd-cycle property<>dm<>ciping chen<>
8884<>2734_0<>lila kari:alexandru mateescu:arto salomaa<>deletion sets<>fuin<>gheorghe paun<>
8890<>2734_6<>erzsubet csuhaj-varju<>limiting the team size in cooperating grammar systems<>eatcs<>gheorghe paun<>
8923<>2734_39<>arto salomaa<>closure properties of slender languages<>tcs<>gheorghe paun<>
8933<>2734_49<>erzsubet csuhaj-varju:jurgen dassow<>dynamically controlled cooperating/distributed grammar systems<>isci<>gheorghe paun<>
8943<>2734_59<>nulo<>on the synchronization in parallel communicating grammar systems<>acta<>gheorghe paun<>
8944<>2734_60<>erzsubet csuhaj-varju<>limiting the team size in cooperating grammar systems<>eatcs<>gheorghe paun<>
8947<>2734_63<>jurgen dassow:arto salomaa<>grammars based on patterns<>ijfcs<>gheorghe paun<>
8981<>2734_97<>rudolf freund<>one-dimensional matrix array grammars<>eik<>gheorghe paun<>
7256<>2746_0<>peter h. welch<>image tracking in real-time: a transputer emulation of some early mammalian vision processes<>ivc<>david c. wood<>
7157<>2750_4<>satish chandra:babak falsafi:mark d. hill:james r. larus:alvin r. lebeck:james c. lewis:shubhendu s. mukherjee:subbarao palacharla:steven k. reinhardt<>mechanisms for cooperative shared memory<>isca<>david a. wood<>
7163<>2750_10<>steven k. reinhardt:babak falsafi<>kernel support for the wisconsin wind tunnel<>mkern<>david a. wood<>
7178<>2750_25<>steven k. reinhardt:mark d. hill:james r. larus:alvin r. lebeck:james c. lewis<>the wisconsin wind tunnel: virtual prototyping of parallel computers<>sigmetrics<>david a. wood<>
31145<>2773_39<>andrew g. barto:roderic a. grupen:christopher i. connolly<>robust reinforcement learning in motion planning<>nips<>satinder p. singh<>
31174<>2773_68<>tommi jaakkola:michael i. jordan<>convergence of stochastic iterative dynamic programming algorithms<>nips<>satinder p. singh<>
3149<>2802_0<>yunghsiang s. han:carlos r. p. hartmann<>efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes<>tit<>chih-chieh chen<>
6173<>2855_1<>nulo<>simulation of information flow in organizations<>wsc<>douglas w. jones<>
4956<>2857_18<>michael w. berry:yuk-shing fung:jerry mclarty<>neural networks for molecular sequence classification<>ismb<>cathy h. wu<>
4934<>2859_5<>yarsun hsu:yew-huey liu<>a quantitative evaluation of cache types for high-performance computer systems<>tc<>ching-farn eric wu<>
4935<>2859_6<>yarsun hsu:yew-huey liu<>efficient stack simulation for shared memory set-associative multiprocessor caches<>icpp<>ching-farn eric wu<>
6186<>2862_2<>janet m. thornton<>protein fold recognition<>jcamd<>david jones<>
38104<>2869_32<>shin cha:in sang chung<>complexity measures for concurrent programs based on information-theoretic metrics<>ipl<>yong rae kwon<>
28058<>2871_9<>edward g. coffman jr.:david s. johnson:peter w. shor<>"markov chains, computer proofs, and average-case analysis of best fit bin packing."<>stoc<>richard r. weber<>
2022<>2876_1<>ko-wei lih<>a note on the m-bounded chromatic number of a tree<>ejc<>bor-liang chen<>
26219<>2902_4<>nulo<>introducing a new cache design into vector computers<>tc<>qing yang<>
26237<>2902_22<>nulo<>performance of cache memories for vector computers<>jpdc<>qing yang<>
26201<>2903_103<>eugene fink<>characterizing and automatically finding primary effects in planning<>ijcai<>qiang yang<>
960<>2948_2<>rajeev shorey<>performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system<>tpds<>anurag kumar<>
934<>2949_6<>arie segev<>cost and availability tradeoffs in replicated data concurrency control<>tods<>akhil kumar<>
957<>2949_28<>michael rabinovich:rakesh k. sinha<>a performance study of general grid structures for replicated data<>icdcs<>akhil kumar<>
4730<>3022_0<>david j. kriegman<>exploration strategies for mobile robots<>icra<>camillo j. taylor<>
30813<>3043_0<>doowon paik<>optimal folding of bit sliced stacks<>tcad<>sartaj sahni<>
19536<>3044_17<>david m. ogle:richard t. snodgrass<>application-dependent dynamic monitoring of distributed and parallel systems<>tpds<>karsten schwan<>
13553<>3047_27<>nulo<>"a critical reexamination of default logic, autoepistemic logic, and only knowing."<>kgc<>joseph y. halpern<>
13594<>3047_68<>vassos hadzilacos<>the failure discovery problem<>mst<>joseph y. halpern<>
13612<>3047_86<>nulo<>reasoning about only knowing with many agents<>aaai<>joseph y. halpern<>
13613<>3047_87<>vassos hadzilacos<>message-optimal protocols for byzantine agreement<>mst<>joseph y. halpern<>
13660<>3047_134<>fahiem bacchus:adam j. grove:daphne koller<>statistical foundations for default reasoning<>ijcai<>joseph y. halpern<>
13661<>3047_135<>mark r. tuttle<>"knowledge, probability, and adversaries."<>jacm<>joseph y. halpern<>
29380<>3060_3<>philip wadler<>imperative functional programming<>popl<>simon l. peyton jones<>
29399<>3060_22<>patrick m. sansom<>generational garbage collection for haskell<>fpca<>simon l. peyton jones<>
29402<>3060_25<>john hughes:john launchbury<>how to give a good research talk<>sigplan<>simon l. peyton jones<>
29426<>3060_49<>andrew j. gill:john launchbury<>a short cut to deforestation<>fpca<>simon l. peyton jones<>
1795<>3114_1<>david zuckerman<>expanders that beat the eigenvalue bound: explicit construction and applications<>stoc<>avi wigderson<>
34075<>3116_2<>kuo-hui tsai<>fast algorithms for the dominating set problem on permutation graphs<>algorithmica<>wen-lian hsu<>
8039<>3129_0<>asawaree kalavade<>a hardware-software codesign methodology for dsp applications<>dt<>edward a. lee<>
39118<>3214_0<>james a. reggia:hui-hsien chou:steven l. armentrout<>minimizing complexity in cellular automata models of self-replication<>ismb<>yun peng<>
39106<>3230_1<>c. c. chen:k. m. koh<>on the higher-order edge toughness of a graph<>dm<>y. h. peng<>
35698<>3366_2<>nulo<>some remarks on minimal bases and maximal nonbases of integers<>dm<>xing-de jia<>
8655<>3369_0<>richard h. schelp<>graphs with linearly bounded ramsey numbers<>jct<>guantao chen<>
8654<>3372_1<>chang-wu yu<>parallel algorithms for permutation graphs<>bit<>gen-huey chen<>
16241<>3396_9<>shutian lin<>arithmetic for parallel linear recursive query evaluation in deductive databases<>parle<>jerome robinson<>
1180<>3411_41<>nulo<>efficient distributed diagnosis in the presence of random faults<>ftcs<>andrzej pelc<>
1196<>3411_57<>douglas m. blough<>a clustered failure model for the memory array reconfiguration problem<>tc<>andrzej pelc<>
1201<>3411_62<>krzysztof diks<>fast diagnosis of multiprocessor systems with random faults<>ita<>andrzej pelc<>
1209<>3411_70<>pierre fraigniaud:claire kenyon<>finding a target subnetwork in sparse networks with random faults<>ipl<>andrzej pelc<>
1219<>3411_80<>bogdan s. chlebus:krzysztof diks<>sparse networks supporting efficient reliable broadcasting<>icalp<>andrzej pelc<>
1264<>3411_125<>douglas m. blough<>diagnosis and repair in multiprocessor systems<>tc<>andrzej pelc<>
1992<>3439_8<>nulo<>a better heuristic for preemptive parallel machine scheduling with batch setup times<>siamcomp<>bo chen<>
27393<>3440_0<>d. a. giuse:n. b. giuse<>consistency enforcement in medical knowledge base construction<>artmed<>r. a. miller<>
16712<>3449_26<>guozhu dong<>first-order incremental evaluation of datalog queries<>dbpl<>jianwen su<>
16730<>3449_44<>richard hull<>algebraic and calculus query languages for recursively typed complex objects<>jcss<>jianwen su<>
16742<>3449_56<>terence r. smith:divyakant agrawal:amr el abbadi<>database and modeling systems for the earth sciences<>debu<>jianwen su<>
16753<>3451_1<>nulo<>on locally k-critically n-connected graphs<>dm<>jianji su<>
16755<>3451_3<>nulo<>fragments in 2-critically -connected graphs<>jct<>jian ji su<>
1024<>3491_1<>nava pliskin:celia t. romm:y. weber<>presumed versus actual organizational culture: managerial implications for implementation of information systems<>cj<>a. s. lee<>
1025<>3491_2<>nulo<>electronic mail as a medium for rich communication: an empirical investigation using hermeneutic interpretation<>icis<>allen s. lee<>
26698<>3504_4<>william i. gasarch<>on bounded queries and approximation<>focs<>richard chang<>
26703<>3504_9<>richard beigel:mitsunori ogiwara<>a relationship between difference hierarchies and relativized polynomial hierarchies<>mst<>richard chang<>
18038<>3526_7<>li-yan yuan<>autoepistemic circumscription and logic programming<>jar<>jia-huai you<>
18078<>3526_47<>li-yan yuan<>knowledge base revision using circumscription<>dood<>jia-huai you<>
24182<>3565_0<>herbert de smet:anita de bruycker:andre van calster<>a 2-d boundary element method approach to the simulation of dmos transistors<>tcad<>ming-jiang zhou<>
12214<>3567_4<>nulo<>a macintosh hypercard compilation of small subunit ribosomal rna sequences<>bioinformatics<>j. w. brown<>
22409<>3590_9<>tao jiang<>k one-way heads cannot do string-matching<>stoc<>ming li<>
22440<>3590_40<>michael j. kearns<>learning in the presence of malicious errors<>siamcomp<>ming li<>
33756<>3608_6<>judy stephens<>on single-fault set diagnosability in the pmc model<>tc<>vijaj raghavan<>
33763<>3608_13<>nulo<>on asymmetric invalidation with partial tests<>tc<>vijay v. raghavan<>
33745<>3610_2<>peter bollmann-sdorra<>on the delusiveness of adopting a common space for modeling ir objects: are queries documents<>jasis<>vijay v. raghavan<>
16506<>3658_0<>douglas e. shackelford:f. donelson smith<>the architecture and implementation of a distributed hypermedia storage system<>ht<>john b. smith<>
32122<>3681_11<>jang-ping sheu:wen-hwa liaw<>a broadcasting algorithm in star graph interconnection networks<>ipl<>tzung-shi chen<>
33210<>3712_7<>yachyang sun:chak-kuen wong:c. l. liu<>routing for symmetric fpgas and fpics<>iccad<>ting-chi wang<>
8446<>3717_0<>ferng-ching lin<>on constructing multiple spanning trees in a hypercube<>ipl<>feng-hsu wang<>
8450<>3719_0<>jin yang:aloysius k. mok<>symbolic model checking for event-driven real-time systems<>rtss<>farn wang<>
8261<>3772_0<>andrea pietracaprina<>on o(sqrt(n))-worst-case-time solution to the granularity problem<>stacs<>franco p. preparata<>
8276<>3772_15<>nancy m. amato<>an nc parallel 3d convex hull algorithm<>compgeom<>franco p. preparata<>
8311<>3772_50<>yi-jen chiang:roberto tamassia<>"a unified approach to dynamic point location, ray shooting, and shortest paths in planar maps."<>soda<>franco p. preparata<>
8366<>3772_105<>jeffrey scott vitter<>a simplified technique for hidden-line elimination in terrains<>ijcga<>franco p. preparata<>
8373<>3772_112<>andrea pietracaprina<>a practical constructive scheme for deterministic shared-memory access<>spaa<>franco p. preparata<>
8380<>3772_119<>ravi janardan<>widest-corridor problems<>cccg<>franco p. preparata<>
32607<>3781_52<>masatoshi okutomi<>a multiple-baseline stereo<>pami<>takeo kanade<>
32638<>3781_83<>nulo<>from a real chair to a negative chair<>ai<>takeo kanade<>
2848<>3783_6<>yongcheng li:xiuwen liu<>a robust motion planner for assembly robots<>icra<>bo zhang<>
13346<>3809_2<>alain kerbrat:laurent mounier<>symbolic equivalence checking<>cav<>jean-claude fernandez<>
36633<>3822_2<>vaithilingam jeyakumar<>convex composite multi-objective nonsmooth programming<>mp<>xiaoqi yang<>
13270<>3833_2<>nulo<>a temporal model theory for default logic<>ecsqaru<>joeri engelfriet<>
1421<>3852_0<>kenneth y. goldberg<>placing registration marks<>icra<>anil s. rao<>
4251<>3868_0<>wei kuan shih:jane w.-s. liu<>modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines<>tse<>c. l. liu<>
27564<>3877_13<>tarun arora:william g. roth:praveen seshadri:divesh srivastava<>explaining program execution in deductive systems<>lpe<>raghu ramakrishnan<>
27565<>3877_14<>tarun arora:william g. roth:praveen seshadri:divesh srivastava<>explaining program execution in deductive systems<>dood<>raghu ramakrishnan<>
6128<>3884_3<>ronald e. anderson:donald gotterbarn:judith perolle<>using the new acm code of ethics in decision making<>cacm<>deborah g. johnson<>
6074<>3890_11<>michael l. fredman:lyle a. mcgeoch:g. ostheimer<>data structures for traveling salesmen<>soda<>david s. johnson<>
6093<>3890_30<>edward g. coffman jr.:peter w. shor:richard r. weber<>"markov chains, computer proofs, and average-case analysis of best fit bin packing."<>stoc<>david s. johnson<>
38188<>3903_1<>sang hun oh:myoung-ho kim<>qualitative behavior modeling of information processing components<>dasfaa<>yoon-joon lee<>
38193<>3903_6<>joon ho lee:won yong kim:myoung-ho kim<>enhancing the fuzzy set model with positively compensatory operators<>dasfaa<>yoon-joon lee<>
38199<>3903_12<>myoung-ho kim:joon ho lee<>analysis of fuzzy operators for high quality information retrieval<>ipl<>yoon-joon lee<>
22573<>3929_2<>yali amit<>large deviations for coding markov chains and gibbs random fields<>tit<>michael i. miller<>
35751<>3970_8<>fuji zhang:heping zhang<>hexagonal systems with fixed bonds<>dam<>xueliang li<>
35782<>3970_39<>hajo broersma<>"on ""the matching polynomial of a polygraph""."<>dam<>xueliang li<>
14257<>3996_2<>nulo<>identifying redundancy in source code using fingerprints<>cascon<>j. howard johnson<>
33101<>4000_0<>ian p. gent<>towards an understanding of hill-climbing procedures for sat<>aaai<>toby walsh<>
33111<>4000_10<>fausto giunchiglia<>the inevitability of inconsistent abstract spaces<>jar<>toby walsh<>
33145<>4000_44<>nulo<>general purpose proof plans<>disco<>toby walsh<>
33154<>4000_53<>ian p. gent<>an empirical analysis of search in gsat<>jair<>toby walsh<>
33165<>4000_64<>david a. basin<>difference unification<>ijcai<>toby walsh<>
33183<>4000_82<>ian p. gent<>an empirical analysis of search in gsat<>corr<>toby walsh<>
33097<>4001_4<>robert w. robinson<>inversion of cycle index sum relations for 2- and 3-connected graphs<>jct<>t. r. s. walsh<>
28839<>4004_3<>paul e. reimers<>automatic logical navigation for relational databases<>sac<>soon myoung chung<>
28842<>4004_6<>paul e. reimers<>intelligent user interface for very large relational databases<>hci<>soon myoung chung<>
28843<>4004_7<>moez chaabouni<>the point-range tree: a data structure for indexing intervals<>acm<>soon myoung chung<>
30764<>4042_1<>khushro shahookar:w. khamisani:pinaki mazumder<>genetic beam search for gate matrix layout<>vlsid<>sudhakar m. reddy<>
23278<>4085_11<>ralf hartmut guting<>realms: a foundation for spatial data types in database systems<>ssd<>markus schneider<>
21691<>4104_30<>mikhail j. atallah:mark h. overmars<>output-sensitive methods for rectilinear hidden surface removal<>iandc<>michael t. goodrich<>
21692<>4104_31<>roberto tamassia<>dynamic ray shooting and shortest paths via balanced geodesic triangulations<>compgeom<>michael t. goodrich<>
21712<>4104_51<>mark h. nodine:jeffrey scott vitter<>blocking for external graph searching<>pods<>michael t. goodrich<>
21713<>4104_52<>l. paul chew:daniel p. huttenlocher:klara kedem:jon m. kleinberg:dina kravets<>geometric pattern matching under euclidean motion<>cccg<>michael t. goodrich<>
27037<>4105_26<>nulo<>mapping the genome: some combinatorial problems arising in molecular biology<>stoc<>richard m. karp<>
27038<>4105_27<>david e. culler:david a. patterson:abhijit sahay:klaus e. schauser:eunice e. santos:ramesh subramonian:thorsten von eicken<>logp: towards a realistic model of parallel computation<>ppopp<>richard m. karp<>
27070<>4105_59<>farid alizadeh:lee aaron newberg:deborah k. weisser<>physical mapping of chromosomes: a combinatorial problem in molecular biology<>soda<>richard m. karp<>
27080<>4105_69<>nulo<>a generalization of binary search<>wads<>richard m. karp<>
27115<>4105_104<>ran el-yaniv<>the mortgage problem<>istcs<>richard m. karp<>
27126<>4105_115<>narendra karmarkar:richard j. lipton:laszla lovasz:michael luby<>a monte-carlo algorithm for estimating the permanent<>siamcomp<>richard m. karp<>
27131<>4105_120<>abhijit sahay:eunice e. santos:klaus e. schauser<>optimal broadcast and summation in the logp model<>spaa<>richard m. karp<>
35499<>4112_8<>nulo<>on finding the rectangular duals of planar triangular graphs<>siamcomp<>xin he<>
33571<>4122_21<>w. stamps howard<>a minimum principle for the dynamic analysis of systems with frictional contacts<>icra<>vijay kumar<>
33577<>4122_27<>chau-chang wang<>velocity control of mobile manipulators<>icra<>vijay kumar<>
33578<>4122_28<>nilanjan sarkar:xiaoping yun<>dynamic control of 3-d rolling contacts in two-arm manipulation<>icra<>vijay kumar<>
34967<>4130_0<>mao-jiun j. wang<>elliptical object detection by using its geometric properties<>pr<>wen-yen wu<>
34973<>4130_6<>mao-jiun j. wang<>detecting the dominant points by the curvature-based polygonal approximation<>cvgip<>wen-yen wu<>
30471<>4146_0<>david a. wood:satish chandra:babak falsafi:mark d. hill:james r. larus:alvin r. lebeck:james c. lewis:subbarao palacharla:steven k. reinhardt<>mechanisms for cooperative shared memory<>isca<>shubhendu s. mukherjee<>
11210<>4175_1<>kitae hwang<>new disk scheduling algorithms for reduced rotational latency<>dasfaa<>heonshik shin<>
6639<>4190_6<>david e. culler:richard m. karp:abhijit sahay:klaus e. schauser:eunice e. santos:ramesh subramonian:thorsten von eicken<>logp: towards a realistic model of parallel computation<>ppopp<>david a. patterson<>
3206<>4198_1<>mee yee chan:f. chin:w. k. mak<>dilation-5 embedding of 3-dimensional grids into hypercubes<>spdp<>c. n. chu<>
27640<>4222_22<>hans jurgen ohlbach<>editorial: the possibility of generating true conjectures<>logcom<>renate a. schmidt<>
30378<>4241_68<>nulo<>analysis of cyclic combinational circuits<>iccad<>sharad malik<>
38766<>4245_1<>feng ming dong<>counting rooted near-triangulations on the sphere<>dm<>yanpei liu<>
16613<>4270_3<>david d. clark:bruce s. davie:david j. farber:inder s. gopal:bharath k. kadaba:w. david sincoskie:david l. tennenhouse<>the aurora gigabit testbed<>cn<>jonathan m. smith<>
22637<>4280_0<>nimrod megiddo:david p. anderson<>the minimum reservation rate problem in digital audio/video systems<>istcs<>moni naor<>
22659<>4280_22<>amos fiat<>implicit o(1) probe search<>siamcomp<>moni naor<>
22670<>4280_33<>joseph naor<>small-bias probability spaces: efficient constructions and applications<>siamcomp<>moni naor<>
22671<>4280_34<>larry j. stockmeyer<>what can be computed locally?<>stoc<>moni naor<>
22699<>4280_62<>amos fiat<>broadcast encryption<>crypto<>moni naor<>
22731<>4280_94<>david feldman:russell impagliazzo:noam nisan:steven rudich:adi shamir<>on dice and coins: models of computation for random generation<>iandc<>moni naor<>
38063<>4288_0<>nulo<>a new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops<>cor<>yeong-dae kim<>
20860<>4301_30<>alan l. yuille:stelios m. smirnakis<>bayesian self-organization<>nips<>lei xu<>
202<>4302_2<>ravi ponnusamy:joel h. saltz<>runtime compilation techniques for data partitioning and communication schedule reuse<>sc<>alok n. choudhary<>
211<>4302_11<>ravi ponnusamy:rajeev thakur:kishore velamakanni:zeki bozkus:geoffrey fox<>experimental performance evaluation of the cm-5<>jpdc<>alok n. choudhary<>
212<>4302_12<>ravi ponnusamy:nashat mansour:geoffrey fox<>mapping realistic data sets on parallel computers<>ipps<>alok n. choudhary<>
236<>4302_36<>nulo<>parallel i/o systems - guest editor's introduction<>jpdc<>alok n. choudhary<>
242<>4302_42<>charles koelbel:mary zosel<>high performance fortran: implementor and users workshop<>sc<>alok n. choudhary<>
248<>4302_48<>bhagirath narahari:ramesh krishnamurti<>an efficient heuristic scheme for dynamic remapping of parallel computations<>pc<>alok n. choudhary<>
252<>4302_52<>rajesh bordawekar:juan miguel del rosario<>design and evaluation of primitives for parallel i/o<>sc<>alok n. choudhary<>
254<>4302_54<>zeki bozkus:geoffrey fox:tomasz haupt:sanjay ranka<>a compilation approach for fortran 90d/ hpf compilers<>lcpc<>alok n. choudhary<>
287<>4302_87<>geoffrey fox:seema hiranandani:ken kennedy:charles koelbel:sanjay ranka:chau-wen tseng<>unified compilation of fortran 77d and 90d<>loplas<>alok n. choudhary<>
291<>4302_91<>edward b. suh:b. k. lee:robert l. martino:bhagirath narahari<>parallel computation of solvent accessible surface area of protein molecules<>ipps<>alok n. choudhary<>
294<>4302_94<>zeki bozkus:geoffrey fox:tomasz haupt:sanjay ranka<>compiling distribution directives in a fortran 90d compiler<>spdp<>alok n. choudhary<>
297<>4302_97<>rajesh bordawekar:juan miguel del rosario<>an experimental performance evaluation of touchstone delta concurrent file system<>ics<>alok n. choudhary<>
322<>4302_122<>zeki bozkus:sanjay ranka:geoffrey fox<>performance comparison of the cm-5 and intel touchstone delta for data parallel operations<>spdp<>alok n. choudhary<>
335<>4302_135<>nashat mansour:ravi ponnusamy:geoffrey fox<>graph contraction for physical optimization methods: a quality-cost tradeoff for mapping data on parallel computers<>ics<>alok n. choudhary<>
352<>4302_152<>q. wang song:salim hariri<>design and analysis of an optical communications processor<>jpdc<>alok n. choudhary<>
20471<>4309_27<>nulo<>an object-centered approach for manipulating hierarchically complex objects<>isotas<>ling liu<>
25647<>4323_1<>nulo<>belief revision in probability theory<>uai<>pei wang<>
25631<>4324_2<>amar gupta:m. v. nagendraprasad:a. liu:s. ayyadurai<>an integrated architecture for recognition of totally unconstrained handwritten numerals<>ijprai<>patrick shen-pei wang<>
25641<>4324_12<>nulo<>parallel object representation and recognition<>ppl<>p. s. p. wang<>
25644<>4324_15<>akila arumugam:thiruvengadam radhakrishnan:ching y. suen<>a thinning algorithm based on the force between charged particles<>ijprai<>patrick shen-pei wang<>
9240<>4388_3<>klaus jansen<>the complexity of detecting crossingfree configurations in the plane<>bit<>gerhard j. woeginger<>
20232<>4457_2<>pinhong chen:jyuo-min shyu<>hardware verification using symbolic state transition graphs<>iccd<>liang-gee chen<>
28892<>4494_2<>nulo<>an alternative solution to a problem on self-stabilization<>toplas<>sukumar ghosh<>
28895<>4494_5<>mehmet hakan karaata<>a self-stabilizing algorithm for coloring planar graphs<>dc<>sukumar ghosh<>
28898<>4494_8<>ajay gupta:steven c. bruell<>mutual exclusion on a hypercube<>jpdc<>sukumar ghosh<>
21965<>4518_7<>john peterson<>implementing type classes<>pldi<>mark p. jones<>
21973<>4520_2<>joe nandhakumar<>structured development? a structurational analysis of the development of an executive information system<>ifip8-2<>matthew jones<>
21940<>4522_6<>nulo<>adaptive real-time resource management supporting composition of independently authored time-critical services<>hotos<>michael b. jones<>
12547<>4562_11<>nulo<>the logic of only knowing as a unified framework for non-monotonic reasoning<>ismis<>jianhua chen<>
27301<>4565_2<>von-wun soo<>parsing-driven generalization for natural language acquisition<>ijprai<>rey-long liu<>
11002<>4566_25<>kikuo fujimura<>planning a time-minimal motion among moving obstacles<>algorithmica<>hanan samet<>
11003<>4566_26<>erik g. hoel<>data-parallel r-tree algorithms<>icpp<>hanan samet<>
11054<>4566_77<>walid g. aref<>decomposing a window into maximal quadtree blocks<>acta<>hanan samet<>
11106<>4566_129<>walid g. aref<>estimating selectivity factors of spatial operations<>fmldo<>hanan samet<>
12623<>4572_0<>john staples<>defining soft sortedness by abstract interpretation<>mfcs<>jian chen<>
7268<>4585_10<>nulo<>estimating probability distributions over hypotheses with variable unification<>aaai<>dekai wu<>
34158<>4616_1<>nulo<>chair's message<>sigmod<>won kim<>
34159<>4616_2<>nulo<>chair's message<>sigmod<>won kim<>
34165<>4616_8<>nulo<>chair's message<>sigmod<>won kim<>
11318<>4654_6<>yasuo hidaka:hanpei koike<>multiple threads in cyclic register windows<>isca<>hidehiko tanaka<>
2591<>4669_0<>ketan patel:lawrence a. rowe<>performance of a software mpeg video decoder<>mm<>brian c. smith<>
7103<>4670_0<>will e. leland:murad s. taqqu:walter willinger<>on the self-similar nature of ethernet traffic<>sigcomm<>daniel v. wilson<>
36355<>4671_8<>weifa liang<>a parallel algorithm for multiple edge updates of minimum spanning trees<>ipps<>xiaojun shen<>
36358<>4671_11<>qing hu:bin cong:ivan hal sudborough:mike girou:said bettayeb<>the 4-star graph is not a subgraph of any hypercube<>ipl<>xiaojun shen<>
36367<>4671_20<>weifa liang:qing hu<>embedding between 2-d meshes of the same size<>spdp<>xiaojun shen<>
2579<>4678_2<>william h. smith jr.<>uncovering cognitive processes in music composition: educational and computational approaches<>aied<>brian k. smith<>
33406<>4686_0<>soumitra bose:prathima agrawal<>generation of compact delay tests by multiple-path activation<>itc<>vishwani d. agrawal<>
17521<>4701_5<>muruganandan kumar<>transaction management in design databases<>jss<>johnny wong<>
25299<>4710_4<>john-david wellman<>mips-driven early design and analysis of vlsi cpu chips<>vlsid<>pradip bose<>
25312<>4712_0<>shankar a. rajamoney<>compositional model-based design<>ijcai<>prasanta k. bose<>
17478<>4714_11<>v. j. friesen<>"the effect of multiplexing, switching and other factors on the performance of broadband networks."<>infocom<>j. w. wong<>
25217<>4720_30<>leonidas j. guibas:anna lubiw:mark h. overmars:diane l. souvaine:jorge urrutia<>the floodlight problem<>cccg<>prosenjit bose<>
25219<>4720_32<>jonathan f. buss:anna lubiw<>pattern matching for permutations<>wads<>prosenjit bose<>
25267<>4720_80<>marc j. van kreveld:godfried t. toussaint<>filling polyhedral molds<>wads<>prosenjit bose<>
31403<>4731_1<>richard furuta<>the virtual panel architecture: a 3d gesture framework<>vr<>s. augustine su<>
17452<>4760_10<>athanassios n. avramidis<>integrated variance reduction strategies<>wsc<>james r. wilson<>
6905<>4786_7<>edmund ihler:frank wagner<>modeling hypergraphs by graphs with the same mincut properties<>ipl<>dorothea wagner<>
6908<>4786_10<>karsten weihe<>a linear-time algorithm for edge-disjoint paths in planar graphs<>esa<>dorothea wagner<>
6912<>4786_14<>heike ripphausen-lipa:karsten weihe<>linear time algorithms for disjoint two-face paths problems in planar graphs<>isaac<>dorothea wagner<>
6932<>4786_34<>michael formann:frank wagner<>routing through a dense channel with minimum total wire length<>jal<>dorothea wagner<>
6937<>4786_39<>heike ripphausen-lipa:karsten weihe<>the vertex-disjoint menger problem in planar graphs<>soda<>dorothea wagner<>
6952<>4789_0<>collette r. coullard:l. leslie gardner<>decomposition of 3-connected graphs<>combinatorica<>donald k. wagner<>
11230<>4796_1<>marcus j. grote<>parallel preconditioning and approximate inverses on the connection machine<>ppsc<>horst d. simon<>
11234<>4796_5<>stephen t. barnard<>a fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems<>ppsc<>horst d. simon<>
11244<>4796_15<>alan h. karp:ken miura<>1992 gordon bell prize winners<>computer<>horst d. simon<>
11249<>4798_2<>yumi iwasaki<>"retrospective on ""causality in device behavior""."<>ai<>herbert a. simon<>
11267<>4800_10<>rael e. valdes-perez:jan m. zytkow<>scientific model-building as search in matrix spaces<>aaai<>herbert a. simon<>
11271<>4800_14<>marek j. druzdzel<>causality in bayesian belief networks<>uai<>herbert a. simon<>
11279<>4802_3<>alonso h. vera<>situated action: a symbolic interpretation<>cogsci<>herbert a. simon<>
15112<>4806_0<>wei kuan shih:c. l. liu<>modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines<>tse<>jane w.-s. liu<>
38407<>4850_2<>chongkye rhee<>finding a maximum matching in a circular-arc graph<>ipl<>y. daniel liang<>
2945<>4855_1<>jian-xiong wu<>isolated word recognition by neural network models with cross-correlation coefficients for speech dynamics<>pami<>chorkin chan<>
10150<>4874_8<>mark e. watkins<>finite separating sets in locally finite graphs<>jct<>heinz adolf jung<>
15090<>4919_1<>vikram a. saletore<>self-scheduling on distributed-memory machines<>sc<>jie liu<>
31688<>4927_0<>david stuart robertson:john lee<>kics: a knowledge-intensive case-based reasoning system for statutory building regulations and case histories<>icail<>soon-ae yang<>
15087<>4933_0<>katia p. sycara<>emergent constraint satisfaction through multi-agent coordinated interaction<>maamaw<>jyi-shane liu<>
11177<>4942_26<>nulo<>a high performance interconnection network for multiprocessor systems<>pc<>hong shen<>
33050<>4987_1<>hitoshi iba:tetsuya higuchi:hugo de garis<>evolutionary learning strategy using bug-based search<>ijcai<>taisuke sato<>
33052<>4987_3<>hitoshi iba:takio kurita:hugo de garis<>system identification using structured genetic algorithms<>icga<>taisuke sato<>
35099<>5018_29<>richard e. korf<>depth-first vs. best-first search: new results<>aaai<>weixiong zhang<>
13897<>5026_62<>michael stonebraker<>predicate migration: optimizing queries with expensive predicates<>sigmod<>joseph m. hellerstein<>
24935<>5073_5<>tao jiang:nicholas q. tran:hui wang<>new decidability results concerning two-way counter machines and applications<>icalp<>oscar h. ibarra<>
24948<>5073_18<>nicholas q. tran<>on the communication complexity of parallel computation<>mfcs<>oscar h. ibarra<>
24962<>5073_32<>qi zheng<>finding articulation points and bridges of permutation graphs<>icpp<>oscar h. ibarra<>
24979<>5073_49<>nicholas q. tran<>a note on simple programs with two variables<>tcs<>oscar h. ibarra<>
24989<>5073_59<>tao jiang:nicholas q. tran:hui wang<>on the equivalence of two-way pushdown automata and counter machines over bounded languages<>ijfcs<>oscar h. ibarra<>
25002<>5073_72<>m. h. kim<>quadtree building algorithms on an simd hypercube<>jpdc<>oscar h. ibarra<>
25031<>5073_101<>tao jiang:nicholas q. tran:hui wang<>on the equivalence of two-way pushdown automata and counter machines over bounded languages<>stacs<>oscar h. ibarra<>
25041<>5073_111<>hui wang:tao jiang<>on efficient parallel algorithms for solving set recurrence equations<>jal<>oscar h. ibarra<>
24212<>5078_20<>raphael yuster<>threshold functions for h-factors<>cpc<>noga alon<>
24254<>5078_62<>yair caro:ilia krasikov<>bisection of trees and sequences<>dm<>noga alon<>
32215<>5081_25<>rajeev alur<>real-time logics: complexity and expressiveness<>iandc<>thomas a. henzinger<>
32249<>5081_59<>rajeev alur:pei-hsin ho<>automatic symbolic verification of embedded systems<>rtss<>thomas a. henzinger<>
32289<>5081_99<>rajeev alur:costas courcoubetis<>computing accumulated delays in real-time systems<>cav<>thomas a. henzinger<>
32290<>5081_100<>rajeev alur:moshe y. vardi<>parametric real-time reasoning<>stoc<>thomas a. henzinger<>
35183<>5082_5<>sanjay kamat:nicholas malcolm<>performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an fddi network<>rtss<>wei zhao<>
35185<>5082_7<>gopal agrawal:biao chen<>local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol<>infocom<>wei zhao<>
35201<>5082_23<>sanjay kamat<>real-time schedulability of two token ring protocols<>icdcs<>wei zhao<>
3001<>5094_10<>xin shu:gene chan:mikio aoyama<>an object-oriented real-time distributed simulation of cellular phone switching system<>iscas<>carl k. chang<>
9425<>5105_1<>william c. rounds<>constraints in nonmonotonic reasoning<>ppcp<>guo-qiang zhang<>
9435<>5105_11<>nulo<>some monoidal closed categories of stable domains and event structures<>mscs<>guo-qiang zhang<>
9447<>5105_23<>nulo<>universal quasi-prime algebraic domains<>mfps<>guo-qiang zhang<>
9454<>5108_0<>walter d. wallis:joseph l. yucas<>single change covering designs<>dcc<>g.-h. zhang<>
9455<>5108_1<>w. d. wallis<>on the partition and coloring of a graph by cliques<>dm<>guo-hui zhang<>
22350<>5148_29<>tiziana catarci<>interschema knowledge in cooperative information systems<>coopis<>maurizio lenzerini<>
22355<>5148_34<>giuseppe di battista<>deductive entity-relationship modeling<>tkde<>maurizio lenzerini<>
22358<>5148_37<>tiziana catarci<>representing and using interschema knowledge in cooperative information systems<>ijcis<>maurizio lenzerini<>
21573<>5157_4<>tienyo pan<>clocked and asynchronous instruction pipelines<>micro<>mark a. franklin<>
21581<>5157_12<>roger d. chamberlain<>performance effects of synchronization in parallel processors<>spdp<>mark a. franklin<>
21595<>5157_26<>kenneth f. wong<>distributed computing systems and checkpointing<>hpdc<>mark a. franklin<>
21603<>5163_0<>michael j. carey:miron livny<>local disk caching for client-server database systems<>vldb<>michael j. franklin<>
3438<>5193_1<>nulo<>fractal dimensions for percolation and phase transition models: theory and new monte carlo calculation method<>fractals<>chin-kun hu<>
3433<>5195_2<>robert h. tu:elyse rosenbaum:wilson y. chan:chester c. li:eric minami:khandker quader:ping k. ko<>berkeley reliability tools-bert<>tcad<>chenming hu<>
6454<>5207_2<>nulo<>principle-based parsing without overgeneration<>acl<>dekang lin<>
4549<>5220_30<>s. k. k. loh<>efficient edge detection using hierarchical structures<>pr<>chew lim tan<>
4550<>5220_31<>tong seng quah:hoon heng teh<>a connectionist shell for developing expert decision support systems<>ictai<>chew lim tan<>
6473<>5259_2<>anthony n. michel<>analysis and synthesis of a class of neural networks with sparse interconnections<>iscas<>derong liu<>
28770<>5284_2<>kevin bolding:sung-eun choi:carl ebeling:soha hassoun:ton anh ngo:robert wille<>the chaos router chip: design and implementation of an adaptive router<>vlsi<>sen-ching cheung<>
28760<>5286_6<>francis c. m. lau<>a lower bound for permutation routing on two-dimensional bused meshes<>ipl<>steven cheung<>
28764<>5286_10<>francis c. m. lau<>time lower bounds for permutation routing on multi-dimensional bused meshes<>ppl<>steven cheung<>
28714<>5288_4<>jeff kramer<>enhancing compositional reachability analysis with context constraints<>sigsoft<>shing-chi cheung<>
28728<>5288_18<>jeff kramer<>tractable flow analysis for anomaly detection in distributed programs<>esec<>shing-chi cheung<>
40684<>5293_1<>david eppstein:giuseppe f. italiano:thomas h. spencer<>separator based sparsification for dynamic planar graph algorithms<>stoc<>zvi galil<>
15683<>5326_13<>esther m. arkin:michael t. goodrich:david m. mount:christine d. piatko:steven skiena<>point probe decision trees for geometric concept classes<>wads<>joseph s. b. mitchell<>
15738<>5326_68<>esther m. arkin:samir khuller<>geometric knapsack problems<>algorithmica<>joseph s. b. mitchell<>
15742<>5326_72<>esther m. arkin:henk meijer:david rappaport:steven skiena<>decision trees for geometric models<>compgeom<>joseph s. b. mitchell<>
15744<>5326_74<>leonidas j. guibas:john hershberger:jack snoeyink<>approximating polygons and subdivisions with minimum link paths<>ijcga<>joseph s. b. mitchell<>
15610<>5327_25<>my hoang:ramesh viswanathan<>standard ml-nj weak polymorphism and imperative constructs<>lics<>john c. mitchell<>
15646<>5327_61<>nulo<>on abstraction and the expressive power of programming languages<>scp<>john c. mitchell<>
15665<>5327_80<>furio honsell:kathleen fisher<>a lambda calculus of objects and method specialization<>lics<>john c. mitchell<>
15667<>5327_82<>lalita jategaonkar<>type inference with extended pattern matching and subtypes<>fuin<>john c. mitchell<>
37236<>5338_1<>michael s. jacobson:clyde l. monma:douglas b. west<>subtree and substar intersection numbers<>dam<>yi-wu chang<>
26444<>5357_49<>thomas a. henzinger:moshe y. vardi<>parametric real-time reasoning<>stoc<>rajeev alur<>
26450<>5357_55<>costas courcoubetis:thomas a. henzinger<>computing accumulated delays in real-time systems<>cav<>rajeev alur<>
26453<>5357_58<>thomas a. henzinger<>real-time logics: complexity and expressiveness<>iandc<>rajeev alur<>
26494<>5357_99<>thomas a. henzinger:pei-hsin ho<>automatic symbolic verification of embedded systems<>rtss<>rajeev alur<>
26504<>5357_109<>costas courcoubetis:david l. dill<>model-checking in dense real-time<>iandc<>rajeev alur<>
24660<>5359_38<>soma chaudhuri:rainer gawlick<>designing algorithms for distributed systems with partially synchronized clocks<>podc<>nancy a. lynch<>
24672<>5359_50<>butler w. lampson:jorgen f. sogaard-andersen<>correctness of at-most-once message delivery protocols<>forte<>nancy a. lynch<>
24699<>5359_77<>james e. burns<>bounds on shared memory for mutual exclusion<>iandc<>nancy a. lynch<>
24709<>5359_87<>jorgen f. sogaard-andersen:stephen j. garland:john v. guttag:anna pogosyants<>computer-assisted simulation proofs<>cav<>nancy a. lynch<>
24732<>5359_110<>alan fekete:yishay mansour:john spinelli<>the impossibility of implementing reliable communication in the face of crashes<>jacm<>nancy a. lynch<>
24735<>5359_113<>soma chaudhuri:maurice herlihy:mark r. tuttle<>a tight lower bound for k-set agreement<>focs<>nancy a. lynch<>
24742<>5359_120<>nulo<>simulation techniques for proving properties of real-time systems<>rex<>nancy a. lynch<>
24769<>5359_147<>jennifer l. welch<>a modular drinking philosophers algorithm<>dc<>nancy a. lynch<>
15210<>5361_3<>monica d. barback:lawrence j. henschen<>interpreting disjunctive logic programs based on a strong sense of disjunction<>jar<>james j. lu<>
15162<>5368_1<>jiafu xu<>analogical program derivation based on type theory<>tcs<>jianguo lu<>
14146<>5376_6<>robert c. zeleznik:kenneth p. herndon:daniel c. robbins:nate huang:tom meyer:noah parker<>an interactive 3d toolkit for constructing 3d widgets<>siggraph<>john f. hughes<>
14172<>5376_32<>stefan gottschalk<>autocalibration for virtual environments tracking hardware<>siggraph<>john f. hughes<>
14184<>5386_3<>simon l. peyton jones:john launchbury<>how to give a good research talk<>sigplan<>john hughes<>
14188<>5386_7<>alex ferguson<>fast abstract interpretation using sequential algorithms<>sas<>john hughes<>
14235<>5390_3<>chuen-tsai sun<>using genetic algorithms in structuring a fuzzy rulebase<>icga<>jyh-shing roger jang<>
26539<>5424_17<>nulo<>why cryptosystems fail<>ccs<>ross j. anderson<>
37202<>5431_1<>laxmi n. bhuyan<>parallel algorithms for hypercube allocation<>ipps<>yeimkuan chang<>
37206<>5431_5<>laxmi n. bhuyan<>fault tolerant subcube allocation in hypercubes<>icpp<>yeimkuan chang<>
10911<>5445_1<>l. magnus ewerbring<>an algorithm for the generalized singular value decomposition on massively parallel computers<>jpdc<>haesun park<>
4057<>5451_18<>lawrence snyder<>zpl: an array sublanguage<>lcpc<>calvin lin<>
4063<>5451_24<>w. d. weathersby<>towards a machine-independent solution of sparse cholesky factorization<>parco<>c. lin<>
4068<>5452_2<>soo-chang pei:chien-cheng tseng<>two-dimensional lms adaptive linear phase filters<>iscas<>ching-yung lin<>
15413<>5453_9<>sergio montagna:roberto paglino<>dimensioning of an atm switch with shared buffer and threshold priority<>cn<>john f. meyer<>
15471<>5456_45<>roel wieringa<>"actors, actions, and initiative in normative system specification."<>amai<>john-jules ch. meyer<>
7477<>5470_17<>vijayalakshmi atluri:sushil jajodia<>achieving stricter correctness requirements in multilevel secure database management systems<>jcs<>elisa bertino<>
7509<>5470_49<>c. guglielmina<>path-index: an approach to the efficient execution of object-oriented queries<>dke<>elisa bertino<>
40914<>5479_1<>nulo<>three-valued nonmonotonic logic<>ismvl<>zuoquan lin<>
16902<>5509_15<>ellen isaacs<>what video can and can't do for collaboration: a case study<>mm<>john c. tang<>
29019<>5557_11<>dana s. nau:guangming zhang<>concurrent evaluation of machinability during product design<>computer<>satyandra k. gupta<>
29020<>5557_12<>dana s. nau<>generation of alternative feature-based models and precedence orderings for machining applications<>sma<>satyandra k. gupta<>
28981<>5558_8<>rajagopalan srinivasan:melvin a. breuer<>an efficient partitioning strategy for pseudo-exhaustive testing<>dac<>sandeep k. gupta<>
28996<>5558_23<>rajagopalan srinivasan:melvin a. breuer<>novel test pattern generators for pseudo-exhaustive testing<>itc<>sandeep k. gupta<>
8565<>5565_3<>paul erdos:cecil c. rousseau:richard h. schelp<>ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs<>ejc<>guantao chen<>
8574<>5565_12<>p. bedrossian:richard h. schelp<>"a generalization of fan's condition for hamiltonicity, pancyclicity, and hamiltonian connectedness."<>dm<>g. chen<>
8584<>5565_22<>richard h. schelp<>ramsey problems with bounded degree spread<>cpc<>guantao chen<>
8618<>5573_4<>yung-chen hung<>on the quickest path problem<>ipl<>gen-huey chen<>
37012<>5638_33<>shin-ichi nakano:takao nishizeki<>a linear algorithm for edge-coloring partial k-trees<>esa<>xiao zhou<>
8666<>5648_9<>zeki bozkus:alok n. choudhary:tomasz haupt:sanjay ranka<>a compilation approach for fortran 90d/ hpf compilers<>lcpc<>geoffrey fox<>
8667<>5648_10<>kenneth rose:eitan gurewitz<>constrained clustering as an optimization method<>pami<>geoffrey fox<>
8669<>5648_12<>chris faigle:wojtek furmanski:janusz niemiec:diglio a. simoni<>integrating virtual environments with high performance computing<>vr<>geoffrey fox<>
8671<>5648_14<>gang cheng:kim mills<>an interactive visualization environment for financial modeling on heterogeneous computing systems<>ppsc<>geoffrey fox<>
8672<>5648_15<>taitin chen:jim feeney:gideon frieder:sanjay ranka:bill wilhelm:fang-kuo yu<>a low-latency programming interface and a prototype switch for scalable high-performance distributed computing<>hpdc<>geoffrey fox<>
8673<>5648_16<>ravi ponnusamy:nashat mansour:alok n. choudhary<>mapping realistic data sets on parallel computers<>ipps<>geoffrey fox<>
8674<>5648_17<>alok n. choudhary:seema hiranandani:ken kennedy:charles koelbel:sanjay ranka:chau-wen tseng<>unified compilation of fortran 77d and 90d<>loplas<>geoffrey fox<>
8675<>5648_18<>nawal copty:sanjay ranka:ravi v. shankar<>solving the region growing problem on the connection machine<>icpp<>geoffrey fox<>
8691<>5648_34<>ravi ponnusamy:rajeev thakur:alok n. choudhary:kishore velamakanni:zeki bozkus<>experimental performance evaluation of the cm-5<>jpdc<>geoffrey fox<>
8695<>5648_38<>salim hariri:jong park:fang-kuo yu:manish parashar<>a message passing interface for parallel and distributed computing<>hpdc<>geoffrey fox<>
27462<>5672_40<>steven j. phillips:eric torng<>non-clairvoyant scheduling<>soda<>rajeev motwani<>
17244<>5703_2<>ciping chen<>factors in graphs with odd-cycle property<>dm<>jianfang wang<>
37199<>5717_0<>sid l. huff<>investigating information systems strategic alignment<>icis<>yolande e. chan<>
28529<>5729_0<>nulo<>more choices allow more faults: set consensus problems in totally asynchronous systems<>iandc<>soma chaudhuri<>
28530<>5729_1<>rainer gawlick:nancy a. lynch<>designing algorithms for distributed systems with partially synchronized clocks<>podc<>soma chaudhuri<>
24089<>5753_4<>limin fu:raul braylan:neal benson<>real-time adaptive clustering of flow cytometric data<>pr<>mark yang<>
24022<>5768_0<>cheryl e. praeger:ru-ji wang<>symmetric graphs of order a product of two distinct primes<>jct<>ming yao xu<>
24035<>5768_13<>cheryl e. praeger<>vertex-primitive graphs of order a product of two distinct primes<>jct<>ming yao xu<>
40397<>5871_9<>jennifer seberry:xian-mo zhang<>systematic generation of cryptographically robust s-boxes<>ccs<>yuliang zheng<>
40415<>5871_27<>jennifer seberry<>immunizing public key cryptosystems against chosen ciphertext attacks<>jsac<>yuliang zheng<>
7835<>5877_32<>joseph a. shaw<>combination of multiple searches<>trec<>edward a. fox<>
7846<>5877_43<>yihong qian:willard w. farley<>an object-oriented database for the display measurement and analysis system<>cikm<>edward a. fox<>
7854<>5877_51<>nulo<>from information retrieval to networked multimedia information access<>ir<>edward a. fox<>
19367<>5878_0<>katrin dobrindt:mariette yvinec<>a complete and efficient algorithm for the intersection of a general and a convex polyhedron<>wads<>kurt mehlhorn<>
4777<>5894_8<>alok n. choudhary:geoffrey fox:seema hiranandani:ken kennedy:charles koelbel:sanjay ranka<>unified compilation of fortran 77d and 90d<>loplas<>chau-wen tseng<>
4797<>5894_28<>seema hiranandani:ken kennedy<>preliminary experiences with the fortran d compiler<>sc<>chau-wen tseng<>
20043<>5903_0<>william r. ferng:serge g. petiton<>basic sparse computations on data parallel computers<>ppsc<>kesheng wu<>
20044<>5903_1<>yousef saad:serge g. petiton<>sparse matrix computations on the cm-5<>ppsc<>kesheng wu<>
20018<>5917_22<>calton pu:wenwey hseush:gail e. kaiser:philip s. yu<>distributed divergence control for epsilon serializability<>icdcs<>kun-lung wu<>
20025<>5917_29<>philip s. yu:james z. teng<>performance comparison of thrashing control policies for concurrent mergesorts with parallel prefetching<>sigmetrics<>kun-lung wu<>
20030<>5917_34<>w. kent fuchs<>rapid transaction-undo recovery using twin-page storage management<>tse<>kun-lung wu<>
20033<>5917_37<>ming-syan chen:philip s. yu<>decentralized consensus protocols with multi-port communication<>icdcs<>kun-lung wu<>
30634<>5945_4<>nulo<>"quasi-brittle graphs, a new class of perfectly orderable graphs."<>dm<>stephan olariu<>
30637<>5945_7<>iain a. stewart<>a new characterization of unbreakable graphs<>ijfcs<>stephan olariu<>
30640<>5945_10<>derek g. corneil:lorna stewart<>asteroidal triple-free graphs<>wg<>stephan olariu<>
4508<>5968_0<>thomas f. coleman<>parallel orthogonal factorizations of large sparse matrices on distributed -memory multiprocessors<>ppsc<>chunguang sun<>
21216<>5976_3<>samuel joe rogers<>user identification via keystroke characteristics of typed names using neural networks<>ijmms<>marcus brown<>
4515<>5977_0<>jyh-shing roger jang<>using genetic algorithms in structuring a fuzzy rulebase<>icga<>chuen-tsai sun<>
32086<>5988_0<>sunil choenni:henk m. blanken<>on the selection of secondary indices in relational databases<>dke<>thiel chang<>
32085<>5989_0<>sunil choenni:henk m. blanken<>index selection in relational databases<>icci<>thiel chang<>
366<>6001_6<>wen-jing hsu:moon-jung chung<>linear recursive networks and their applications in topological design and data routing<>sigcomm<>amitabha das<>
22267<>6011_0<>hideyuki takagi<>dynamic control of genetic algorithms using fuzzy logic techniques<>icga<>michael a. lee<>
22186<>6013_1<>john grant:tok wang ling<>erl: logic for entity-relationship databases<>jiis<>mong-li lee<>
24850<>6022_42<>ran canetti<>bounds on tradeoffs between randomness and communication complexity<>cc<>oded goldreich<>
24859<>6022_51<>michael ben-or:ran canetti<>asynchronous secure computation<>stoc<>oded goldreich<>
24868<>6022_60<>mihir bellare:shafi goldwasser<>randomness in interactive proofs<>cc<>oded goldreich<>
24898<>6022_90<>hugo krawczyk:michael luby<>on the existence of pseudorandom generators<>siamcomp<>oded goldreich<>
24910<>6022_102<>nulo<>a uniform-complexity treatment of encryption and zero-knowledge<>joc<>oded goldreich<>
15559<>6025_19<>krys kochut:jonathan arnold:walter d. potter<>design of an object-oriented database for reverse genetics<>ismb<>john a. miller<>
28261<>6044_11<>victor o. k. li:chihping wang<>distributed database systems in high-speed wide-area networks<>jsac<>sujata banerjee<>
28294<>6045_5<>biswanath mukherjee<>algorithms for optimized node arrangements in shufflenet based multihop lightwave networks<>infocom<>subrata banerjee<>
785<>6077_8<>christine l. valenzuela<>evolutionary divide and conquer (i): a novel genetic approach to the tsp<>ec<>antonia j. jones<>
786<>6077_9<>d. macfarlane<>comparing networks with differing neural-node functions using transputer-based genetic algorithms<>nca<>antonia j. jones<>
776<>6086_1<>nulo<>towards a formal theory of defeasible deontic conditionals<>amai<>andrew j. i. jones<>
6762<>6091_3<>nulo<>constructing specification morphisms<>jsc<>douglas r. smith<>
6777<>6091_18<>nulo<>synthesis of constraint algorithms<>ppcp<>douglas r. smith<>
38549<>6120_2<>robert fuld:christopher d. wickens<>monitoring behavior in manual and automated scheduling systems<>ijmms<>yili liu<>
12171<>6165_10<>quanfeng wu<>strategy choice and change in programming<>ijmms<>john r. anderson<>
20362<>6166_1<>fernando c. n. pereira:naftali tishby<>distributional clustering of english words<>acl<>lillian lee<>
33544<>6174_59<>marion l. ellzey jr.:julie pena<>fast rotation of a 3d image about an arbitrary line<>cg<>vladik kreinovich<>
11458<>6222_1<>nulo<>partition of a bipartite graph into cycles<>dm<>hong wang<>
11467<>6222_10<>nulo<>p-factorization of a complete bipartite graph<>dm<>hong wang<>
11477<>6222_20<>norbert sauer<>packing three copies of a tree into a complete graph<>ejc<>hong wang<>
14072<>6225_4<>jorgen bang-jensen:erich prisner<>in-tournament digraphs<>jct<>jing huang<>
36285<>6242_6<>nulo<>claws contained in all n-tournaments<>dm<>xiaoyun lu<>
7889<>6286_22<>leopold flatto:paul e. wright<>optimal stochastic allocation of machines under waiting-time constraints<>siamcomp<>edward g. coffman jr.<>
7904<>6286_37<>shlomo halfin:alain jean-marie:philippe robert<>stochastic analysis of a slotted fifo communication channel<>tit<>edward g. coffman jr.<>
7906<>6286_39<>peter w. shor<>packings in two dimensions: asymptotic average-case analysis of algorithms<>algorithmica<>edward g. coffman jr.<>
7915<>6286_48<>leopold flatto:paul e. wright<>a stochastic checkpoint optimization problem<>siamcomp<>edward g. coffman jr.<>
7934<>6286_67<>leopold flatto:a. y. kreinin<>scheduling saves in fault-tolerant computations<>acta<>edward g. coffman jr.<>
7983<>6289_1<>nian-zu li<>the chromaticity of certain graphs with five triangles<>dm<>earl glen whitehead jr.<>
10022<>6304_11<>yang dai:kazuo iwano:naoki katoh<>how to treat delete requests in semi-online problems<>isaac<>hiroshi imai<>
10041<>6304_30<>yasukazu aoki:keiko imai:david rappaport<>probing a set of hyperplanes by lines and related problems<>wads<>hiroshi imai<>
1662<>6363_1<>david m. tate<>genetic optimization using a penalty function<>icga<>alice e. smith<>
1603<>6370_21<>chris h. perleberg<>branch target buffer design and optimization<>tc<>alan jay smith<>
13049<>6371_0<>james r. whiteley<>qualitative interpretation of sensor patterns<>expert<>james f. davis<>
5605<>6379_1<>chris hankin<>a lattice of abstract graphs<>plilp<>david clark<>
14993<>6393_27<>michel desmarais<>experimental results on user knowledge assessment with an evidential reasoning methodology<>iui<>jiming liu<>
396<>6420_6<>jayant r. haritsa:michael o. ball:nick roussopoulos:john s. baras<>mandate: managing networks using database technology<>jsac<>anindya datta<>
7611<>6427_4<>orna grumberg:david e. long<>verification tools for finite-state concurrent systems<>rex<>edmund m. clarke<>
26946<>6440_1<>william f. opdyke<>refactoring and aggregation<>isotas<>ralph e. johnson<>
25506<>6484_5<>nulo<>software-faults: the remaining problem in fault tolerant systems?<>hsaft<>peter a. lee<>
25486<>6488_3<>tzung-bow tsai<>compiling efficient programs for tightly-coupled distributed memory computers<>icpp<>peizong lee<>
28044<>6518_0<>cheryl e. praeger:ming yao xu<>symmetric graphs of order a product of two distinct primes<>jct<>ru-ji wang<>
10090<>6540_38<>jianxun ding<>impact of priority-based atm switch design on system performance<>icci<>hong jiang<>
28012<>6542_3<>thomas e. anderson<>xfs: a wide area mass storage file system<>hotos<>randolph y. wang<>
29149<>6545_0<>lane a. hemaspaandra:nikolai k. vereshchagin<>banishing robust turing completeness<>ijfcs<>sanjay jain<>
39298<>6550_13<>ten-hwang lai<>ring embedding in an injured hypercube<>icpp<>yu-chee tseng<>
28402<>6555_21<>david g. messerschmitt<>transform coding of arbitrarily-shaped image segments<>mm<>shih-fu chang<>
28417<>6555_36<>antonio massari:stefano pavani<>an iconic query system with intensional feedback capabilities<>vl<>shi-kuo chang<>
28418<>6555_37<>chien-tsai liu:panos k. chrysanthis<>an entity-relationship approach to schema evolution<>icci<>shi-kuo chang<>
28432<>6555_51<>angelo perkusich:jorge c. a. de figueiredo:bing yu:wolfgang d. ehrenberger<>the design of real-time distributed information systems with object-oriented and fault-tolerant characteristics<>seke<>shi-kuo chang<>
28446<>6555_65<>maria francesca costabile:stefano levialdi<>modeling users in an adaptive visual interface for database systems<>vlc<>shi-kuo chang<>
28451<>6555_70<>sergio orefice:giuseppe polese:bruce r. baker<>deriving the meaning of iconic sentences for augmentative communication<>vl<>shi-kuo chang<>
28455<>6555_74<>yi deng:jorge c. a. de figueiredo:angelo perkusich<>integrating software engineering methods and petri nets for the specification and prototyping of complex information systems<>apn<>shi-kuo chang<>
12070<>6557_13<>patrick h. worley<>parallelizing the spectral transform method: a comparison of alternative parallel algorithms<>ppsc<>ian t. foster<>
12077<>6557_20<>k. mani chandy<>deterministic parallel fortran<>ppsc<>ian t. foster<>
21818<>6562_8<>michio nakanishi<>on deriving specialization constraints over complex objects<>dasfaa<>minoru ito<>
40844<>6579_29<>david j. kuck:edward s. davidson:duncan h. lawrie:ahmed h. sameh:chuan-qi zhu:alexander v. veidenbaum:jeff konicek:pen-chung yew:kyle gallivan:william jalby:harry a. g. wijshoff:randall bramley:u. m. yang:perry a. emrath:david a. padua:rudolf eigenmann:jay hoeflinger:greg jaxon:t. murphy:john t. andrews:stephen w. turner<>the cedar system and an initial performance study<>isca<>zhiyuan li<>
1287<>6584_1<>yonit kesten:zohar manna:hugh mcguire<>a decision algorithm for full propositional temporal logic<>cav<>amir pnueli<>
1320<>6584_34<>zohar manna<>models for reactivity<>acta<>amir pnueli<>
1341<>6584_55<>lenore d. zuck<>in and out of temporal logic<>lics<>amir pnueli<>
1379<>6584_93<>lenore d. zuck<>probabilistic verification<>iandc<>amir pnueli<>
1383<>6584_97<>yonit kesten:zohar manna<>temporal verification of simulation and refinement<>rex<>amir pnueli<>
19761<>6645_1<>eitetsu oomoto<>ovid: design and implementation of a video-object database system<>tkde<>katsumi tanaka<>
1118<>6653_11<>nulo<>encoding w: a logic for z in 2obj<>fm<>andrew martin<>
1128<>6655_3<>martin grotschel:robert weismantel<>routing in grid graphs by cutting planes<>ipco<>alexander martin<>
41485<>6671_0<>chungming tu<>on the construction of systematic tec/aued codes<>tit<>zhen zhang<>
41495<>6671_10<>xiang-gen xia:c. c. jay kuo<>signal extrapolation based on wavelet transform<>iscas<>zhen zhang<>
41498<>6671_13<>xiang-gen xia<>lym-type inequalities for tec/aued codes<>tit<>zhen zhang<>
3675<>6675_11<>nulo<>reasoning about interference in an object-based design method<>fm<>cliff b. jones<>
3685<>6675_21<>nulo<>constraining inference in an object-based design model<>tapsoft<>cliff b. jones<>
1878<>6684_15<>hervo bronnimann:janos pach<>how hard is half-space range searching<>dcg<>bernard chazelle<>
1880<>6684_17<>nulo<>an optimal convex hull algorithm in any fixed dimension<>dcg<>bernard chazelle<>
1899<>6684_36<>nulo<>cutting hyperplanes for divide-and-conquer<>dcg<>bernard chazelle<>
1909<>6684_46<>hervo bronnimann:jiri matousek<>"product range spaces, sensitive sampling, and derandomization"<>focs<>bernard chazelle<>
1921<>6684_58<>herbert edelsbrunner:leonidas j. guibas:micha sharir:jack snoeyink<>computing a face in an arrangement of line segments and related problems<>siamcomp<>bernard chazelle<>
1928<>6684_65<>nulo<>geometric discrepancy revisited<>focs<>bernard chazelle<>
5662<>6707_3<>yuh-dauh lyuu:d. frank hsu<>line digraph iterations and connectivity analysis of de bruijn and kautz graphs<>tc<>ding-zhu du<>
5667<>6707_8<>biao gao:ronald l. graham:zi-cheng liu:peng-jun wan<>minimum steiner trees in normed planes<>dcg<>ding-zhu du<>
26379<>6741_21<>michael stonebraker:umeshwar dayal:erich j. neuhold:andreas reuter<>dbms research at a crossroads: the vienna update<>vldb<>rakesh agrawal<>
26382<>6741_24<>christos faloutsos:arun n. swami<>efficient similarity search in sequence databases<>fodo<>rakesh agrawal<>
3342<>6743_10<>clifford b. miller<>experimental comparison of the effect of order in recurrent neural networks<>ijprai<>c. lee giles<>
29771<>6748_8<>sanjoy k. mitter:t. j. richardson:john n. tsitsiklis<>local versus non-local computation of length of digitized curves<>fsttcs<>sanjeev r. kulkarni<>
29772<>6748_9<>ofer zeitouni<>on probably correct classification of concepts<>colt<>sanjeev r. kulkarni<>
29773<>6748_10<>sanjoy k. mitter:john n. tsitsiklis<>active learning using arbitrary binary valued queries<>ml<>sanjeev r. kulkarni<>
29775<>6748_12<>s. e. posner<>on-line learning of functions of bounded variation under various sampling schemes<>colt<>sanjeev r. kulkarni<>
2802<>6757_1<>terry p. speed<>a rate of convergence result for a universal d-semifaithful code<>tit<>bin yu<>
11598<>6800_1<>robert k. brayton<>input don't care sequences in fsm networks<>iccad<>huey-yih wang<>
5625<>6804_5<>michael j. carey:jeffrey f. naughton<>the oo7 benchmark<>sigmod<>david j. dewitt<>
5628<>6804_8<>manish mehta<>dynamic memory allocation for multiple-query workloads<>vldb<>david j. dewitt<>
5640<>6804_20<>jeffrey f. naughton:joseph burger<>nested loops revisited<>pdis<>david j. dewitt<>
21196<>6805_0<>susanne biundo:dietmar dengler:jana koehler:gabriele paul<>phi - a logic-based tool for intelligent help systems<>ijcai<>mathias bauer<>
22545<>6876_0<>nulo<>constant weight codes for correcting symmetric errors and detecting unidirectional errors<>tc<>mao chao lin<>
21539<>6883_1<>steffen van bakel<>strong normalization of typeable rewrite systems<>hoa<>maribel fernandez<>
2313<>6889_0<>nulo<>systematic concurrent object-oriented programming<>cacm<>bertrand meyer<>
2317<>6889_4<>nulo<>systematic concurrent object-oriented programming<>tools<>bertrand meyer<>
2324<>6889_11<>nulo<>systematic concurrent object-oriented programming<>tools<>bertrand meyer<>
2367<>6889_54<>nulo<>systematic concurrent object-oriented programming<>tools<>bertrand meyer<>
2377<>6892_0<>k. c. burgess yakemovic:michael harris<>issues in practical application of an adaptive interface<>iui<>beth meyer<>
17017<>6903_14<>kenneth m. curewitz:p. krishnan<>practical prefetching via data compression<>sigmod<>jeffrey scott vitter<>
17030<>6903_27<>mark h. nodine<>large-scale sorting in uniform memory hierarchies<>jpdc<>jeffrey scott vitter<>
17036<>6903_33<>paris c. kanellakis:sridhar ramaswamy:darren erik vengroff<>indexing for data models with constraints and classes<>pods<>jeffrey scott vitter<>
17041<>6903_38<>sairam sairam:roberto tamassia<>a complexity theoretic approach to incremental computation<>stacs<>jeffrey scott vitter<>
17056<>6903_53<>mark h. nodine:michael t. goodrich<>blocking for external graph searching<>pods<>jeffrey scott vitter<>
17070<>6903_67<>franco p. preparata<>a simplified technique for hidden-line elimination in terrains<>ijcga<>jeffrey scott vitter<>
17073<>6903_70<>paul g. howard<>fast and efficient lossless image compression<>dcc<>jeffrey scott vitter<>
17076<>6903_73<>yossi matias:wen-chun ni<>dynamic generation of discrete random variates<>soda<>jeffrey scott vitter<>
17101<>6903_98<>paul g. howard<>design and analysis of fast text compression based on quasi-arithmetic coding<>dcc<>jeffrey scott vitter<>
2101<>6916_8<>ali r. hurson<>issues in dataflow computing<>ac<>ben lee<>
