26575<>17_22<>nulo<>string searching algorithms revisited<>wads<>ricardo a. baeza-yates<>
26591<>17_38<>nulo<>the subsequence graph of a text<>tapsoft<>ricardo a. baeza-yates<>
26594<>17_41<>gaston h. gonnet<>efficient text searching of regular expressions<>wads<>ricardo a. baeza-yates<>
26603<>17_50<>gaston h. gonnet<>a new approach to text searching<>sigir<>ricardo a. baeza-yates<>
26610<>17_57<>nulo<>improved string searching<>spe<>ricardo a. baeza-yates<>
26631<>17_78<>nulo<>modeling splits in file structures<>acta<>ricardo a. baeza-yates<>
24096<>20_0<>nulo<>embedding planar graphs in four pages<>jcss<>mihalis yannakakis<>
25092<>25_30<>micha sharir:peter w. shor<>sharp upper and lower bounds on the length of general davenport-schinzel sequences<>jct<>pankaj k. agarwal<>
25165<>25_103<>nulo<>ray shooting and other applications of spanning trees with low stabbing number<>compgeom<>pankaj k. agarwal<>
33477<>32_68<>connie loggia ramsey<>an evaluation of expert systems for software engineering management<>tse<>victor r. basili<>
33480<>32_71<>harlan d. mills:john d. gannon:richard g. hamlet<>mathematical principles for a first course in software engineering<>tse<>victor r. basili<>
26750<>53_5<>adrian segall<>an efficient reliable ring protocol<>wdag<>reuven cohen<>
18794<>55_0<>takeshi ogihara:tohru kikuno:koji torii<>a formal adaptation method for process descriptions<>icse<>katsuro inoue<>
34559<>98_0<>simon mok<>a comparison of i/o performance of some linear recursive query processing methods<>dasfaa<>wo-shun luk<>
6594<>123_6<>nulo<>robot navigation<>ijcai<>david p. miller<>
5852<>153_123<>zvi galil<>parallel algorithmic techniques for combinatorial computation<>icalp<>david eppstein<>
27142<>203_0<>nulo<>letter from the editor<>debu<>roger king<>
17205<>221_5<>tsung-chuan huang:chu-sing yang:jau-yien lee<>graph theoretic characterization and reliability of the generalized boolean n-cube network<>pc<>jhing-fa wang<>
17179<>234_18<>steven homer<>absolute results concerning one-way functions and their applications<>mst<>jie wang<>
30924<>270_14<>isaac d. scherson<>parallel sorting in two-dimensional vlsi models of computation<>tc<>sandeep sen<>
30940<>270_30<>john h. reif<>randomized parallel algorithms<>ifip<>sandeep sen<>
29222<>280_63<>david mutchler<>a pessimistic consistency control algorithm for replicated files which achieves high availability<>tse<>sushil jajodia<>
29252<>280_93<>shashi k. gadia:gautam bhargava:edgar h. sibley<>audit trail organization in relational databases<>dbsec<>sushil jajodia<>
29261<>280_102<>david mutchler<>a hybrid replica control algorithm combining static and dynamic voting<>tkde<>sushil jajodia<>
4882<>327_2<>joseph y.-t. leung:tommy w. tam:g. h. wong<>minimizing mean flow time with error constraint<>rtss<>c. s. wong<>
23606<>333_46<>nulo<>a note on the reduction of two-way automata to one-way automata<>ipl<>moshe y. vardi<>
23666<>333_106<>joseph y. halpern<>the complexity of reasoning about knowledge and time. i. lower bounds<>jcss<>moshe y. vardi<>
33321<>361_0<>james b. kuo:robert w. dutton:bruce a. wooley<>two-dimensional transient analysis of a collector-up ecl inverter<>tcad<>tsen-shau yang<>
22752<>424_5<>michiel h. m. smid:mark de berg:marc j. van kreveld<>maintaining range trees in secondary memory. part i: partitions<>acta<>mark h. overmars<>
22779<>424_32<>micha sharir<>output-sensitive hidden surface removal<>focs<>mark h. overmars<>
22813<>424_66<>michiel h. m. smid:leen torenvliet:peter van emde boas<>two models for the reconstruction problem for dynamic data structures<>eik<>mark h. overmars<>
22815<>424_68<>dan halperin<>efficient motion planning for an l-shaped object<>compgeom<>mark h. overmars<>
22832<>424_85<>michiel h. m. smid:leen torenvliet:peter van emde boas<>maintaining multiple representations of dynamic data structures<>iandc<>mark h. overmars<>
22839<>424_92<>michiel h. m. smid<>maintaining range trees in secondary memory. part ii: lower bounds<>acta<>mark h. overmars<>
22851<>424_104<>patrick lentfert<>data structures in a real-time environment<>ipl<>mark h. overmars<>
22855<>424_108<>hans w. scholten<>general methods for adding range restrictions to decomposable searching problems<>jsc<>mark h. overmars<>
22859<>424_112<>michiel h. m. smid:leen torenvliet:peter van emde boas<>multiple representations of dynamic data structures<>ifip<>mark h. overmars<>
22875<>424_128<>patrick lentfert<>data structures in a real-time environment<>ipl<>mark h. overmars<>
19447<>485_22<>nulo<>the well founded semantics for disjunctive logic programs<>dood<>kenneth a. ross<>
19457<>485_32<>nulo<>a procedural semantics for well founded negation in logic programs<>pods<>kenneth a. ross<>
33908<>529_3<>r. h. thompson<>support for browsing in an intelligent text retrieval system<>ijmms<>w. bruce croft<>
35<>564_7<>tapas k. nayak:sarit mukherjee<>design and simulation of a parallel inference machine architecture for rule based systems<>dke<>anupam basu<>
27884<>576_1<>james r. driscoll:neil sarnak:daniel dominic sleator<>making data structures persistent<>jcss<>robert endre tarjan<>
464<>622_46<>nulo<>survival time of a random graph<>combinatorica<>alan m. frieze<>
25742<>702_6<>m. seetha lakshmi<>limiting factors of join performance on parallel processors<>icde<>philip s. yu<>
25767<>702_31<>m. seetha lakshmi<>analysis of parallel processing architectures for database systems<>icpp<>philip s. yu<>
25785<>702_49<>avraham leff:yann-hang lee<>adaptive transaction routing in a heterogeneous database environment<>icdcs<>philip s. yu<>
12321<>760_0<>darrell d. e. long<>the effect of failure and repair distributions on consistency protocols for replicated data objects<>anss<>john l. carroll<>
12322<>760_1<>darrell d. e. long:kris stewart<>estimating the reliability of regeneration-based replica control protocols<>tc<>john l. carroll<>
22554<>798_0<>nulo<>protocol engineering<>ac<>ming t. liu<>
5491<>816_0<>saeed maghsoodloo:william h. deason<>a cost model for determining the optimal number of software test cases<>tse<>david b. brown<>
5495<>816_4<>kai-hsiung chang:james h. cross ii:w. homer carlisle<>an intelligent test data generator for software branch coverage<>seke<>david b. brown<>
5496<>817_0<>christopher l. huntley:andrew r. spillane<>a parallel genetic heuristic for the quadratic assignment problem<>icga<>donald e. brown<>
5473<>818_9<>rahul bansal<>using design history systems for technology transfer<>mitjsme<>david c. brown<>
21258<>832_27<>nulo<>functional specification of time sensitive communicating systems<>rex<>manfred broy<>
22968<>956_83<>bryan preas:d. curry<>automatic layout of silicon-on-silicon hybrid packages<>dac<>massoud pedram<>
32010<>988_38<>brian n. bershad:edward d. lazowska:henry m. levy<>lightweight remote procedure call<>sosp<>thomas e. anderson<>
38480<>1099_17<>yu-chin hsu:fur-shing tsai<>silk: a simulated evolution router<>tcad<>youn-long lin<>
1557<>1193_2<>jonathan schaeffer:mark green<>structuring distributed algorithms in a workstation environment: the frameworks approach<>icpp<>ajit singh<>
19875<>1276_34<>m. howard williams<>a type driven hardware engine for prolog clause retrieval over a large knowledge base<>isca<>kam-fai wong<>
16131<>1441_5<>sandeep sen<>randomized parallel algorithms<>ifip<>john h. reif<>
16135<>1441_9<>ramamohan paturi:sanguthevar rajasekaran<>the light bulb problem<>colt<>john h. reif<>
16137<>1441_11<>dan e. willard<>parallel processing can be harmful: the unusual behavior of interpolation search<>iandc<>john h. reif<>
16174<>1441_48<>sanguthevar rajasekaran<>optimal and sublogarithmic time randomized parallel sorting algorithms<>siamcomp<>john h. reif<>
16196<>1441_70<>sandeep sen<>polling: a new randomized sampling technique for computational geometry<>stoc<>john h. reif<>
16229<>1441_103<>stephen r. tate<>optimal size integer division circuits<>stoc<>john h. reif<>
13135<>1465_14<>ed anderson<>evaluating block algorithm variants in lapack<>ppsc<>jack dongarra<>
30243<>1486_0<>mark klein<>conflict resolution in cooperative design<>aei<>stephen c. y. lu<>
30256<>1486_13<>bruce l. lambert:david k. tcheng<>generalized recursive splitting algorithms for learning hybrid concepts<>icml<>stephen c. y. lu<>
30258<>1486_15<>david k. tcheng:bruce l. lambert:larry a. rendell<>building robust learning systems by combining induction and optimization<>ijcai<>stephen c. y. lu<>
12944<>1499_93<>khe-sing the:d. f. wong<>via minimization by layout modification<>dac<>jason cong<>
8206<>1532_33<>mariagiovanna sami:renato stefanelli<>reconfiguration of vlsi arrays by covering<>tcad<>fabrizio lombardi<>
19092<>1563_11<>man hon wong:w. lam<>a fuzzy expert database system<>dke<>kwong-sak leung<>
19104<>1563_23<>w. lam<>a fuzzy expert system shell using both exact and inexact reasoning<>jar<>kwong-sak leung<>
37435<>1609_2<>wen-tsuen chen:gen-huey chen:jang-ping sheu<>reducing time complexities of semigroup computations on mesh-connected computers with multiple broadcasting<>icpp<>yen-cheng chen<>
37382<>1616_3<>nulo<>analysis of lotka's law: the simon-yule approach<>ipm<>ye-sho chen<>
41094<>1783_30<>amir pnueli<>completing the temporal picture<>icalp<>zohar manna<>
8824<>1796_18<>mikhail j. atallah:s. rao kosaraju:lawrence l. larmore:shang-hua teng<>constructing trees in parallel<>spaa<>gary l. miller<>
8875<>1797_0<>peter m. todd:shailesh u. hegde<>designing neural networks using genetic algorithms<>icga<>geoffrey f. miller<>
38955<>1870_17<>baruch schieber<>finding the edge connectivity of directed graphs<>jal<>yishay mansour<>
38968<>1870_30<>david bernstein:dina q. goldin:martin charles golumbic:hugo krawczyk:itai nahshon:ron y. pinter<>spill code minimization techniques for optimizing compilers<>pldi<>yishay mansour<>
38981<>1870_43<>baruch schieber<>the intractability of bounded protocols for non-fifo channels<>podc<>yishay mansour<>
38999<>1870_61<>nathan linial:noam nisan<>"constant depth circuits, fourier transform, and learnability"<>focs<>yishay mansour<>
39024<>1870_86<>ornan ori gerstel:shmuel zaks<>bit complexity of order statistics on a distributed star network<>ipl<>yishay mansour<>
39029<>1870_91<>oded goldreich:amir herzberg<>source to destination communication in the presence of faults<>podc<>yishay mansour<>
39040<>1870_102<>shai ben-david:gyora m. benedek<>a parametrization scheme for classifying models of learnability<>colt<>yishay mansour<>
39041<>1870_103<>baruch schieber:prasoon tiwari<>lower bounds for computations with the floor operation<>icalp<>yishay mansour<>
9483<>1943_18<>nulo<>achromatic number is np-complete for cographs and interval graphs<>ipl<>hans l. bodlaender<>
9498<>1943_33<>nulo<>on linear time minor tests and depth first search<>wads<>hans l. bodlaender<>
9545<>1943_80<>nulo<>the classification of coverings of processor networks<>jpdc<>hans l. bodlaender<>
9551<>1943_86<>nulo<>achromatic number is np-complete for cographs and interval graphs<>ipl<>hans l. bodlaender<>
9583<>1943_118<>shlomo moran:manfred k. warmuth<>the distributed bit complexity of the ring: from the anonymous to the non-anonymous case<>fct<>hans l. bodlaender<>
9591<>1943_126<>nulo<>improved self-reduction algorithms for graphs with bounded treewidth<>wg<>hans l. bodlaender<>
9179<>1961_0<>jim brinkley:ramin samadani:c. robert clauer<>model-driven image analysis to augment databases<>vdb<>gio wiederhold<>
9182<>1961_3<>marianne winslett:david w. knapp:k. hall<>use of change coordination in an information-rich design environment<>dac<>gio wiederhold<>
9195<>1961_16<>stefano ceri:georg gottlob<>efficient database access from prolog<>tse<>gio wiederhold<>
27899<>1997_9<>anne f. brindle:david f. martin<>a debugger for ada tasking<>tse<>richard n. taylor<>
27919<>1997_29<>michal young<>rethinking the taxonomy of fault detection techniques<>icse<>richard n. taylor<>
4417<>2008_7<>nulo<>performance engineering of software systems<>cmg<>connie u. smith<>
16258<>2037_1<>v. venkatakrishnan<>domain decomposition methods in aerodynamics<>ppsc<>joel h. saltz<>
16262<>2037_5<>ravi mirchandaney:kathleen crowley<>the doconsider loop<>ics<>joel h. saltz<>
16266<>2037_9<>harry berryman:jeffrey s. scroggs<>execution time support for scientific programs on distributed memory machines<>ppsc<>joel h. saltz<>
24562<>2083_118<>nulo<>separable codes for detecting unidirectional errors<>tcad<>niraj k. jha<>
24586<>2083_142<>nulo<>a totally self-checking checker for borden's code<>tcad<>niraj k. jha<>
14449<>2148_1<>sudhakar m. reddy<>on the design of fault-tolerant two-dimensional systolic arrays for yield enhancement<>tc<>jung hwan kim<>
31307<>2174_1<>nulo<>an auditory display for exploratory visualization of multidimensional data<>wfe<>s. smith<>
31240<>2180_9<>gary a. cleveland<>using genetic algorithms to schedule flow shop releases<>icga<>stephen f. smith<>
7029<>2268_21<>nulo<>on wu's method for proving constructive geometric theorems<>ijcai<>dongming wang<>
23384<>2280_24<>david gedye:randy h. katz:r. newton<>protection and versioning for oct<>dac<>mario j. silva<>
27780<>2308_39<>giuseppe di battista:ioannis g. tollis<>area requirement and symmetry display in drawing graphs<>compgeom<>roberto tamassia<>
27793<>2308_52<>franco p. preparata<>fully dynamic point location in a monotone subdivision<>siamcomp<>roberto tamassia<>
27799<>2308_58<>jeffrey scott vitter<>optimal parallel algorithms for transitive closure and point location in planar structures<>spaa<>roberto tamassia<>
27800<>2308_59<>giuseppe di battista:hannu kangassalo<>definition libraries for conceptual modelling<>dke<>roberto tamassia<>
27851<>2308_110<>franco p. preparata<>dynamic planar point location with optimal query time<>stacs<>roberto tamassia<>
16056<>2396_0<>myunghwan kim<>a selection algorithm with a practical upper bound on expected number<>spe<>jong soo park<>
1862<>2618_11<>noga alon<>graphs with a small number of distinct induced subgraphs<>dm<>bala bollobas<>
30988<>2683_20<>yuri gurevich<>nearly linear time<>ershov<>saharon shelah<>
30990<>2683_22<>steven buechler<>on the existence of regular types<>apal<>saharon shelah<>
30995<>2683_27<>alan h. mekler<>uniformization principles<>jsyml<>saharon shelah<>
31037<>2683_69<>simon thomas<>subgroups of small index in infinite symmetric groups ii<>jsyml<>saharon shelah<>
31045<>2683_77<>tomek bartoszynski:jaime i. ihoda<>the cofinality of cardinal invariants related to measure and category<>jsyml<>saharon shelah<>
31083<>2683_115<>yuri gurevich<>time polynomial in input or output<>jsyml<>saharon shelah<>
21274<>2703_5<>luc de raedt<>towards friendly concept-learners<>ijcai<>maurice bruynooghe<>
21275<>2703_6<>luc de raedt<>constructive induction by analogy<>icml<>maurice bruynooghe<>
32387<>2821_0<>k. s. raman:richard t. watson<>group decision support systems: the cultural factor<>icis<>teck hua ho<>
22172<>2829_0<>stephen c. y. lu<>conflict resolution in cooperative design<>aei<>mark klein<>
28087<>2840_1<>nulo<>where can i get gas round here? - an application of a design methodology for distributed systems<>am<>rainer weber<>
28101<>2845_9<>yair wand<>a model of systems decomposition<>icis<>ron weber<>
4920<>2852_7<>geoffrey m. brown:mohamed g. gouda<>token systems that self-stabilize<>tc<>chuan-lin wu<>
6178<>2855_6<>chien-chun chou:debra renk:steven c. bruell<>experience with concurrent simulation<>wsc<>douglas w. jones<>
6180<>2855_8<>nulo<>concurrent operations on priority queues<>cacm<>douglas w. jones<>
38075<>2869_3<>myung ho kim<>spex: a method for specifying the dynamics of structured specifications including control information<>acj<>yong rae kwon<>
28059<>2871_10<>costas courcoubetis:p. konstantopoulos:jean c. walrand<>stabilizing an uncertain production system<>questa<>richard r. weber<>
10490<>2881_1<>derek c. w. pao:r. jayakumar<>improvements and systolic implementation of the hough transformation for straight line detection<>pr<>hon f. li<>
10491<>2881_2<>rajagopalan jayakumar:m. youssef<>parallel algorithms for recognizing handwritten characters using shape features<>pr<>hon f. li<>
26225<>2902_10<>laxmi n. bhuyan:dharma p. agrawal<>performance of multiprocessor interconnection networks<>computer<>qing yang<>
26188<>2903_90<>dana s. nau<>preprocessing search spaces for branch and bound search<>ijcai<>qiang yang<>
26243<>2915_1<>laxmi n. bhuyan:bao-chyn liu<>analysis and comparison of cache coherence protocols for a packet-switched multiprocessor<>tc<>qing yang<>
26244<>2915_2<>laxmi n. bhuyan:dipak ghosal<>approximate analysis of single and multiple ring networks<>tc<>qing yang<>
950<>2949_22<>michael stonebraker<>performance considerations for an operating system transaction manager<>tse<>akhil kumar<>
19547<>3044_28<>ben a. blake:win bo:j. gawkowski<>global data and control in multicomputers: operating system primitives and experimentation with a parallel branch-and-bound algorithm<>concurrency<>karsten schwan<>
19562<>3044_43<>cheryl gaimon<>automating resource allocation for multiprocessors<>jss<>karsten schwan<>
19584<>3044_65<>prabha gopinath<>chaos: why one cannot have only an operating system for real-time applications<>sigops<>karsten schwan<>
19596<>3044_77<>thomas e. bihari:prabha gopinath<>object-oriented design of real-time software<>rtss<>karsten schwan<>
13531<>3047_5<>moshe y. vardi<>the complexity of reasoning about knowledge and time. i. lower bounds<>jcss<>joseph y. halpern<>
13617<>3047_91<>mark r. tuttle<>"knowledge, probability, and adversaries."<>podc<>joseph y. halpern<>
13648<>3047_122<>ronald fagin<>modelling knowledge and action in distributed systems<>dc<>joseph y. halpern<>
13669<>3047_143<>ronald fagin<>"uncertainty, belief, and probability."<>ijcai<>joseph y. halpern<>
13690<>3047_164<>steven m. german:edmund m. clarke<>reasoning about procedures as parameters in the language l4<>iandc<>joseph y. halpern<>
13696<>3047_170<>nulo<>an analysis of first-order logics of probability<>ijcai<>joseph y. halpern<>
29390<>3060_13<>jon salkild<>the spineless tagless g-machine<>fpca<>simon l. peyton jones<>
29408<>3060_31<>nulo<>parallel implementations of functional programming languages<>cj<>simon l. peyton jones<>
29429<>3060_52<>chris d. clack:jon salkild<>high-performance parallel graph reduction<>parle<>simon l. peyton jones<>
30030<>3160_0<>nulo<>universality of mobility-gate field characteristics of electrons in the inversion charge layer and its application in mosfet modeling<>tcad<>shiuh-wuu lee<>
6825<>3164_9<>jeff mcaffer:brian m. barry<>actra-a multitasking/multiprocessing smalltalk<>sigplan<>dave a. thomas<>
4372<>3200_1<>xanthippi markenscoff<>optimum grip of a polygon<>ijrr<>christos h. papadimitriou<>
8641<>3327_1<>yen-cheng chen:wen-tsuen chen:jang-ping sheu<>reducing time complexities of semigroup computations on mesh-connected computers with multiple broadcasting<>icpp<>gen-huey chen<>
20255<>3330_1<>david j. montana<>training feedforward neural networks using genetic algorithms<>ijcai<>lawrence davis<>
20256<>3330_2<>nulo<>mapping neural networks into classifier systems<>icga<>lawrence davis<>
1234<>3411_95<>nulo<>searching with known error probability<>tcs<>andrzej pelc<>
1255<>3411_116<>jurek czyzowicz:daniele mundici<>ulam's searching game with lies<>jct<>andrzej pelc<>
1257<>3411_118<>nulo<>weakly adaptive comparison searching<>tcs<>andrzej pelc<>
9756<>3421_3<>nulo<>optimal intensity control of a multi-class queue<>questa<>h. chen<>
16744<>3449_58<>richard hull<>"untyped sets, invention, and computable queries."<>pods<>jianwen su<>
30066<>3456_3<>nulo<>dynamic programming by exchangeability<>siamcomp<>shuo-yen robert li<>
26700<>3504_6<>nulo<>on the structure of bounded queries to arbitrary np sets<>coco<>richard chang<>
18040<>3526_9<>p. a. subrahmanyam<>on the completeness of narrowing for e-unification<>kbcs<>jia-huai you<>
18050<>3526_19<>liwu li<>supported circumscription and its relation to logic programming with negation<>slp<>jia-huai you<>
9031<>3580_11<>andrzej ehrenfeucht<>partial (set) 2-structures. part ii: state spaces of concurrent systems<>acta<>grzegorz rozenberg<>
9049<>3580_29<>dirk janssens<>actor grammars<>mst<>grzegorz rozenberg<>
16609<>3617_4<>nulo<>practical problems with a cryptographic protection scheme<>crypto<>jonathan m. smith<>
8290<>3772_29<>d. t. lee<>parallel batched planar point location on the ccc<>ipl<>franco p. preparata<>
8312<>3772_51<>gianfranco bilardi<>size-time complexity of boolean networks for prefix computations<>jacm<>franco p. preparata<>
8327<>3772_66<>panagiotis alevizos:jean-daniel boissonnat<>on the boundary of a union of rays<>stacs<>franco p. preparata<>
8333<>3772_72<>roberto tamassia<>dynamic planar point location with optimal query time<>stacs<>franco p. preparata<>
8336<>3772_75<>roberto tamassia<>fully dynamic point location in a monotone subdivision<>siamcomp<>franco p. preparata<>
8350<>3772_89<>nulo<>holographic dispersal and recovery of information<>tit<>franco p. preparata<>
8381<>3772_120<>scot w. hornick<>deterministic p-ram simulation with constant redundancy<>spaa<>franco p. preparata<>
32604<>3781_49<>c. h. chien<>distributed quadtree processing<>ssd<>takeo kanade<>
32642<>3782_0<>john bares:martial hebert:eric krotkov:tom m. mitchell:reid g. simmons:william whittaker<>ambler: an autonomous rover for planetary exploration<>computer<>takeo kanade<>
13347<>3809_3<>nulo<>an implementation of an efficient algorithm for bisimulation equivalence<>scp<>jean-claude fernandez<>
13300<>3841_4<>nulo<>the power to two-way deterministic checking stack automata<>iandc<>joost engelfriet<>
38164<>3894_29<>kang g. shin:c. mani krishna<>optimal dynamic control of resources in a distributed system<>tse<>yann-hang lee<>
38176<>3894_41<>avraham leff:philip s. yu<>adaptive transaction routing in a heterogeneous database environment<>icdcs<>yann-hang lee<>
2469<>3975_89<>ron sacks-davis:ken j. mcdonell<>extending a dbms for geographic applications<>icde<>beng chin ooi<>
2478<>3975_98<>hock t. ch'ng:b. sprinivasan<>study of self-organizing heuristics for skewed access patterns<>ipl<>beng chin ooi<>
14264<>3995_1<>teresa l. roberts:william verplank:david canfield smith:charles h. irby:marian beard:kevin mackey<>the xerox star: a retrospective<>computer<>jeff a. johnson<>
33147<>4000_46<>fausto giunchiglia<>abstract theorem proving<>ijcai<>toby walsh<>
33590<>4070_1<>jerry place:gi-chul yang<>a superior algorithm for mutual exclusion in computer networks - vishnu<>ifip<>vijay kumar<>
33609<>4070_20<>nulo<>a concurrency control mechanism based on extendible hashing for main memory database systems<>acm<>vijay kumar<>
33794<>4083_2<>yen-cheng chen:gen-huey chen:jang-ping sheu<>reducing time complexities of semigroup computations on mesh-connected computers with multiple broadcasting<>icpp<>wen-tsuen chen<>
27056<>4105_45<>yanjun zhang<>on parallel evaluation of game trees<>spaa<>richard m. karp<>
27085<>4105_74<>garth a. gibson:lisa hellerstein:randy h. katz:david a. patterson<>failure correction techniques for large disk arrays<>asplos<>richard m. karp<>
27110<>4105_99<>michael luby:neal madras<>monte-carlo approximation algorithms for enumeration problems<>jal<>richard m. karp<>
26309<>4169_0<>simon s. haykin:p. yip<>performance limits of the innovations-based detection algorithm<>tit<>qitu zhang<>
16610<>4270_0<>gerald q. maguire jr.<>"exploring ""multiple worlds"" in parallel."<>icpp<>jonathan m. smith<>
22640<>4280_3<>moti yung<>universal one-way hash functions and their cryptographic applications<>stoc<>moni naor<>
22665<>4280_28<>joseph naor:alejandro a. schaffer<>fast parallel algorithms for chordal graphs<>siamcomp<>moni naor<>
22673<>4280_36<>russell impagliazzo<>efficient cryptographic schemes provably as secure as subset sum<>focs<>moni naor<>
22679<>4280_42<>rajeev motwani:joseph naor<>the probabilistic method yields deterministic parallel algorithms<>focs<>moni naor<>
22694<>4280_57<>amos fiat<>implicit o(1) probe search<>stoc<>moni naor<>
22717<>4280_80<>david feldman:russell impagliazzo:noam nisan:steven rudich:adi shamir<>on dice and coins: models of computation for random generation<>icalp<>moni naor<>
25633<>4324_4<>edward y. y. zhang<>a fast and flexible thinning algorithm<>tc<>patrick shen-pei wang<>
20100<>4366_2<>dennis shasha<>fast parallel algorithms for the unit cost editing distance between trees<>spaa<>kaizhong zhang<>
9253<>4388_16<>wolfgang gutjahr:emo welzl<>polynomial graph-colorings<>stacs<>gerhard j. woeginger<>
3190<>4443_2<>inder s. gopal<>linear broadcast routing<>jal<>ching-tsun chou<>
11005<>4566_28<>robert e. webber<>a comparison of the space requirements of multi-dimensional quadtree-based file structures<>vc<>hanan samet<>
11012<>4566_35<>chuan-heng ang<>node distribution in a pr quadtree<>ssd<>hanan samet<>
11062<>4566_85<>nulo<>hierarchical spatial data structures<>ssd<>hanan samet<>
11084<>4566_107<>nulo<>implementing ray tracing with octrees and neighbor finding<>cg<>hanan samet<>
11115<>4566_138<>nulo<>neighbor finding in images represented by octrees<>cvgip<>hanan samet<>
7265<>4585_7<>nulo<>a probabilistic approach to marker propagation<>ijcai<>dekai wu<>
34157<>4616_0<>nulo<>chair's message<>sigmod<>won kim<>
34162<>4616_5<>nulo<>chair's message<>sigmod<>won kim<>
5139<>4638_0<>mark chao kuen yang<>image enhancement for segmentation by self-induced autoregressive filtering<>pami<>chung-chun yang<>
11345<>4639_0<>lu xu:hanpei koike<>distributed garbage collection for the parallel inference machine pie64<>ifip<>hidehiko tanaka<>
11338<>4654_26<>lu xu:hanpei koike<>distributed garbage collection for the parallel inference engine pie64<>slp<>hidehiko tanaka<>
17520<>4701_4<>youngdon kang<>distributed and fail-safe routing algorithms in toroidal-based metropolitan area networks<>cn<>jonny s. k. wong<>
17463<>4757_1<>andrew rutherford<>models of mental models: an ergonomist-psychologist dialogue<>ipsy<>john r. wilson<>
6901<>4786_3<>ruth kuchem:frank wagner<>area-optimal three-layer channel routing<>focs<>dorothea wagner<>
6950<>4788_1<>brian alspach:paul j. schellenberg:douglas r. stinson<>the oberwolfach problem and factors of uniform odd length cycles<>jct<>david wagner<>
11261<>4800_4<>wei-min shen<>rule creation and rule learning through environmental exploration<>ijcai<>herbert a. simon<>
10142<>4874_0<>mark e. watkins<>the connectivities of locally finite primitive graphs<>combinatorica<>heinz adolf jung<>
33039<>4985_17<>hisao tamaki<>existential continuation<>ngc<>taisuke sato<>
24931<>5073_1<>tao jiang:hui wang<>parallel parsing on a one-way linear array of finite-state machines<>fsttcs<>oscar h. ibarra<>
24946<>5073_16<>tao jiang:jik h. chang<>on iterative and cellular tree arrays<>jcss<>oscar h. ibarra<>
24977<>5073_47<>tao jiang<>optimal simulation of tree arrays by linear arrays<>ipl<>oscar h. ibarra<>
25012<>5073_82<>stephen m. sohn<>on mapping systolic algorithms onto the hypercube<>icpp<>oscar h. ibarra<>
25025<>5073_95<>michael a. palis<>an efficient all-parses systolic algorithm for general context-free parsing<>wads<>oscar h. ibarra<>
24196<>5078_4<>i. algor<>the star arboricity of graphs<>dm<>noga alon<>
24226<>5078_34<>yair caro:ilia krasikov:yehuda roditty<>combinatorial reconstruction problems<>jct<>noga alon<>
24229<>5078_37<>bala bollobas<>graphs with a small number of distinct induced subgraphs<>dm<>noga alon<>
24271<>5078_79<>nathan linial<>cycles of length 0 modulo  in directed graphs<>jct<>noga alon<>
24278<>5078_86<>paul erdos<>disjoint edges in geometric graphs<>dcg<>noga alon<>
32311<>5081_121<>rajeev alur<>a really temporal logic<>focs<>thomas a. henzinger<>
35203<>5082_25<>krithi ramamritham:john a. stankovic<>distributed scheduling of tasks with deadlines and resource requirements<>tc<>wei zhao<>
2993<>5094_2<>young-fu chang:lin yang:ching-roung chou:jong-jeng chen<>modeling a real-time multitasking system in a timed pq net<>software<>carl k. chang<>
2994<>5094_3<>tsang ming jiang<>a binary single-key-lock system for access control<>tc<>carl k. chang<>
3260<>5126_0<>ren-dar yang<>testing concurrent ada program with reproducible test cases<>seke<>chyan-goei chung<>
22352<>5148_31<>giuseppe di battista<>a deductive method for entity-relationship modeling<>vldb<>maurizio lenzerini<>
24104<>5150_0<>marek chrobak<>fast algorithms for edge-coloring planar graphs<>jal<>moti yung<>
4552<>5220_33<>worthy n. martin<>an analysis of a distributed multiresolution vision system<>pr<>chew lim tan<>
33651<>5242_0<>edmund h. durfee:daniel d. corkill<>trends in cooperative distributed problem solving<>tkde<>victor r. lesser<>
28113<>5260_1<>fan r. k. chung:ronald l. graham<>quasi-random graphs<>combinatorica<>richard m. wilson<>
40686<>5293_3<>ravi kannan:endre szemeredi<>on 3-pushdown graphs with large separators<>combinatorica<>zvi galil<>
40691<>5293_8<>david eppstein<>parallel algorithmic techniques for combinatorial computation<>icalp<>zvi galil<>
15655<>5327_70<>luca cardelli<>operations on records<>mfps<>john c. mitchell<>
2534<>5328_38<>dorothy brethauer:catherine plaisant:richard potter<>evaluating three museum installations of a hypertext system<>jasis<>ben shneiderman<>
37237<>5335_0<>carl k. chang:lin yang:ching-roung chou:jong-jeng chen<>modeling a real-time multitasking system in a timed pq net<>software<>young-fu chang<>
26404<>5357_9<>thomas a. henzinger<>a really temporal logic<>focs<>rajeev alur<>
24627<>5359_5<>alan fekete:michael merritt:william e. weihl<>commutativity-based locking for nested transactions<>pos<>nancy a. lynch<>
24644<>5359_22<>hagit attiya<>time bounds for real-time process control in the presence of timing uncertainty<>rtss<>nancy a. lynch<>
24659<>5359_37<>nulo<>multivalued possibilities mappings<>rex<>nancy a. lynch<>
24730<>5359_108<>eugene w. stark<>a proof of the kahn principle for input/output automata<>iandc<>nancy a. lynch<>
24775<>5359_153<>michael j. fischer:james e. burns:allan borodin<>distributed fifo allocation of identical resources using small shared space<>toplas<>nancy a. lynch<>
14181<>5386_0<>nulo<>why functional programming matters<>cj<>john hughes<>
10918<>5445_8<>franklin t. luk<>a proof of convergence for two parallel jacobi svd algorithms<>tc<>haesun park<>
34693<>5449_0<>wei-tek tsai:c. v. ramamoorthy:osamu nishiguchi<>an adaptive hierarchical routing protocol<>tc<>wei kang tsai<>
34662<>5450_4<>chungti liang:yigang chen<>embedding of linear array and binary tree in cubical ring connected cycles networks<>icpp<>wei-tek tsai<>
15419<>5453_15<>nulo<>hardware and software dependability evaluation: future trends<>ifip<>john f. meyer<>
15423<>5453_19<>william h. sanders<>reduced base model construction methods for stochastic activity networks<>pnpm<>john f. meyer<>
15426<>5456_0<>roel wieringa:hans weigand<>specifying dynamic and deontic integrity constraints<>dke<>john-jules ch. meyer<>
15498<>5456_72<>ernst-rudiger olderog<>hiding in stream semantics of uniform concurrency<>acta<>john-jules ch. meyer<>
8612<>5569_0<>nulo<>computing the normal forms of matrices depending on parameters<>issac<>guoting chen<>
31778<>5578_3<>nulo<>a pumping lemma for deterministic context-free languages<>ipl<>s. yu<>
1437<>5647_1<>sandeep n. bhatt:fan r. k. chung:frank thomson leighton<>universal graphs for bounded-degree trees and planar graphs<>siamdm<>arnold l. rosenberg<>
8682<>5648_25<>nulo<>parallel computing comes of age: supercomputer level parallel computations at caltech<>concurrency<>geoffrey fox<>
27459<>5672_37<>joseph naor:moni naor<>the probabilistic method yields deterministic parallel algorithms<>focs<>rajeev motwani<>
27465<>5672_43<>arvind raghunathan:huzur saran<>perfect graphs and orthogonally convex covers<>siamdm<>rajeev motwani<>
24091<>5753_6<>chung-chun yang<>image enhancement for segmentation by self-induced autoregressive filtering<>pami<>mark chao kuen yang<>
26893<>5769_46<>nulo<>characteristics of destination address locality in computer networks: a comparison of caching schemes<>cn<>raj jain<>
7837<>5877_34<>qi fan chen:lenwood s. heath:s. datta<>a more cost effective algorithm for finding perfect hash functions<>acm<>edward a. fox<>
20005<>5917_9<>w. kent fuchs:janak h. patel<>cache-based error recovery for shared memory multiprocessor systems<>icpp<>kun-lung wu<>
30630<>5945_0<>j. randall<>welsh-powell opposition graphs<>ipl<>stephan olariu<>
30632<>5945_2<>nulo<>the strong perfect graph conjecture for pan-free graphs<>jct<>stephan olariu<>
30641<>5945_11<>henry meyniel<>a new conjecture about minimal imperfect graphs<>jct<>stephan olariu<>
30643<>5945_13<>nulo<>weak bipolarizable graphs<>dm<>stephan olariu<>
21229<>5964_0<>thomas a. defanti:bruce h. mccormick<>visualization: expanding scientific and engineering research opportunities<>computer<>maxine d. brown<>
19692<>5985_30<>nulo<>cooperative negotiation in concurrent engineering design<>mitjsme<>katia p. sycara<>
19697<>5985_35<>nulo<>argumentation: planning other agents' plans<>ijcai<>katia p. sycara<>
24905<>6022_97<>shai ben-david:benny chor:michael luby<>on the theory of average case complexity<>stoc<>oded goldreich<>
15542<>6025_2<>orville r. weyrich jr.<>query driven simulation using simodula<>anss<>john a. miller<>
6782<>6091_23<>michael r. lowry<>algorithm theories and design tactics<>mpc<>douglas r. smith<>
3370<>6093_5<>richard c. t. lee<>counting clique trees and computing perfect elimination schemes in parallel<>ipl<>chin-wen ho<>
38552<>6122_2<>chungching wang<>analysis of prioritized crossbar multiprocessor systems<>jpdc<>yu-cheng liu<>
12158<>6178_1<>frederick g. conrad:albert t. corbett<>skill acquisition and the lisp tutor<>cogsci<>john r. anderson<>
7894<>6286_27<>frank thomson leighton<>a provably efficient algorithm for dynamic storage allocation<>jcss<>edward g. coffman jr.<>
10034<>6304_23<>keiko imai:s. sumino<>minimax geometric fitting of two corresponding sets of points<>compgeom<>hiroshi imai<>
10042<>6304_31<>hubert de fraysseix<>notes on oriented depth-first search and longest paths<>ipl<>h. imai<>
702<>6348_0<>hazel everett<>acyclic directed hypercubes may have exponential diameter<>ipl<>a. gupta<>
1598<>6370_16<>rafael h. saavedra-barrera:eugene miya<>machine characterization based on an abstract high-level language machine<>tc<>alan jay smith<>
1613<>6370_31<>mark d. hill<>evaluating associativity in cpu caches<>tc<>alan jay smith<>
1631<>6370_49<>nulo<>cpu cache memories<>sigmetrics<>alan jay smith<>
6554<>6408_0<>don s. batory:philip a. bernstein:umeshwar dayal:laura m. haas:theo harder:won kim:gerard salton:gio wiederhold<>acm tods publication policy<>sigmod<>david maier<>
6557<>6433_1<>malcolm p. atkinson:francois bancilhon:david j. dewitt:klaus r. dittrich:stanley b. zdonik<>the object-oriented database system manifesto<>dood<>david maier<>
25498<>6486_1<>blake hannaford<>hidden markov model analysis of force/ torque information in telemanipulation<>iser<>paul lee<>
25484<>6488_1<>zvi m. kedem<>mapping nested loop algorithms into multi-dimensional systolic arrays<>icpp<>peizong lee<>
25492<>6488_9<>albert yang:kee yip:jeffrey wu<>sysdes: a systolic array automation design system<>ppsc<>peizong lee<>
29140<>6539_3<>karon barber:david osterfeld<>expert simulation for on-line scheduling<>wsc<>sanjay jain<>
10086<>6540_34<>laxmi n. bhuyan:dipak ghosal<>from interconnection network to task level analysis<>icpp<>hong jiang<>
10089<>6540_37<>dipak ghosal:satish k. tripathi:laxmi n. bhuyan<>analysis of computation-communication issues in dynamic dataflow architectures<>isca<>hong jiang<>
28398<>6555_17<>hsing-lung chen<>assignment of objects in a dual processor system with limited objects<>seke<>shi-kuo chang<>
28448<>6555_67<>michael j. tauber:bing yu:jing-sheng yu<>a visual language compiler<>tse<>shi-kuo chang<>
28459<>6555_78<>erland jungert<>an algebra for symbolic image manipulation and transformation<>vdb<>shi-kuo chang<>
12064<>6557_7<>stephen taylor<>strand: a practical parallel programming tool<>slp<>ian t. foster<>
12068<>6557_11<>nulo<>implementation of a declarative state-transition system<>spe<>ian t. foster<>
12105<>6557_48<>steve gregory:alastair d. burt:graem a. ringwood<>an abstract machine for the implementation of parlog on uniprocessors<>ngc<>ian t. foster<>
40820<>6579_5<>edward m. reingold<>solution of a divide-and-conquer maximin recurrence<>siamcomp<>zhiyuan li<>
1309<>6584_23<>zohar manna<>completing the temporal picture<>icalp<>amir pnueli<>
19765<>6645_5<>richard hull:masatoshi yoshikawa<>"behavior analysis of object-oriented databases: method structure, execution trees, and reachability (extended abstract)."<>fodo<>katsumi tanaka<>
19776<>6645_16<>tae-soo chang<>alternative objects in object-oriented databases<>dasfaa<>katsumi tanaka<>
19778<>6645_18<>tae-soo chang<>on natural joins in object-oriented databases<>dood<>katsumi tanaka<>
41486<>6671_1<>rudolf ahlswede<>coding for write-efficient memory<>iandc<>zhen zhang<>
1902<>6684_39<>leonidas j. guibas<>visibility and intersection problems in plane geometry<>dcg<>bernard chazelle<>
1944<>6684_81<>burton rosenberg<>computing partial sums in multidimensional arrays<>compgeom<>bernard chazelle<>
1949<>6684_86<>herbert edelsbrunner:leonidas j. guibas<>the complexity of cutting complexes<>dcg<>bernard chazelle<>
37556<>6730_3<>rangasami l. kashyap<>a study of associative evidential reasoning<>pami<>yizong cheng<>
37558<>6730_5<>nulo<>building shallow expert systems using back-propagation learning<>ieaaie<>y. cheng<>
751<>6789_3<>alex waibel<>incremental parsing by modular recurrent connectionist networks<>nips<>ajay n. jain<>
5639<>6804_19<>donovan a. schneider<>a performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment<>sigmod<>david j. dewitt<>
5649<>6807_0<>malcolm p. atkinson:francois bancilhon:klaus r. dittrich:david maier:stanley b. zdonik<>the object-oriented database system manifesto<>dood<>david j. dewitt<>
5178<>6865_0<>tsung-chuan huang:jhing-fa wang:jau-yien lee<>graph theoretic characterization and reliability of the generalized boolean n-cube network<>pc<>chu-sing yang<>
17009<>6903_6<>kenneth basye:thomas dean<>coping with uncertainty in map learning<>ijcai<>jeffrey scott vitter<>
