5950<>3_3<>p. r. hewitt<>counterexamples to a conjecture on relative categoricity<>apal<>david m. evans<>
26567<>17_14<>gaston h. gonnet:nivio ziviani<>expected behaviour analysis of avl trees<>swat<>ricardo a. baeza-yates<>
26601<>17_48<>gaston h. gonnet<>average case analysis of algorithms using matrix recurrences<>icci<>ricardo a. baeza-yates<>
26611<>17_58<>gaston h. gonnet:mireille regnier<>analysis of boyer-moore-type string searching algorithms<>soda<>ricardo a. baeza-yates<>
26640<>17_87<>gaston h. gonnet<>an analysis of the karp-rabin string matching algorithm<>ipl<>ricardo a. baeza-yates<>
25139<>25_77<>boris aronov:micha sharir:subhash suri<>selecting distances in the plane<>compgeom<>pankaj k. agarwal<>
25151<>25_89<>micha sharir<>"red-blue intersection detection algorithms, with applications to motion planning and collision detection."<>siamcomp<>pankaj k. agarwal<>
18787<>57_33<>nulo<>an abductive procedure for the cms/atms<>ecai<>katsumi inoue<>
20106<>58_0<>bruce a. shapiro<>comparing multiple rna secondary structures using tree comparisons<>bioinformatics<>kaizhong zhang<>
34560<>98_1<>weining zhang:jiawei han<>path: an approach to incorporate list processing in a relational database<>seke<>w. s. luk<>
6560<>127_1<>remo pareschi<>extending definite clause grammars with scoping constructs<>iclp<>dale miller<>
6562<>127_3<>gopalan nadathur<>higher-order horn clauses<>jacm<>dale miller<>
6570<>127_11<>nulo<>higher-order logic programming<>iclp<>dale miller<>
32816<>135_18<>nulo<>multilevel database and aggregated security algebra<>dbsec<>tsau young lin<>
5744<>153_15<>zvi galil:raffaele giancarlo:giuseppe f. italiano<>sparse dynamic programming<>soda<>david eppstein<>
5745<>153_16<>giuseppe f. italiano:roberto tamassia:robert endre tarjan:jeffery westbrook:moti yung<>maintenance of a minimum spanning forest in a dynamic planar graph<>soda<>david eppstein<>
5783<>153_54<>nulo<>reset sequences for monotonic automata<>siamcomp<>david eppstein<>
5846<>153_117<>joan feigenbaum:chung-lun li<>equipartitions of graphs<>dm<>david eppstein<>
5870<>153_141<>nulo<>finding the k smallest spanning trees<>swat<>david eppstein<>
5900<>153_171<>nulo<>sequence comparison with mixed convex and concave costs<>jal<>david eppstein<>
5921<>153_192<>marshall w. bern:john r. gilbert<>provably good mesh generation<>focs<>david eppstein<>
40544<>174_7<>chuanping chen<>an extreme problem concerning k-arc-cyclic property for a class of tournaments<>dm<>yongjin zhu<>
17210<>221_10<>jer min jou:jau-yien lee:yachyang sun<>an efficient vlsi switch-box router<>dt<>jhing-fa wang<>
30919<>270_9<>alok aggarwal:dina kravets:james k. park<>parallel searching in generalized monge arrays with applications<>spaa<>s. sen<>
30936<>270_26<>nulo<>finding an approximate median with high probability in constant parallel time<>ipl<>sandeep sen<>
29246<>280_87<>ravi s. sandhu<>polyinstantiation integrity in multilevel relations revisited<>dbsec<>sushil jajodia<>
29257<>280_98<>boris kogan<>transaction processing in multilevel-secure databases using replicated architecture<>sp<>sushil jajodia<>
29264<>280_105<>ravi s. sandhu<>database security: current status and key issues<>sigmod<>sushil jajodia<>
29280<>280_121<>ravi s. sandhu<>polyinstantiation integrity in multilevel relations<>sp<>sushil jajodia<>
29287<>280_128<>ravi s. sandhu<>a formal framework for single level decomposition of multilevel relations<>csfw<>sushil jajodia<>
29319<>280_160<>boris kogan<>integrating an object-oriented data model with multilevel security<>sp<>sushil jajodia<>
29325<>280_166<>ravi s. sandhu:teresa f. lunt<>a new polyinstantiation integrity constraint for multilevel relations<>csfw<>sushil jajodia<>
29346<>280_187<>david mutchler<>dynamic voting algorithms for maintaining the consistency of a replicated database<>tods<>sushil jajodia<>
4881<>327_1<>joseph y.-t. leung:tommy w. tam:gilbert h. young:francis y. l. chin<>packing squares into a square<>jpdc<>c. s. wong<>
4905<>331_6<>jan-ming ho:gopalakrishnan vijayan<>new algorithms for the rectilinear steiner tree problem<>tcad<>chak-kuen wong<>
23564<>333_4<>phokion g. kolaitis<>on the expressive power of datalog: tools and a case study<>pods<>moshe y. vardi<>
23654<>333_94<>costas courcoubetis:pierre wolper:mihalis yannakakis<>memory efficient algorithms for the verification of temporal properties<>cav<>moshe y. vardi<>
23735<>341_1<>phokion g. kolaitis<>0-1 laws and decision problems for fragments of second-order logic<>iandc<>moshe y. vardi<>
33295<>355_27<>apostolos gerasoulis:sesh venugopal<>clustering task graphs for message passing architectures<>ics<>tao yang<>
10131<>368_10<>nulo<>beyond specificity<>ipmu<>henry e. kyburg jr.<>
14651<>394_5<>in koo lee:hyung rim choi:sung mahn ahn<>automatic rule generation by the transformation of expert's diagram: lift<>ijmms<>jae kyu lee<>
22808<>424_61<>micha sharir<>merging visibility maps<>compgeom<>mark h. overmars<>
22811<>424_64<>mark de berg<>hidden surface removal for axis-parallel polyhedra (extended abstract)<>focs<>mark h. overmars<>
22828<>424_81<>david p. dobkin:herbert edelsbrunner<>searching for empty convex polygons<>algorithmica<>mark h. overmars<>
22831<>424_84<>haijo schipper<>dynamic partition trees<>swat<>mark h. overmars<>
22833<>424_86<>marc j. van kreveld:pankaj k. agarwal<>intersection queries in sets of disks<>swat<>mark h. overmars<>
22861<>424_114<>haijo schipper:micha sharir<>storing line segments in partition trees<>bit<>mark h. overmars<>
19458<>485_33<>nulo<>modular stratification and magic sets for datalog programs with negation<>pods<>kenneth a. ross<>
33916<>529_11<>raj das<>experiments with query acquisition and use in document retrieval systems<>sigir<>w. bruce croft<>
33923<>529_18<>david d. lewis<>term clustering of syntactic phrases<>sigir<>w. bruce croft<>
33946<>529_41<>robert krovetz:howard r. turtle<>interactive retrieval of complex documents<>ipm<>w. bruce croft<>
33980<>529_75<>l. s. gay<>interpreting nominal compounds for information retrieval<>ipm<>w. bruce croft<>
25341<>546_18<>garth a. gibson:randy h. katz:david a. patterson<>an evaluation of redundant arrays of disks using an amdahl 5890<>sigmetrics<>peter m. chen<>
25362<>550_0<>nulo<>supercomputer-based visualization systems used for analyzing output data of a numerical weather prediction model<>ics<>philip c. chen<>
27889<>586_0<>david eppstein:giuseppe f. italiano:roberto tamassia:jeffery westbrook:moti yung<>maintenance of a minimum spanning forest in a dynamic planar graph<>soda<>robert endre tarjan<>
6297<>594_16<>nulo<>discontinuity detection from band-limited signals<>jc<>david lee<>
6308<>594_27<>nulo<>"coping with discontinuities in computer vision: their detection, classification, and measurement."<>pami<>david lee<>
462<>622_44<>nulo<>on the independence number of random graphs<>dm<>alan m. frieze<>
12146<>632_0<>jae kyu lee:hyung rim choi:sung mahn ahn<>automatic rule generation by the transformation of expert's diagram: lift<>ijmms<>in koo lee<>
25745<>702_9<>m. seetha lakshmi<>effectiveness of parallel joins<>tkde<>philip s. yu<>
25763<>702_27<>m. seetha lakshmi<>effectiveness of parallel processing in database systems<>csse<>philip s. yu<>
25779<>702_43<>douglas w. cornell<>integrated approach to buffer management and query optimization<>csse<>philip s. yu<>
25881<>702_145<>ming-syan chen<>using join operations as reducers in distributed query processing<>dpds<>philip s. yu<>
25884<>702_148<>daniel m. dias<>concurrency control using locking with deferred blocking<>icde<>philip s. yu<>
25895<>702_159<>asit dan:daniel m. dias<>database buffer model for the data sharing environment<>icde<>philip s. yu<>
12300<>759_7<>graham russell:susan warwick-armstrong<>asymmetry in parsing and generating with unification grammars: case studies from elu<>acl<>john carroll<>
31641<>804_0<>wei kuan shih:y. s. kuo<>unifying maximum cut and minimum cut of a planar graph<>tc<>sun wu<>
32414<>863_0<>y. chu:m. t. hsu<>p1 nuclease defines a subpopulation of active sv40 chromatin - a new nuclease hypersensitivity assay<>nar<>t. s. huang<>
34128<>907_1<>brian a. box:erich c. whitney:james m. glynn<>design and implementation of a high speed cmac neural network<>nips<>w. thomas miller iii<>
14602<>914_4<>umakishore ramachandran<>synchronization with multiprocessor caches<>isca<>joonwon lee<>
22954<>956_69<>malgorzata marek-sadowska:ernest s. kuh<>floorplanning with pin assignment<>iccad<>massoud pedram<>
3638<>963_13<>nulo<>using temporal logic to prototype interactive systems<>interact<>c. w. johnson<>
31981<>988_9<>brian n. bershad:edward d. lazowska:henry m. levy<>lightweight remote procedure call<>tocs<>thomas e. anderson<>
15872<>1012_2<>alexander borgida:matthias jarke:manolis koubarakis<>telos: representing knowledge about information systems<>tois<>john mylopoulos<>
23545<>1022_3<>gerhard a. schloss<>distributed raid - a new multiple copy algorithm<>icde<>michael stonebraker<>
38463<>1099_0<>yu-chin hsu:fur-shing tsai<>hybrid routing<>tcad<>youn-long lin<>
38468<>1099_5<>cheng-tsung hwang:yu-chin hsu<>optimum and heuristic data path scheduling under resource constraints<>dac<>youn-long lin<>
38479<>1099_16<>chi-yi hwang:yung-chin hsieh:yu-chin hsu<>a fast transistor-chaining algorithm for cmos cell layout<>tcad<>youn-long lin<>
38483<>1099_20<>yung-ching hsieh:chi-yi hwang:yu-chin hsu<>lib: a cell layout generator<>dac<>youn-long lin<>
38485<>1099_22<>chu-yi huang:yen-shen chen:yu-chin hsu<>data path allocation based on bipartite weighted matching<>dac<>youn-long lin<>
38438<>1100_27<>edward d. lazowska<>exploiting lookahead in parallel simulation<>tpds<>yi-bing lin<>
37619<>1199_2<>shi-kuo chang<>a g-net model for knowledge representation and reasoning<>tkde<>yi deng<>
19848<>1276_7<>u. c. baron:hans benker:sylvie bescos:a. b. cheese:francois j. n. cosquer:sergio a. delgado-rannauro:michel dorochevsky:p. heuze:m. ibanez-espiga:jacques noye:maurizio paci:m. j. ratcliffe:m. j. reeve:kees schuerman:alan p. sexton:andre veron:jiyang xu<>the european declarative system (eds) as a platform for parallel logic programming<>spdp<>k.-f. wong<>
19853<>1276_12<>m. howard williams<>clare - a prolog database machine<>sigsmall<>kam-fai wong<>
9682<>1285_12<>vasant dhar<>user misconceptions of information retrieval systems<>ijmms<>hsinchun chen<>
9692<>1285_22<>nulo<>a knowledge-based design for hypertext-based document retrieval systems<>dexa<>hsinchun chen<>
10046<>1319_0<>nulo<>spatial search with polyhedra<>icde<>h. v. jagadish<>
8516<>1362_1<>pierre mondain-monval<>design principles for communication gateways<>jsac<>gregor von bochmann<>
19414<>1377_0<>zvi galil<>a linear-time algorithm for concave one-dimensional dynamic programming<>ipl<>kunsoo park<>
23242<>1433_37<>s. ichikawa:e. goto<>multiple instruction streams in a highly pipelined processor<>spdp<>m. sato<>
16170<>1441_44<>hillel gazit<>a randomized parallel algorithm for planar graph isomorphism<>spaa<>john h. reif<>
16176<>1441_50<>j. d. tygar:akitoshi yoshida<>the computability and complexity of optical beam tracing<>focs<>john h. reif<>
16195<>1441_69<>stephen r. tate<>optimal size integer division circuits<>siamcomp<>john h. reif<>
16200<>1441_74<>akhilesh tyagi<>energy complexity of optical computations<>spdp<>john h. reif<>
13128<>1465_7<>ed anderson:zhaojun bai:a. greenbaum:a. mckenney:jeremy du croz:sven hammarling:james demmel:christian h. bischof:danny c. sorensen<>lapack: a portable linear algebra library for high-performance computers<>sc<>jack dongarra<>
13130<>1465_9<>jeremy du croz:sven hammarling:iain s. duff<>a set of level 3 basic linear algebra subprograms<>toms<>jack dongarra<>
13161<>1465_40<>jermey du cruz:sven hammarling:iain s. duff<>algorithm 679; a set of level 3 basic linear algebra subprograms: model implementation and test programs<>toms<>jack dongarra<>
13238<>1465_117<>orlie brewer:james arthur kohl:samuel a. fineberg<>"a tool to aid in the design, implementation, and understanding of matrix algorithms for parallel processors."<>jpdc<>jack dongarra<>
40569<>1471_3<>shaw-yin lin:yi-yao chen<>a parallel architecture for probabilistic relaxation operations on images<>pr<>zen chen<>
30249<>1486_6<>bradley l. whitehall:robert e. stepp<>knowledge-based learning integrating acquisition and learning<>ieaaie<>stephen c. y. lu<>
30254<>1486_11<>bradley l. whitehall:robert e. stepp<>caq: a machine learning tool for engineering<>aei<>stephen c. y. lu<>
30255<>1486_12<>h. s. teng:k. chen<>adaptive real-time anomaly detection using inductively generated sequential patterns<>sp<>s. c. y. lu<>
30259<>1486_16<>bradley l. whitehall:robert e. stepp<>equation generation for clustering<>ieaaie<>stephen c. y. lu<>
12913<>1499_62<>c. l. liu<>over-the-cell channel routing<>tcad<>jason cong<>
12939<>1499_88<>bryan preas:c. l. liu<>general models and algorithms for over-the-cell routing in standard cell design<>dac<>jason cong<>
8191<>1532_18<>yinan n. shen:donatella sciuto<>evaluation and improvement of fault coverage for verification and validation of protocols<>spdp<>fabrizio lombardi<>
8207<>1532_34<>yinan n. shen:jon c. muzio<>on the testability of array structures for fft computation<>spdp<>fabrizio lombardi<>
19083<>1563_2<>man hon wong<>an expert-system shell using structured knowledge: an object-oriented approach<>computer<>kwong-sak leung<>
19111<>1563_30<>man hon wong<>a fuzzy database-query language<>is<>kwong-sak leung<>
37381<>1616_2<>ferdinand f. leimkuhler<>booth's law of word frequency<>jasis<>ye-sho chen<>
16082<>1642_1<>dina kravets<>selection and sorting in totally monotone arrays<>soda<>james k. park<>
16084<>1642_3<>alok aggarwal:dina kravets:s. sen<>parallel searching in generalized monge arrays with applications<>spaa<>james k. park<>
6745<>1690_6<>susan even<>type inference for action semantics<>esop<>david a. schmidt<>
41111<>1783_47<>amir pnueli<>a hierarchy of temporal properties<>podc<>zohar manna<>
8823<>1796_17<>william p. thurston<>separators in two and three dimensions<>stoc<>gary l. miller<>
8840<>1796_34<>hillel gazit<>planar separators and the euclidean norm<>sigal<>gary l. miller<>
8852<>1796_46<>richard j. anderson<>a simple randomized parallel algorithm for list-ranking<>ipl<>gary l. miller<>
27698<>1824_7<>william w. gaver<>auditory icons in large-scale collaborative environments<>interact<>randall b. smith<>
11818<>1841_3<>arthur c. sanderson:luiz homem de mello<>assembly sequence planning<>aim<>hui zhang<>
37481<>1848_0<>zen chen:shaw-yin lin<>a parallel architecture for probabilistic relaxation operations on images<>pr<>yi-yao chen<>
37447<>1854_1<>michael y. nishimoto:c. v. ramamoorthy<>the c information abstraction system<>tse<>yih-farn chen<>
38949<>1870_11<>leonard j. schulman<>sorting on a ring of processors<>jal<>yishay mansour<>
38970<>1870_32<>israel cidon:shay kutten:david peleg<>greedy packet scheduling<>wdag<>yishay mansour<>
32480<>1898_63<>tiko kameda:naoki katoh<>multiversion cautious schedulers for database concurrency control<>tse<>toshihide ibaraki<>
32484<>1898_67<>hiroshi nagamochi<>computing edge-connectivity in multiple and capacitated graphs<>sigal<>toshihide ibaraki<>
37540<>1918_0<>y. h. chin<>the quickest path problem<>cor<>y. l. chen<>
9482<>1943_17<>peter gritzmann:victor klee:jan van leeuwen<>computational complexity of norm-maximization<>combinatorica<>hans l. bodlaender<>
9515<>1943_50<>rolf h. mohring<>the pathwidth and treewidth of cographs<>swat<>hans l. bodlaender<>
9561<>1943_96<>gerard tel<>bit-optimal election in synchronous rings<>ipl<>hans l. bodlaender<>
9564<>1943_99<>nulo<>on the complexity of some coloring games<>wg<>hans l. bodlaender<>
9580<>1943_115<>nulo<>the complexity of finding uniform emulations on paths and ring networks<>iandc<>hans l. bodlaender<>
9185<>1961_6<>thierry barsalou<>complex objects for relational databases<>cad<>gio wiederhold<>
9202<>1961_23<>nulo<>future architectures for information processing systems<>parbase<>gio wiederhold<>
9226<>1961_47<>xiaolei qian<>consistency control of replicated data in federated databases<>wmrd<>gio wiederhold<>
4670<>1995_16<>maw-shang chang:richard c. t. lee<>20-relative neighborhood graphs are hamiltonian<>sigal<>chuan yi tang<>
27921<>1997_31<>leon j. osterweil<>the architecture of the arcadia-1 process centered software environment<>ispw<>richard n. taylor<>
4423<>2008_13<>nulo<>software performance engineering tutorial<>cmg<>connie u. smith<>
29557<>2019_47<>yusuf leblebici<>an integrated hot-carrier degradation simulator for vlsi reliability analysis<>iccad<>sung-mo kang<>
27951<>2031_6<>nulo<>a menger-like property of tree-width: the finite case<>jct<>robin thomas<>
27953<>2031_8<>igor kriz<>"clique-sums, tree-decompositions and compactness."<>dm<>robin thomas<>
30105<>2084_0<>barton p. miller:morgan clark:jeffrey k. hollingsworth:steven kierstead:timothy torzewski<>ips-2: the second generation of a parallel program measurement system<>tpds<>sek-see lim<>
31232<>2180_1<>nicola muscettola:dirk c. matthys:peng si ow:jean-yves potvin<>opis: an opportunistic factory scheduling system<>ieaaie<>stephen f. smith<>
4292<>2226_8<>sankar k. pal<>"fuzzy thresholding: mathematical framework, bound functions and weighted moving average technique."<>prl<>c. a. murthy<>
8733<>2230_0<>pro rong chang<>a decomposition approach for balancing large-scale acyclic data flow graphs<>tc<>george lee<>
3455<>2285_2<>keh-jiann chen<>information-based case grammar<>coling<>chu-ren huang<>
27789<>2308_48<>jeffrey scott vitter<>optimal cooperative search in fractional cascaded data structures<>spaa<>roberto tamassia<>
27802<>2308_61<>giuseppe di battista:amadeo giammarco:giuseppe santucci<>the architecture of diagram server<>vl<>roberto tamassia<>
27807<>2308_66<>giuseppe di battista<>on-line graph algorithms with spqr-trees<>icalp<>roberto tamassia<>
27815<>2308_74<>franco p. preparata<>dynamic planar point location with optimal query time<>tcs<>roberto tamassia<>
27842<>2308_101<>franco p. preparata<>"dynamic maintenance of planar digraphs, with applications."<>algorithmica<>roberto tamassia<>
27849<>2308_108<>david eppstein:giuseppe f. italiano:robert endre tarjan:jeffery westbrook:moti yung<>maintenance of a minimum spanning forest in a dynamic planar graph<>soda<>roberto tamassia<>
21369<>2326_11<>kang g. shin<>depth-first search approach for fault-tolerant routing in hypercube<>tpds<>ming-syan chen<>
21395<>2326_37<>philip s. yu<>using combination of join and semijoin operations for distributed query processing<>icdcs<>ming-syan chen<>
21407<>2326_49<>philip s. yu:hans-ulrich heiss:sukho lee<>on workload characterization of relational database environments<>cmg<>ming-syan chen<>
21411<>2326_53<>kang g. shin<>on the number of acceptable task assignments in distributed computing systems<>tc<>ming-syan chen<>
21416<>2326_58<>kang g. shin<>adaptive fault-tolerant routing in hypercube multicomputers<>tc<>ming-syan chen<>
21428<>2326_70<>philip s. yu<>using join operations as reducers in distributed query processing<>dpds<>ming-syan chen<>
39971<>2334_8<>nulo<>"a ""build-down"" scheme for linear programming."<>mp<>yinyu ye<>
39989<>2334_26<>nulo<>a class of projective transformations for linear programming<>siamcomp<>yinyu ye<>
12789<>2394_13<>david hildum<>a language for specifying program transformations<>tse<>jacques cohen<>
12803<>2394_27<>nulo<>constraint logic programming languages<>cacm<>jacques cohen<>
27325<>2427_3<>p. c. stephenson<>sweeping of three-dimensional objects<>cad<>ralph r. martin<>
12407<>2522_7<>nulo<>the difference between one tape and two tapes: with respect to reversal complexity<>tcs<>jianer chen<>
30975<>2683_7<>nulo<>strong negative partition above the continuum<>jsyml<>saharon shelah<>
31072<>2683_104<>haim judah:w. hugh woodin<>the borel conjecture<>apal<>saharon shelah<>
21270<>2703_1<>luc de raedt<>on negation and three-valued logic in interactive concept-learning<>ecai<>maurice bruynooghe<>
3093<>2713_0<>yongjin zhu<>an extreme problem concerning k-arc-cyclic property for a class of tournaments<>dm<>chuanping chen<>
8922<>2734_38<>nulo<>non-centralized parallel communicating grammar systems<>eatcs<>gheorghe paun<>
26220<>2902_5<>laxmi n. bhuyan<>performance of multiple-bus interconnections for multiprocessors<>jpdc<>qing yang<>
26227<>2902_12<>george thangadurai:laxmi n. bhuyan<>an adaptive cache coherence scheme for hierarchical shared-memory multiprocessors<>spdp<>qing yang<>
26230<>2902_15<>ravi raja<>design and analysis of multiple-bus arbiters with different priority schemes<>parbase<>qing yang<>
26141<>2903_43<>nulo<>preprocessing hierarchical planning knowledge for efficient planning<>ecai<>q. yang<>
26146<>2903_48<>nulo<>formalizing planning knowledge for hierarchical planning<>ci<>qiang yang<>
26191<>2903_93<>nulo<>an algebraic approach to conflict resolution in planning<>aaai<>qiang yang<>
932<>2949_4<>nulo<>an analysis of borrowing policies for escrow transactions in a replicated data environment<>icde<>akhil kumar<>
937<>2949_9<>nulo<>a crash recovery algorithm based on multiple logs that exploits parallelism<>spdp<>akhil kumar<>
21300<>2952_1<>nulo<>extending and solving a multiperiod congested network flow model<>cor<>malachy carey<>
19556<>3044_37<>win bo<>topologies - distributed objects on multicomputers<>tocs<>karsten schwan<>
13542<>3047_16<>ronald fagin:nimrod megiddo<>a logic for reasoning about probabilities<>iandc<>joseph y. halpern<>
13609<>3047_83<>john h. williams:edward l. wimmers<>completeness of rewrite rules and rewrite strategies for fp<>jacm<>joseph y. halpern<>
13615<>3047_89<>yoram moses<>knowledge and common knowledge in a distributed environment<>jacm<>joseph y. halpern<>
13630<>3047_104<>ronald fagin:moshe y. vardi<>a nonstandard approach to the logical omniscience problem<>tark<>joseph y. halpern<>
13633<>3047_107<>yoram moses:orli waarts<>a characterization of eventual byzantine agreement<>podc<>joseph y. halpern<>
13705<>3047_179<>nulo<>an analysis of first-order logics of probability<>ai<>joseph y. halpern<>
13711<>3047_185<>ronald fagin<>a new approach to updating beliefs<>uai<>joseph y. halpern<>
34080<>3116_7<>kuo-hui tsai<>fast algorithms for the dominating set problem on permutation graphs<>sigal<>wen-lian hsu<>
4355<>3195_36<>mihalis yannakakis<>towards an architecture-independent analysis of parallel algorithms<>siamcomp<>christos h. papadimitriou<>
3835<>3212_0<>donna partridge:tod pinniger:warren ogle<>speech through myoelectric signal recognition smyles<>ACMse<>calvin lee<>
8640<>3327_0<>yen-cheng chen:wen-tsuen chen<>two-variable linear programming on mesh-connected computers with multiple broadcasting<>icpp<>gen-huey chen<>
6408<>3401_0<>w. bruce croft<>term clustering of syntactic phrases<>sigir<>david d. lewis<>
1142<>3411_3<>jurek czyzowicz:ivan rival<>drawing orders with few slopes<>dm<>andrzej pelc<>
27259<>3427_0<>maw-shang chang:chuan yi tang<>20-relative neighborhood graphs are hamiltonian<>sigal<>richard c. t. lee<>
27260<>3427_1<>chain-chin yen<>the weighted perfect domination problem<>ipl<>richard c. t. lee<>
30068<>3456_5<>nulo<>algorithms for flow control and call set-up in multi-hop broadband isdn<>infocom<>shuo-yen robert li<>
1030<>3476_0<>roger duke:gordon a. rose<>object-oriented protocol specification<>pstv<>anthony lee<>
1018<>3495_15<>frederick h. lochovsky<>user's command line reference behaviour: locality versus recency<>interact<>alison lee<>
18058<>3526_27<>li-yan yuan<>discriminant circumscription<>fsttcs<>jia-huai you<>
18070<>3526_39<>li-yan yuan<>three-valued formalization of logic programming: is it needed?<>pods<>jia-huai you<>
18072<>3526_41<>zhiyong liu<>dynamic load-balancing on a parallel inference system<>spdp<>jia-huai you<>
12187<>3569_2<>david kelly:j. schonheim:robert e. woodrow<>graph coloring satisfying restraints<>dm<>jason i. brown<>
9061<>3575_10<>andrzej ehrenfeucht<>primitivity is hereditary for 2-structures<>tcs<>grzegorz rozenberg<>
9036<>3580_16<>michael g. main<>edge-label controlled graph grammars<>jcss<>grzegorz rozenberg<>
33754<>3608_4<>stephen r. schach<>learning switch configurations<>colt<>vijay raghavan<>
33203<>3712_0<>d. f. wong<>an optimal algorithm for floorplan area optimization<>dac<>ting-chi wang<>
8328<>3772_67<>herbert edelsbrunner:douglas b. west<>tetrahedrizing point sets in three dimensions<>jsc<>franco p. preparata<>
8332<>3772_71<>panagiotis alevizos:jean-daniel boissonnat<>an optimal algorithm for the boundary of a cell in a union of rays<>algorithmica<>franco p. preparata<>
8335<>3772_74<>jean vuillemin<>practical cellular dividers<>tc<>franco p. preparata<>
8360<>3772_99<>roberto tamassia<>dynamic planar point location with optimal query time<>tcs<>franco p. preparata<>
8383<>3772_122<>roberto tamassia<>"dynamic maintenance of planar digraphs, with applications."<>algorithmica<>franco p. preparata<>
13348<>3809_4<>ahmed bouajjani:nicolas halbwachs<>minimal model generation<>cav<>jean-claude fernandez<>
6073<>3890_10<>francine berman:frank thomson leighton:peter w. shor:larry snyder<>generalized planar matching<>jal<>david s. johnson<>
6096<>3890_33<>brent n. clark:charles j. colbourn<>unit disk graphs<>dm<>david s. johnson<>
6115<>3890_52<>nulo<>local optimization and the traveling salesman problem<>icalp<>david s. johnson<>
38141<>3894_6<>jih-kwon peir<>improving multistage network performance under uniform and hot-spot traffics<>spdp<>yann-hang lee<>
38163<>3894_28<>l.-t. shen<>real-time communication in multiple token ring networks<>rtss<>yann-hang lee<>
32392<>3972_1<>nulo<>computer vision<>egt<>thomas s. huang<>
2413<>3975_33<>limsoon wong<>treating failure as state<>sigplan<>beng chin ooi<>
14274<>3995_11<>nulo<>modes in non-computer devices<>ijmms<>jeff a. johnson<>
25185<>4055_0<>ralph-michael kling<>optimization by simulated evolution with applications to standard cell placement<>dac<>prithviraj banerjee<>
33592<>4070_3<>albert burger<>main memory database recovery algorithms and their performance<>spdp<>vijay kumar<>
33604<>4070_15<>nulo<>concurrent operations on extendible hashing and its performance<>cacm<>vijay kumar<>
33610<>4070_21<>jerry place:appie van de liefvoort<>the behavior of database concurrency control mechanisms under bursty arrivals<>icci<>vijay kumar<>
33792<>4083_0<>yen-cheng chen:gen-huey chen<>two-variable linear programming on mesh-connected computers with multiple broadcasting<>icpp<>wen-tsuen chen<>
579<>4097_3<>apurva kalia<>simulation of ram-based asynchronous sequential circuits<>anss<>ashok k. goel<>
27012<>4105_1<>nulo<>the transitive closure of a random digraph<>rsa<>richard m. karp<>
27063<>4105_52<>umesh v. vazirani:vijay v. vazirani<>an optimal algorithm for on-line bipartite matching<>stoc<>richard m. karp<>
35508<>4110_0<>john a. n. lee<>integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems<>fac<>xudong he<>
35518<>4110_10<>john a. n. lee<>a methodology for test selection<>jss<>xudong he<>
30333<>4241_23<>kanwar jit singh:robert k. brayton:alberto l. sangiovanni-vincentelli<>performance optimization of pipelined circuits<>iccad<>sharad malik<>
30349<>4241_39<>kurt keutzer:alexander saldanha<>is redundancy necessary to reduce delay<>dac<>sharad malik<>
30356<>4241_46<>luciano lavagno:robert k. brayton:alberto l. sangiovanni-vincentelli<>mis-mv: optimization of multi-level logic with multiple-valued inputs<>iccad<>sharad malik<>
22716<>4280_79<>jehoshua bruck<>the hardness of decoding linear codes with preprocessing<>tit<>moni naor<>
22720<>4280_83<>joseph naor<>small-bias probability spaces: efficient constructions and applications<>stoc<>moni naor<>
22725<>4280_88<>amotz bar-noy:joseph naor<>one-bit algorithms<>dc<>moni naor<>
22741<>4280_104<>moti yung<>public-key cryptosystems provably secure against chosen ciphertext attacks<>stoc<>moni naor<>
20832<>4301_2<>nulo<>adding learned expectation into the learning procedure of self-organizing maps<>ijns<>lei xu<>
20858<>4301_28<>erkki oja<>"improved simulated annealing, boltzmann machine, and attributed graph matching."<>eurasip<>lei xu<>
20861<>4301_31<>erkki oja:pekka kultanen<>a new curve detection method: randomized hough transform (rht)<>prl<>lei xu<>
223<>4302_23<>janak h. patel<>performance evaluation of clusters of netra: an architecture for computer vision systems<>icpp<>alok n. choudhary<>
321<>4302_121<>nulo<>cost of distributed deadlock detection: a performance study<>icde<>alok n. choudhary<>
25661<>4317_1<>nulo<>parallel univariate polynomial factorization on shared-memory multiprocessors<>issac<>paul s. wang<>
25667<>4317_7<>y. doleh<>sui: a system independent user interface for an integrated scientific computing environment<>issac<>paul s. wang<>
10406<>4533_9<>nulo<>edge-hamiltonian property in regular 2- connected graphs<>dm<>hao li<>
11013<>4566_36<>markku tamminen<>approximating csg trees of moving objects<>vc<>hanan samet<>
11052<>4566_75<>chuan-heng ang:clifford a. shaffer<>a new region expansion for quadtrees<>pami<>hanan samet<>
11082<>4566_105<>walid g. aref<>efficient processing of window queries in the pyramid data structure<>pods<>hanan samet<>
11087<>4566_110<>clifford a. shaffer<>set operations for unaligned linear quadtrees<>cvgip<>hanan samet<>
11113<>4566_136<>clifford a. shaffer:randal c. nelson<>quilt: a geographic information system based on quadtrees<>ijgis<>hanan samet<>
34161<>4616_4<>nulo<>chair's message<>sigmod<>won kim<>
34164<>4616_7<>nulo<>chair's message<>sigmod<>won kim<>
34166<>4616_9<>nulo<>chair's message<>sigmod<>won kim<>
11337<>4654_25<>qianshan he<>an object-oriented distributed system integrating multimedia resources<>icsi<>hidehiko tanaka<>
2590<>4666_0<>robert alverson:david callahan:daniel cummings:brian koblenz:allan porterfield<>the tera computer system<>ics<>burton j. smith<>
36348<>4671_1<>herbert edelsbrunner:arch d. robison<>covering convex sets with non-overlapping polygons<>dm<>xiaojun shen<>
17475<>4714_8<>hans r. muller:mehdi nassehi:erwin a. zurfluh:werner bux:pitro zafiropulo<>dqma and crma: new access schemes for gbit/s lans and mans<>infocom<>johnny w. wong<>
863<>4748_0<>anne abeille:yves schabes<>using lexicalized tags for machine translation<>coling<>aravind k. joshi<>
6926<>4786_28<>nulo<>decomposition of k-ary relations<>dm<>dorothea wagner<>
11277<>4802_1<>yulin qin<>laboratory replication of scientific discovery processes<>cogsci<>herbert a. simon<>
33041<>4985_19<>nulo<>completed logic programs and their consistency<>jlp<>taisuke sato<>
24953<>5073_23<>tao jiang:hui wang<>string editing on a one-way linear array of finite-state machines<>icpp<>oscar h. ibarra<>
24994<>5073_64<>hui wang:tao jiang<>efficient parallel algorithms for solving set recurrence equations and applications<>spdp<>oscar h. ibarra<>
25035<>5073_105<>stephen m. sohn<>on mapping systolic algorithms onto the hypercube<>tpds<>oscar h. ibarra<>
25048<>5073_118<>j. andrew holey<>iterative algorithms for planar convex hull on mesh-connected arrays<>icpp<>oscar h. ibarra<>
24230<>5078_38<>nulo<>the number of spanning trees in regular graphs<>rsa<>noga alon<>
24234<>5078_42<>nulo<>the maximum number of hamiltonian paths in tournaments<>combinatorica<>noga alon<>
32306<>5081_116<>nulo<>half-order modal logic: how to prove real-time properties<>podc<>thomas a. henzinger<>
32334<>5081_144<>rajeev alur<>real-time logics: complexity and expressiveness<>lics<>thomas a. henzinger<>
35208<>5082_30<>john a. stankovic:krithi ramamritham<>a window protocol for transmission of time-constrained messages<>tc<>wei zhao<>
35210<>5082_32<>nicholas malcolm:chris j. barter<>guarantee protocols for communication in distributed hard real-time systems<>infocom<>wei zhao<>
3000<>5094_9<>george b. trubow<>joint software research between industry and academia<>software<>carl k. chang<>
22328<>5148_7<>francesco m. donini:daniele nardi<>an efficient method for hybrid deduction<>ecai<>maurizio lenzerini<>
22360<>5148_39<>tiziana catarci:giovanna d'angiolini<>concept description language for statistical data modeling<>vldb<>maurizio lenzerini<>
22361<>5148_40<>paolo nobili<>on the satisfiability of dependency constraints in entity-relationship schemata<>is<>maurizio lenzerini<>
24103<>5153_0<>david eppstein:giuseppe f. italiano:roberto tamassia:robert endre tarjan:jeffery westbrook<>maintenance of a minimum spanning forest in a dynamic planar graph<>soda<>moti yung<>
21587<>5157_18<>ellen e. witte:roger d. chamberlain<>parallel simulated annealing using speculative computation<>icpp<>mark a. franklin<>
21618<>5163_15<>george p. copeland:gerhard weikum<>uniform object management<>edbt<>michael j. franklin<>
21648<>5163_45<>setrag khoshafian:michael j. carey<>storage management for persistent complex objects<>is<>michael j. franklin<>
40687<>5293_4<>kunsoo park<>a linear-time algorithm for concave one-dimensional dynamic programming<>ipl<>zvi galil<>
40692<>5293_9<>david eppstein:raffaele giancarlo:giuseppe f. italiano<>sparse dynamic programming<>soda<>zvi galil<>
15692<>5326_22<>esther m. arkin:l. paul chew:daniel p. huttenlocher:klara kedem<>an efficiently computable metric for comparing polygonal shapes<>soda<>joseph s. b. mitchell<>
15588<>5327_3<>patrick lincoln:andre scedrov:natarajan shankar<>decision problems for propositional linear logic<>focs<>john c. mitchell<>
15591<>5327_6<>nulo<>toward a typed foundation for method specialization and inheritance<>popl<>john c. mitchell<>
26506<>5357_111<>thomas a. henzinger<>real-time logics: complexity and expressiveness<>lics<>rajeev alur<>
24650<>5359_28<>alan fekete<>the need for headers: an impossibility result for communication over unreliable channels<>concur<>nancy a. lynch<>
24654<>5359_32<>kenneth j. goldman<>modelling shared state in a shared action model<>lics<>nancy a. lynch<>
24670<>5359_48<>alan fekete:michael merritt:william e. weihl<>commutativity-based locking for nested transactions<>jcss<>nancy a. lynch<>
24681<>5359_59<>alan fekete:william e. weihl<>a serialization graph construction for nested transactions<>pods<>nancy a. lynch<>
24687<>5359_65<>hagit attiya<>using mappings to prove timing properties<>podc<>nancy a. lynch<>
14241<>5390_9<>hamid r. berenji:yung-yaw chen:chuen-chien lee:s. murugesan<>a hierarchical approach to designing approximate reasoning-based controllers for dynamic physical systems<>uai<>jyh-shing roger jang<>
10924<>5445_14<>patricia j. eberlein<>efficient implementation of jacobi algorithms and jacobi sets on distributed memory architectures<>jpdc<>haesun park<>
34691<>5450_33<>jaideep srivastava:jau-hwang wang:jack s. eddy tan:kuo-wei hwang<>production scheduling in database production systems<>icsi<>wei-tek tsai<>
4054<>5451_15<>lawrence snyder<>a comparison of programming models for shared memory multiprocessors<>icpp<>calvin lin<>
15522<>5459_0<>odile favaron:marie-claude heydemann:dominique sotteau<>a parameter linked with g-factors and the binding number<>dm<>j. c. meyer<>
29000<>5558_27<>dhiraj k. pradhan:mark g. karpovsky<>aliasing probability for multiple input signature analyzer<>tc<>sandeep k. gupta<>
1438<>5647_2<>nulo<>exposing graph uniformities via algebraic specification<>mst<>arnold l. rosenberg<>
27498<>5672_76<>donald e. knuth:boris pittel<>stable husbands<>soda<>rajeev motwani<>
27524<>5672_102<>donald e. knuth:boris pittel<>stable husbands<>rsa<>rajeev motwani<>
17276<>5701_21<>dennis shasha<>query processing for distance metrics<>vldb<>jason tsong-li wang<>
17299<>5701_44<>dennis shasha<>new techniques for best-match retrieval<>tois<>jason tsong-li wang<>
26878<>5769_31<>nulo<>performance analysis of fddi token ring networks: effect of parameters and guidelines for setting ttrt<>sigcomm<>raj jain<>
26926<>5769_79<>k. k. ramakrishnan<>a binary feedback scheme for congestion avoidance in computer networks<>tocs<>raj jain<>
26937<>5776_0<>nulo<>the art of computer systems performance analysis<>cmg<>raj jain<>
26938<>5776_1<>nulo<>the art of computer systems performance analysis<>sigmetrics<>r. jain<>
40390<>5871_2<>tsutomu matsumoto:hideki imai<>structural properties of one-way hash functions<>crypto<>yuliang zheng<>
40435<>5871_47<>tsutomu matsumoto:hideki imai<>duality between two cryptographic primitives<>aaecc<>yuliang zheng<>
20002<>5917_6<>w. kent fuchs<>recoverable distributed shared virtual memory<>tc<>kun-lung wu<>
30642<>5945_12<>nulo<>on the closure of triangle-free graphs under substitution<>ipl<>stephan olariu<>
30650<>5945_20<>nulo<>wings and perfect graphs<>dm<>stephan olariu<>
21315<>5963_6<>chuan yi tang:richard c. t. lee<>20-relative neighborhood graphs are hamiltonian<>sigal<>maw-shang chang<>
21316<>5969_0<>weiping shi:w. kent fuchs<>optimal diagnosis procedures for k-out-of-n structures<>tc<>ming-feng chang<>
21213<>5976_0<>bart childs<>an interactive environment for literate programming<>stp<>marcus brown<>
21215<>5976_2<>bogdan d. czejdo<>a hypertext for literate programming<>icci<>m. brown<>
21217<>5976_4<>david cordes<>literate programming applied to conventional software design<>stp<>marcus brown<>
25392<>5991_2<>hector j. levesque<>performatives in a rationally based speech act theory<>acl<>philip r. cohen<>
25393<>5991_3<>hector j. levesque<>intention is choice with commitment<>ai<>philip r. cohen<>
25406<>5991_16<>hector j. levesque:jose h. t. nunes<>on acting together<>aaai<>philip r. cohen<>
24818<>6022_10<>noga alon:johan hastad:rene peralta<>simple constructions of almost k-wise independent random variables<>focs<>oded goldreich<>
24840<>6022_32<>mihir bellare:shafi goldwasser<>randomness in interactive proofs<>focs<>oded goldreich<>
24841<>6022_33<>baruch awerbuch:david peleg:ronen vainish<>a trade-off between information and communication in broadcast protocols<>jacm<>oded goldreich<>
24847<>6022_39<>nulo<>a note on computational indistinguishability<>ipl<>oded goldreich<>
24851<>6022_43<>erez petrank<>the best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols<>ipl<>oded goldreich<>
24873<>6022_65<>hugo krawczyk<>on the composition of zero-knowledge proof systems<>icalp<>oded goldreich<>
24874<>6022_66<>russell impagliazzo:leonid a. levin:ramarathnam venkatesan:david zuckerman<>security preserving amplification of hardness<>focs<>oded goldreich<>
24893<>6022_85<>baruch awerbuch:amir herzberg<>a quantitative approach to dynamic networks<>podc<>oded goldreich<>
24928<>6022_120<>ran canetti<>bounds on tradeoffs between randomness and communication complexity<>focs<>oded goldreich<>
15552<>6025_12<>walter d. potter:krys kochut:orville r. weyrich jr.<>model instantiation for query driven simulation in active kdl<>anss<>john a. miller<>
15567<>6026_0<>bonnie a. nardi<>the spreadsheet interface: a basis for end user programming<>interact<>james r. miller<>
15568<>6026_1<>bonnie a. nardi<>an ethnographic study of distributed problem solving in spreadsheet development<>cscw<>james r. miller<>
6771<>6091_12<>michael r. lowry<>algorithm theories and design tactics<>scp<>douglas r. smith<>
3378<>6093_13<>richard c. t. lee<>a parallel algorithm for solving sparse triangular systems<>tc<>chin-wen ho<>
12163<>6165_2<>michael matessa<>a rational analysis of categorization<>icml<>john r. anderson<>
36284<>6242_5<>maolin zheng<>on the maximum induced forests of a connected cubic graph without triangles<>dm<>xiaoyun lu<>
7949<>6287_7<>jennifer d. key<>affine and projective planes<>dm<>e. f. assmus jr.<>
10037<>6304_26<>kazuo iwano<>efficient sequential and parallel algorithms for planar minimum cost flow<>sigal<>hiroshi imai<>
1630<>6370_48<>nulo<>the task of the referee<>computer<>alan jay smith<>
6556<>6433_0<>malcolm p. atkinson:francois bancilhon:david j. dewitt:klaus r. dittrich:stanley b. zdonik<>the object-oriented database system manifesto<>sigmod<>david maier<>
25488<>6488_5<>zvi m. kedem<>mapping nested loop algorithms into multidimensional systolic arrays<>tpds<>peizong lee<>
4034<>6524_0<>nulo<>on certain convex matrix sets<>dm<>chi-kwong li<>
29141<>6539_4<>karon barber:david osterfeld<>expert simulation for on-line scheduling<>cacm<>sanjay jain<>
10053<>6540_1<>laxmi n. bhuyan:dipak ghosal<>approximate analysis of multiprocessing task graphs<>icpp<>hong jiang<>
28385<>6555_4<>yi deng<>a g-net model for knowledge representation and reasoning<>tkde<>shi-kuo chang<>
28413<>6555_32<>nulo<>a visual language compiler for information retrieval by visual reasoning<>tse<>shi-kuo chang<>
28421<>6555_40<>genoveffa tortora:gennaro costagliola:timothy arndt<>pyramidal algorithms for iconic indexing<>cvgip<>shi-kuo chang<>
28437<>6555_56<>bing yu<>a fuzzy visual language compiler<>vl<>shi-kuo chang<>
12087<>6557_30<>rick l. stevens<>parallel programming with algorithmic motifs<>icpp<>ian t. foster<>
12099<>6557_42<>ralph butler:anita jindal:ross a. overbeek<>a high-performance parallel theorem prover<>cade<>ian t. foster<>
12103<>6557_46<>carl kesselman:stephen taylor<>concurrency: simple concepts and powerful tools<>cj<>ian t. foster<>
40815<>6579_0<>pen-chung yew:chuan-qi zhu<>an efficient data dependence analysis for parallelizing compilers<>tpds<>zhiyuan li<>
1295<>6584_9<>doron peled<>proving partial order liveness properties<>icalp<>amir pnueli<>
1297<>6584_11<>eyal harel:orna lichtenstein<>explicit clock temporal logic<>lics<>amir pnueli<>
1354<>6584_68<>roni rosner<>distributed reactive systems are hard to synthesize<>focs<>amir pnueli<>
1388<>6584_102<>zohar manna<>a hierarchy of temporal properties<>podc<>amir pnueli<>
1396<>6584_110<>david harel:hagi lachover:amnon naamad:michal politi:rivi sherman:aharon shtull-trauring:mark b. trakhtenbrot<>statemate: a working environment for the development of complex reactive systems<>tse<>amir pnueli<>
1401<>6584_115<>oded maler<>tight bounds on the complexity of cascaded decomposition of automata<>focs<>amir pnueli<>
19791<>6649_2<>naoki shioji<>fixed point theory in weak second-order arithmetic<>apal<>kazuyuki tanaka<>
41489<>6671_4<>rudolf ahlswede<>on cloud-antichains and related configurations<>dm<>z. zhang<>
41455<>6673_16<>carl sturtivant<>efficiently inverting bijections given by straight line programs<>focs<>zhi-li zhang<>
3664<>6675_0<>john s. fitzgerald<>modularizing the formal description of a database system<>fm<>cliff b. jones<>
3672<>6675_8<>nulo<>interference revisited<>zum<>cliff b. jones<>
3697<>6676_3<>a. c. cook<>a prolog rule-based system for cartographic name placement<>cgf<>c. b. jones<>
3699<>6676_5<>nulo<>conflict resolution in cartographic name placement<>cad<>christopher b. jones<>
1872<>6684_9<>leonidas palios<>triangulating a nonconvex polytope<>dcg<>bernard chazelle<>
1884<>6684_21<>nulo<>lower bounds for orthogonal range searching ii. the arithmetic model<>jacm<>bernard chazelle<>
1888<>6684_25<>micha sharir<>an algorithm for generalized point location and its applications<>jsc<>bernard chazelle<>
1893<>6684_30<>herbert edelsbrunner:leonidas j. guibas:richard pollack:raimund seidel:micha sharir:jack snoeyink<>counting and cutting cycles of lines and rods in space<>focs<>bernard chazelle<>
1896<>6684_33<>boris aronov:herbert edelsbrunner:leonidas j. guibas:micha sharir:rephael wenger<>points and triangles in the plane and halving planes in space<>compgeom<>bernard chazelle<>
1926<>6684_63<>nulo<>triangulating a simple polygon in linear time<>focs<>bernard chazelle<>
1941<>6684_78<>nulo<>lower bounds for orthogonal range searching: i. the reporting case<>jacm<>bernard chazelle<>
1960<>6684_97<>nulo<>searching in higher dimension<>sigal<>bernard chazelle<>
37553<>6730_0<>nulo<>context-dependent similarity<>uai<>yizong cheng<>
40789<>6771_4<>karen l. kwast<>"awareness, negation and logical omniscience."<>jelia<>zhisheng huang<>
40790<>6771_5<>nulo<>logics for belief dependence<>csl<>zhisheng huang<>
5623<>6804_3<>philippe futtersack:david maier:fernando velez<>a study of three alternative workstation-server architectures for object oriented database systems<>vldb<>david j. dewitt<>
5637<>6804_17<>hui-i hsiao<>chained declustering: a new availability strategy for multiprocessor database machines<>icde<>david j. dewitt<>
5641<>6804_21<>shahram ghandeharizadeh:donovan a. schneider:allan bricker:hui-i hsiao:rick rasmussen<>the gamma database machine project<>tkde<>david j. dewitt<>
5646<>6804_26<>jim gray<>parallel database systems: the future of database processing or a passing fad?<>sigmod<>david j. dewitt<>
5650<>6807_1<>malcolm p. atkinson:francois bancilhon:klaus r. dittrich:david maier:stanley b. zdonik<>the object-oriented database system manifesto<>sigmod<>david j. dewitt<>
9082<>6831_17<>roger duke:gordon a. rose<>transferring formal techniques to industry<>forte<>graeme smith<>
5141<>6882_0<>kencheng zeng:t. r. n. rao<>an improved linear syndrome algorithm in cryptanalysis with applications<>crypto<>chung-huang yang<>
5142<>6882_1<>kencheng zeng:t. r. n. rao<>large primes in stream cipher cryptography<>asiacrypt<>chung-huang yang<>
2372<>6889_59<>nulo<>lessons from the design of the eiffel libraries<>cacm<>bertrand meyer<>
17043<>6903_40<>mark h. nodine:daniel p. lopresti<>i/o overhead and parallel vlsi architectures for lattice computations<>icci<>jeffrey scott vitter<>
17080<>6903_77<>roberto tamassia<>optimal cooperative search in fractional cascaded data structures<>spaa<>jeffrey scott vitter<>
