26600<>17_47<>nulo<>some average measures in m-ary search trees<>ipl<>ricardo a. baeza-yates<>
33432<>32_23<>richard w. selby:terry baker<>cleanroom software development: an empirical evaluation<>tse<>victor r. basili<>
33439<>32_30<>h. dieter rombach<>tailoring the software process to project goals and environments<>icse<>victor r. basili<>
33443<>32_34<>harlan d. mills:john d. gannon:richard g. hamlet<>teaching principles of computer programming<>acm<>victor r. basili<>
6593<>123_5<>marc g. slack<>path planning through time and space in dynamic domains<>ijcai<>david p. miller<>
6582<>127_23<>gopalan nadathur<>a logic programming approach to manipulating formulas and programs<>slp<>dale miller<>
27182<>184_0<>paul smolensky:brigham bell:barbara fox:clayton h. lewis<>constraint-based hypertext for argumentation<>ht<>roger king<>
27155<>202_10<>nulo<>an inductive learning approach to the problem of predicting a protein's secondary structure from its amino acid sequence<>ecml<>ross d. king<>
30948<>270_38<>john h. reif<>optimal randomized parallel algorithms for computational geometry<>icpp<>sandeep sen<>
29364<>278_0<>frederick n. springsteel<>construction of universal instances for loop-free network databases using a join-like operation<>tse<>sushil jajodia<>
29365<>278_1<>nulo<>managing replicated files in partitioned distributed database systems<>icde<>sushil jajodia<>
29366<>278_2<>h. a. burgdorff:frederick n. springsteel:yechezkel zalcstein<>alternative methods for the reconstruction of trees from their traversals<>bit<>sushil jajodia<>
29368<>278_4<>satish k. tripathi:yennun huang<>local area networks: software and related issues<>tse<>sushil jajodia<>
29373<>278_9<>david mutchler<>enhancements to the voting algorithm<>vldb<>sushil jajodia<>
29374<>278_10<>nulo<>"an extension of ""representative instances and gamma-acyclic relational schemes""."<>tse<>sushil jajodia<>
29375<>278_11<>catherine meadows<>mutual consistency in decentralized distributed systems<>icde<>sushil jajodia<>
29202<>280_43<>catherine meadows<>integrity versus security in multi-level secure databases<>dbsec<>sushil jajodia<>
29237<>280_78<>david mutchler<>dynamic voting<>sigmod<>sushil jajodia<>
4884<>328_0<>fabrizio luccio:s. mazzone<>a note on visibility graphs<>dm<>c. k. wong<>
23665<>333_105<>nulo<>verification of concurrent programs: the automata-theoretic framework<>lics<>moshe y. vardi<>
10121<>368_0<>nulo<>bayesian and non-bayesian evidential updating<>ai<>henry e. kyburg jr.<>
10123<>368_2<>nulo<>higher order probabilities<>uai<>henry e. kyburg jr.<>
10130<>368_9<>nulo<>objective probabilities<>ijcai<>henry e. kyburg jr.<>
15320<>527_8<>nulo<>understanding new metaphors<>ijcai<>james h. martin<>
33984<>541_1<>jerry r. hobbs:todd r. davies:douglas edwards:kenneth i. laws<>commonsense metaphysics and lexical semantics<>coling<>william croft<>
439<>622_21<>b. jackson<>large holes in sparse random graphs<>combinatorica<>alan m. frieze<>
450<>622_32<>b. jackson<>large induced trees in sparse random graphs<>jct<>alan m. frieze<>
25770<>702_34<>c. mani krishna:yann-hang lee<>an adaptive optimization model with applications to testing<>mcpr<>philip s. yu<>
25821<>702_85<>yann-hang lee:balakrishna r. iyer<>progressive transaction recovery in distributed db/dc systems<>tc<>philip s. yu<>
25832<>702_96<>douglas w. cornell<>relation assignment in distributed transaction processing environment<>icdcs<>philip s. yu<>
25848<>702_112<>c. mani krishna:yann-hang lee<>vlsi circuit testing using an adaptive optimization model<>dac<>philip s. yu<>
25877<>702_141<>douglas w. cornell:daniel m. dias:balakrishna r. iyer<>analysis of affinity based routing in multi-system data sharing<>pe<>philip s. yu<>
12319<>759_26<>ted briscoe:claire grover:branimir boguraev<>a formalism and environment for the development of a large grammar of english<>ijcai<>john carroll<>
12323<>760_2<>darrell d. e. long:jehan-franaois paris<>block-level consistency of replicated files<>icdcs<>john l. carroll<>
12281<>761_12<>jean mckendree<>interface design issues for advice-giving expert systems<>cacm<>john m. carroll<>
5467<>818_3<>nulo<>a graduate level expert systems course<>aim<>david c. brown<>
38486<>1099_23<>daniel gajski<>les: a layout expert system<>dac<>y.-l. s. lin<>
19960<>1262_0<>mark a. franklin<>performance analysis and design of a logic simulation machine<>isca<>kenneth f. wong<>
9886<>1292_5<>david p. dobkin<>space searching for intersecting objects<>jal<>herbert edelsbrunner<>
9889<>1292_8<>bernard chazelle<>linear space data structures for two types of range search<>dcg<>herbert edelsbrunner<>
12713<>1295_14<>tae-choong chung<>history sensitive string for multiple alphabets<>ipl<>jung wan cho<>
21189<>1321_0<>susanne e. hambrusch<>on bipartite matchings of minimum density<>jal<>mikhail j. atallah<>
8515<>1362_0<>behcet sarikaya:eduard cerny<>a test design methodology for protocol testing<>tse<>gregor von bochmann<>
16157<>1441_31<>john f. canny<>new lower bound techniques for robot motion planning problems<>focs<>john h. reif<>
16169<>1441_43<>sandeep sen<>optimal randomized parallel algorithms for computational geometry<>icpp<>john h. reif<>
16187<>1441_61<>leslie g. valiant<>a logarithmic time sort for linear size networks<>jacm<>john h. reif<>
16218<>1441_92<>victor y. pan<>some polynomial and toeplitz matrix computations<>focs<>john h. reif<>
16225<>1441_99<>nulo<>a topological approach to dynamic graph connectivity<>ipl<>john h. reif<>
13181<>1465_60<>nulo<>the linpack benchmark: an explanation<>ics<>jack dongarra<>
13234<>1465_113<>s. lennart johnsson<>solving banded systems on a parallel processor<>pc<>jack dongarra<>
13242<>1465_121<>eric grosse<>distribution of mathematical software via electronic mail<>cacm<>jack dongarra<>
13264<>1465_143<>danny c. sorensen<>a portable environment for developing parallel fortran programs<>pc<>jack dongarra<>
8204<>1532_31<>a. kovaleski:s. ratheal<>an architecture and an interconnection scheme for time-sliced buses<>jpdc<>fabrizio lombardi<>
8209<>1532_36<>donatella sciuto:renato stefanelli<>a technique for reconfiguring two dimensional vlsi arrays<>rtss<>fabrizio lombardi<>
8211<>1532_38<>chin-long wey<>on a novel self-test approach to digital testing<>cj<>fabrizio lombardi<>
37383<>1616_4<>ferdinand f. leimkuhler<>analysis of zipf's law: an index approach<>ipm<>ye-sho chen<>
8812<>1796_6<>ravindran kannan:larry rudolph<>sublinear parallel algorithm for computing the greatest common divisor of two integers<>siamcomp<>gary l. miller<>
8820<>1796_14<>vijaya ramachandran<>a new graph triconnectivity algorithm and its parallelization<>stoc<>gary l. miller<>
8835<>1796_29<>nulo<>an additivity theorem for the genus of a graph<>jct<>gary l. miller<>
8862<>1796_56<>shang-hua teng<>dynamic parallel complexity of computational circuits<>stoc<>gary l. miller<>
8870<>1796_64<>hillel gazit<>a parallel algorithm for finding a separator in planar graphs<>focs<>gary l. miller<>
27707<>1826_3<>edward j. wisniewski:howard a. winston:michael f. kleyn<>a conceptual clustering program for rule generation<>ijmms<>reid g. smith<>
39035<>1870_97<>hagit attiya<>language complexity on the synchronous anonymous ring<>tcs<>yishay mansour<>
39061<>1870_123<>shmuel zaks<>on the bit complexity of distributed computations in a ring with a leader<>iandc<>yishay mansour<>
32471<>1898_54<>tiko kameda:toshimi minoura<>serializability with constraints<>tods<>toshihide ibaraki<>
9190<>1961_11<>xiaolei qian<>modeling asynchrony in distributed databases<>icde<>gio wiederhold<>
9193<>1961_14<>surajit chaudhuri:waqar hasan:michael g. walker:marianne winslett<>architectural concepts for large knowledge bases<>ki<>gio wiederhold<>
9211<>1961_32<>nulo<>experience with knowledge bases<>sigmod<>gio wiederhold<>
10244<>1982_0<>jay banerjee:won kim:henry f. korth<>semantics and implementation of schema evolution in object-oriented databases<>sigmod<>hyoung-joo kim<>
4416<>2008_6<>nulo<>general principles for performance oriented design<>cmg<>connie u. smith<>
14453<>2148_5<>sridhar reddy adnapally<>on easily testable and reconfigurable two-dimensional systolic arrays<>icpp<>jungbae h. kim<>
31239<>2180_8<>claude le pape<>management of temporal constraints for factory scheduling<>tdb<>stephen f. smith<>
31256<>2180_25<>david perry greene<>a genetic system for learning models of consumer choice<>icga<>stephen f. smith<>
31264<>2180_33<>nicola muscettola<>a probabilistic framework for resource-constrained multi-agent planning<>ijcai<>stephen f. smith<>
27827<>2308_86<>nulo<>on embedding a graph in the grid with the minimum number of bends<>siamcomp<>roberto tamassia<>
21445<>2326_87<>kang g. shin<>processor allocation in an -cube multiprocessor using gray codes<>tc<>ming-syan chen<>
21455<>2326_97<>kang g. shin<>performance analysis of distributed routing strategies free of ping-pong-type looping<>tc<>ming-syan chen<>
12800<>2394_24<>timothy j. hickey<>parsing and compiling using prolog<>toplas<>jacques cohen<>
3743<>2430_0<>eng choo<>one-dimensional simplex search<>cor<>chaiho kim<>
37918<>2626_0<>soura dasgupta<>asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise<>tit<>yih-fang huang<>
8143<>2652_0<>nulo<>reasoning in the presence of inconsistency<>aaai<>fangzhen lin<>
30980<>2683_12<>yuri gurevich<>expected computation time for hamiltonian path problem<>siamcomp<>saharon shelah<>
3111<>2792_1<>lih-hsing hsu:en-yih jean<>a class of additive multiplicative graph functions<>dm<>chiuyuan chen<>
4936<>2859_7<>anthony s. wojcik:lionel m. ni<>a rule-based circuit representation for automated cmos design and verification<>dac<>ching-farn eric wu<>
2028<>2876_7<>ko-wei lih<>hamiltonian uniform subset graphs<>jct<>bor-liang chen<>
26224<>2902_9<>laxmi n. bhuyan:r. pavaskar<>performance analysis of packet-switched multiple-bus multiprocessor systems<>rtss<>qing yang<>
949<>2949_21<>michael stonebraker<>performance evaluation of an operating system transaction manager<>vldb<>akhil kumar<>
19521<>3044_2<>rajiv ramnath:sridhar vasudevan:david m. ogle<>a system for parallel programming<>icse<>karsten schwan<>
19529<>3044_10<>thomas e. bihari:bruce w. weide:gregor taulbee<>high-performance operating system primitives for robotics and real-time control systems<>tocs<>karsten schwan<>
19569<>3044_50<>thomas e. bihari:ben a. blake<>"adaptive, reliable software for distributed and parallel real-time systems."<>srds<>karsten schwan<>
13614<>3047_88<>ronald fagin<>"belief, awareness, and limited reasoning. ."<>ai<>joseph y. halpern<>
13658<>3047_132<>danny dolev:barbara simons:h. raymond strong<>a new look at fault-tolerant network routing<>iandc<>joseph y. halpern<>
13702<>3047_176<>michael o. rabin<>a logic to reason about likelihood<>ai<>joseph y. halpern<>
13718<>3047_192<>ronald fagin<>i'm ok if you're ok: on the notion of trusting communication<>lics<>joseph y. halpern<>
29431<>3060_54<>chris d. clack:jon salkild:mark hardie<>grip - a high-performance architecture for parallel graph reduction<>fpca<>simon l. peyton jones<>
34078<>3116_5<>nulo<>decomposition of perfect graphs<>jct<>wen-lian hsu<>
8009<>3147_2<>david g. messerschmitt<>static scheduling of synchronous data flow programs for digital signal processing<>tc<>edward a. lee<>
6821<>3164_5<>john r. pugh:wilf r. lalonde<>introducing object-oriented programming into the computer science curriculum<>sigcse<>david a. thomas<>
6831<>3164_15<>brian m. barry:john r. altoft:mike wilson<>using objects to design and build radar esm systems<>oopsla<>dave a. thomas<>
5378<>3189_2<>imadeldin o. mahgoub<>analysis of a class of cluster-based multiprocessor systems<>isci<>dharma p. agrawal<>
4340<>3195_21<>george k. georgakopoulos<>the 1-steiner tree problem<>jal<>christos h. papadimitriou<>
1162<>3411_23<>nulo<>solution of ulam's problem on searching with a lie<>jct<>andrzej pelc<>
33753<>3608_3<>shankar m. venkatesan<>on bounds for a board covering problem<>ipl<>vijay v. raghavan<>
8342<>3772_81<>helmut alt:torben hagerup:kurt mehlhorn<>deterministic simulation of idealized parallel computers on more realistic ones<>paa<>franco p. preparata<>
8346<>3772_85<>helmut alt:torben hagerup:kurt mehlhorn<>deterministic simulation of idealized parallel computers on more realistic ones<>siamcomp<>franco p. preparata<>
8362<>3772_101<>gianfranco bilardi<>size-time complexity of boolean networks for prefix computations<>stoc<>franco p. preparata<>
8371<>3772_110<>witold lipski jr.<>a unified approach to layout wirability<>mst<>franco p. preparata<>
13297<>3841_1<>heiko vogler<>look-ahead on pushdowns<>iandc<>joost engelfriet<>
4250<>3870_0<>robert l. bulfin jr.<>scheduling ordered open shops<>cor<>chang-yung liu<>
27553<>3877_2<>catriel beeri<>on the power of magic<>pods<>raghu ramakrishnan<>
22623<>3887_0<>donald perlis<>"proving facts about ""|""."<>ijcai<>michael j. miller<>
6107<>3890_44<>edward g. coffman jr.:m. r. garey<>bin packing with divisible item sizes<>jc<>david s. johnson<>
38142<>3894_7<>kang g. shin:tein-hsiang lin<>optimal checkpointing of real-time tasks<>tc<>yann-hang lee<>
38172<>3894_37<>philip s. yu:balakrishna r. iyer<>progressive transaction recovery in distributed db/dc systems<>tc<>yann-hang lee<>
38177<>3894_42<>philip s. yu:c. mani krishna<>vlsi circuit testing using an adaptive optimization model<>dac<>yann-hang lee<>
22591<>3928_1<>daniel g. bobrow:eric dean tribble:jacob levy<>logical secrets<>iclp<>mark s. miller<>
27048<>4105_37<>michael o. rabin<>efficient randomized pattern-matching algorithms<>ibmrd<>richard m. karp<>
16643<>4236_2<>nulo<>minimal trees of given search number<>dm<>jonathan d. h. smith<>
284<>4302_84<>walter h. kohler:john a. stankovic:donald f. towsley<>a priority based probe algorithm for distributed deadlock detection and resolution<>icdcs<>alok n. choudhary<>
25660<>4317_0<>douglas a. young<>gi/s: a graphical user interface for symbolic computation systems<>jsc<>paul s. wang<>
10992<>4566_15<>c. a. shatter:randal c. nelson:y.-g. huang:kikuo fujimura:a. rosenteld<>recent developments in linear quadtree-based geographic information systems<>ivc<>hanan samet<>
10999<>4566_22<>randal c. nelson<>a population analysis for hierarchical data structures<>sigmod<>hanan samet<>
11058<>4566_81<>clifford a. shaffer<>optimal quadtree construction algorithms<>cvgip<>hanan samet<>
7264<>4585_6<>nulo<>concretion inferences in natural language understanding<>ki<>dekai wu<>
34185<>4613_2<>jay banerjee:hyoung-joo kim:henry f. korth<>semantics and implementation of schema evolution in object-oriented databases<>sigmod<>won kim<>
36362<>4671_15<>herbert edelsbrunner<>a tight lower bound on the size of visibility graphs<>ipl<>xiaojun shen<>
10837<>5068_49<>friedrich huber<>on editors for presentation type cai<>wi<>hermann a. maurer<>
24934<>5073_4<>tao jiang<>on one-way cellular arrays<>siamcomp<>oscar h. ibarra<>
24983<>5073_53<>jik h. chang:michael a. palis<>parallel parsing on a one-way array of finite-state machines<>tc<>oscar h. ibarra<>
25009<>5073_79<>jik h. chang:bala ravikumar:leonard berman<>some observations concerning alternating turing machines using small space<>ipl<>oscar h. ibarra<>
25010<>5073_80<>david hung-chang du:j. fernando naveda<>single-row routing with crossover bound<>tcad<>oscar h. ibarra<>
35228<>5082_50<>krithi ramamritham:john a. stankovic<>meta-level control in distributed real-time systems<>icdcs<>wei zhao<>
35237<>5082_59<>krithi ramamritham:john a. stankovic<>scheduling tasks with resource requirements in hard real-time systems<>tse<>wei zhao<>
35242<>5082_64<>krithi ramamritham:john a. stankovic<>preemptive scheduling under time and resource constraints<>tc<>wei zhao<>
22348<>5148_27<>nulo<>covering and disjointness constraints in type networks<>icde<>maurizio lenzerini<>
21596<>5157_27<>kenneth f. wong<>performance analysis and design of a logic simulation machine<>isca<>mark a. franklin<>
33652<>5239_0<>edmund h. durfee<>using partial global plans to coordinate distributed problem solvers<>ijcai<>victor r. lesser<>
15669<>5327_84<>eugenio moggi<>kripke-style models for typed lambda calculus<>lics<>john c. mitchell<>
2517<>5328_21<>nulo<>user interface design for the hyperties electronic encyclopedia<>ht<>ben shneiderman<>
24631<>5359_9<>kenneth j. goldman<>quorum consensus in nested transaction systems<>podc<>nancy a. lynch<>
24632<>5359_10<>alan fekete:michael merritt:william e. weihl<>nested transactions and read/write locking<>pods<>nancy a. lynch<>
24636<>5359_14<>sunil k. sarin<>discarding obsolete information in a replicated database system<>tse<>nancy a. lynch<>
24703<>5359_81<>mark r. tuttle<>hierarchical correctness proofs for distributed algorithms<>podc<>nancy a. lynch<>
24710<>5359_88<>greg n. frederickson<>electing a leader in a synchronous ring<>jacm<>nancy a. lynch<>
15421<>5453_17<>william h. sanders<>performance variable driven construction methods for stochastic activity networks<>mcpr<>john f. meyer<>
4094<>5473_5<>dan c. marinescu<>on stochastic high-level petri nets<>pnpm<>chuang lin<>
28534<>5729_5<>thang nguyen bui:frank thomson leighton:michael sipser<>graph bisection algorithms with good average case behavior<>combinatorica<>soma chaudhuri<>
24086<>5753_1<>cecelia chu<>invariant quantities in regression-induced boundaries under a special linear transformation<>pr<>mark c. k. yang<>
24088<>5753_3<>jun siung huang:yuan-chieh chow<>optimal parallel sorting scheme by order statistics<>siamcomp<>mark chao kuen yang<>
10368<>5791_1<>hassan k. reghbati<>comments on program slicing<>tse<>hareton k. n. leung<>
7811<>5877_8<>marc a. tischler<>an expert system for selecting liquid chromatographic separation methods<>candc<>edward a. fox<>
19360<>5882_2<>michael kaufmann<>on local routing of two-terminal nets<>stacs<>kurt mehlhorn<>
31661<>5910_0<>nulo<>some parameters of graph and its complement<>dm<>shaoji xu<>
19996<>5917_0<>w. kent fuchs:jacob a. abraham<>comparison and diagnosis of large replicated files<>tse<>kun-lung wu<>
24888<>6022_80<>ronen vainish<>how to solve any protocol problem - an efficiency improvement<>crypto<>oded goldreich<>
6778<>6091_19<>nulo<>applications of a strategy for designing divide-and-conquer algorithms<>scp<>douglas r. smith<>
6801<>6100_0<>i. m. oliver:j. r. c. holland<>a study of permutation crossover operators on the traveling salesman problem<>icga<>d. j. smith<>
38550<>6122_0<>chi-jiunn jou<>effective memory bandwidth and processor blocking probability in multiple-bus systems<>tc<>yu-cheng liu<>
28117<>6208_0<>nulo<>set-based representations of conjunctive and disjunctive knowledge<>isci<>ronald r. yager<>
7879<>6286_12<>m. r. garey:david s. johnson<>bin packing with divisible item sizes<>jc<>edward g. coffman jr.<>
7916<>6286_49<>edgar n. gilbert<>polling and greedy servers on a line<>questa<>edward g. coffman jr.<>
7936<>6286_69<>fan r. k. chung:martin i. reiman:burton simon<>the forwarding index of communication networks<>tit<>edward g. coffman jr.<>
10026<>6304_15<>takao asano<>dynamic orthogonal segment intersection search<>jal<>hiroshi imai<>
10033<>6304_22<>franz aurenhammer<>geometric relations among voronoi diagrams<>stacs<>hiroshi imai<>
1637<>6368_1<>nulo<>planar 2-pass texture mapping and warping<>siggraph<>alvy ray smith<>
28443<>6555_62<>l. leung<>a knowledge-based message management system<>tois<>shi-kuo chang<>
12104<>6557_47<>keith l. clark<>a declarative environment for concurrent logic programming<>tapsoft<>ian t. foster<>
40826<>6579_11<>walid a. abu-sufah<>on reducing data synchronization in multiprocessed loops<>tc<>zhiyuan li<>
1299<>6584_13<>zohar manna<>specification and verification of concurrent programs by forall-automata<>tls<>amir pnueli<>
1317<>6584_31<>s. kaplan<>specification and implementation of concurrently accessed data structures: an abstract data type approach<>stacs<>amir pnueli<>
1365<>6584_79<>zohar manna<>specification and verification of concurrent programs by forall-automata<>popl<>amir pnueli<>
1894<>6684_31<>herbert edelsbrunner<>an improved algorithm for constructing  th-order voronoi diagrams<>tc<>bernard chazelle<>
1910<>6684_47<>david p. dobkin<>intersection of convex objects in two and three dimensions<>jacm<>bernard chazelle<>
1914<>6684_51<>herbert edelsbrunner<>linear space data structures for two types of range search<>dcg<>bernard chazelle<>
1950<>6684_87<>nulo<>computing on a free tree via complexity-preserving mappings<>algorithmica<>bernard chazelle<>
1965<>6684_102<>nulo<>some techniques for geometric searching with implicit set representations<>acta<>bernard chazelle<>
5671<>6707_12<>frank k. hwang:g. d. song:g. y. ting<>steiner minimal trees on sets of four points<>dcg<>ding-zhu du<>
5680<>6707_21<>frank k. hwang:j. f. weng<>steiner minimal trees for regular polygons<>dcg<>ding-zhu du<>
37561<>6729_0<>james g. oxley<>on weakly symmetric graphs of order twice a prime<>jct<>ying cheng<>
5634<>6804_14<>goetz graefe<>the exodus optimizer generator<>sigmod<>david j. dewitt<>
2319<>6889_6<>nulo<>reusability: the case for object-oriented design<>software<>bertrand meyer<>
17032<>6903_29<>nulo<>design and analysis of dynamic huffman codes<>jacm<>jeffrey scott vitter<>
