10947<>21_16<>didier dubois<>ranking fuzzy numbers in the setting of possibility theory<>isci<>henri prade<>
33421<>32_12<>richard w. selby:tsai-yun phillips<>metric analysis and data validation across fortran projects<>tse<>victor r. basili<>
33474<>32_65<>david h. hutchens<>an empirical study of a syntactic complexity family<>tse<>victor r. basili<>
5703<>158_10<>henri prade<>ranking fuzzy numbers in the setting of possibility theory<>isci<>didier dubois<>
1847<>215_0<>nulo<>"on the crossing-free, rectangular embedding of weighted graphs in the plane."<>tcs<>bernd becker<>
29369<>278_5<>peter a. ng:frederick n. springsteel<>the problem of equivalence for entity-relationship diagrams<>tse<>sushil jajodia<>
29370<>278_6<>jian liu:peter a. ng<>a scheme of parallel processing for mimd systems<>tse<>sushil jajodia<>
29371<>278_7<>peter a. ng:frederick n. springsteel<>on universal and representative instances for inconsistent databases<>er<>sushil jajodia<>
25444<>299_0<>jorge rubinstein:mark a. horowitz<>signal delay in rc tree networks<>tcad<>paul penfield jr.<>
4899<>331_0<>yuh-zen liao<>an algorithm to compact a vlsi symbolic layout with mixed constraints<>tcad<>chak-kuen wong<>
23635<>333_75<>ronald fagin:jeffrey d. ullman<>on the semantics of updates in databases<>pods<>moshe y. vardi<>
27880<>579_1<>harold n. gabow<>a linear-time algorithm for a special case of disjoint set union<>stoc<>robert endre tarjan<>
449<>622_31<>trevor i. fenner<>on the existence of hamiltonian cycles in a class of random graphs<>dm<>alan m. frieze<>
21560<>750_1<>nancy a. lynch:mike paterson<>impossibility of distributed consensus with one faulty process<>pods<>michael j. fischer<>
12309<>759_16<>nulo<>an island parsing interpreter for the full augmented transition network formalism<>eacl<>john a. carroll<>
30733<>966_2<>prabir das<>alternating eulerian trails with prescribed degrees in two edge-colored complete graphs<>dm<>s. b. rao<>
6387<>1138_0<>dennis tsichritzis:stavros christodoulakis:p. economopoulos:christos faloutsos:a. lee:j. vandenbroeck:carson c. woo<>a multimedia office filing system<>vldb<>d. lee<>
9900<>1287_1<>david g. kirkpatrick:raimund seidel<>on the shape of a set of points in the plane<>tit<>herbert edelsbrunner<>
12703<>1295_4<>young gil park<>fault diagnosis of bit-slice processor<>isca<>jung wan cho<>
16177<>1441_51<>joseph y. halpern<>"the propositional dynamic logic of deterministic, well-structured programs."<>tcs<>john h. reif<>
16203<>1441_77<>nulo<>logarithmic depth circuits for algebraic functions<>focs<>john h. reif<>
16217<>1441_91<>leslie g. valiant<>a logarithmic time sort for linear size networks<>stoc<>john h. reif<>
8827<>1796_21<>nulo<>isomorphism of k-contractible graphs. a generalization of bounded valence and bounded genus<>iandc<>gary l. miller<>
8831<>1796_25<>nulo<>isomorphism of graphs which are pairwise k-separable<>iandc<>gary l. miller<>
8843<>1796_37<>daniel j. kleitman:frank thomson leighton:margaret lepley<>an asymptotically optimal layout for the shuffle-exchange graph<>jcss<>gary l. miller<>
8849<>1796_43<>nulo<>isomorphism testing and canonical forms for k-contractable graphs (a generalization of bounded valence and bounded genus)<>fct<>gary l. miller<>
8866<>1796_60<>susan landau<>solvability by radicals is in polynomial time<>stoc<>gary l. miller<>
27704<>1826_0<>randall davis<>negotiation as a metaphor for distributed problem solving<>ai<>reid g. smith<>
32423<>1898_6<>hussein m. abdel-wahab:tiko kameda<>design of minimum-cost deadlock-free systems<>jacm<>toshihide ibaraki<>
9219<>1961_40<>jack milton:daniel sagalowicz<>applications of artificial intelligence in the knowledge-based management systems project<>debu<>gio wiederhold<>
9231<>1961_52<>stefano ceri:shamkant b. navathe<>distribution design of logical database schemas<>tse<>gio wiederhold<>
27911<>1997_21<>nulo<>complexity of analyzing the synchronization structure of concurrent programs<>acta<>richard n. taylor<>
27920<>1997_30<>nulo<>an integrated verification and testing environment<>spe<>richard n. taylor<>
14294<>2166_0<>james blaine:rexford l. hill:r. gilbert jost:chung-dak shum<>some design considerations for picture archiving and communication systems<>computer<>jerome r. cox jr.<>
31252<>2180_21<>nulo<>flexible learning of problem solving heuristics through adaptive search<>ijcai<>stephen f. smith<>
27788<>2308_47<>carlo batini:maurizio talamo<>an algorithm for automatic layout of entity-relationship diagrams<>er<>roberto tamassia<>
12798<>2394_22<>nulo<>a note on a fast algorithm for sparse matrix multiplication<>ipl<>jacques cohen<>
12806<>2394_30<>alexandru nicolau<>comparison of compacting algorithms for garbage collection<>toplas<>jacques cohen<>
12808<>2394_32<>timothy j. hickey<>uniform random generation of strings in a context-free language<>siamcomp<>jacques cohen<>
21070<>2564_3<>bo zhang<>the statistical inference method in heuristic search techniques<>ijcai<>ling zhang<>
1856<>2618_5<>nulo<>some remarks on packing trees<>dm<>bala bollobas<>
1280<>2662_1<>nulo<>fractal-based description<>ijcai<>alex pentland<>
31002<>2683_34<>uri abraham<>forcing closed unbounded sets<>jsyml<>saharon shelah<>
31013<>2683_45<>yuri gurevich<>rabin's uniformization problem<>jsyml<>saharon shelah<>
31014<>2683_46<>matatyahu rubin<>on the expressibility hierarchy of magidor-malitz quantifiers<>jsyml<>saharon shelah<>
7245<>2749_14<>hermann a. maurer:arto salomaa<>l codes and number systems<>tcs<>derick wood<>
6179<>2855_7<>nulo<>assembly language as object code<>spe<>douglas w. jones<>
13527<>3047_1<>michael o. rabin<>a logic to reason about likelihood<>stoc<>joseph y. halpern<>
13552<>3047_26<>steven m. german:edmund m. clarke<>reasoning about procedures as parameters<>lop<>joseph y. halpern<>
13599<>3047_73<>nulo<>deterministic process logic is elementary<>iandc<>joseph y. halpern<>
13606<>3047_80<>edmund m. clarke:steven m. german<>effective axiomatizations of hoare logics<>jacm<>joseph y. halpern<>
13626<>3047_100<>zohar manna:ben c. moszkowski<>a hardware semantics based on temporal intervals<>icalp<>joseph y. halpern<>
13631<>3047_105<>john h. reif<>"the propositional dynamic logic of deterministic, well-structured programs."<>tcs<>joseph y. halpern<>
5408<>3189_32<>laxmi n. bhuyan<>performance analysis of fft algorithms on multiprocessor systems<>tse<>dharma p. agrawal<>
5433<>3189_57<>laxmi n. bhuyan<>design and performance of generalized interconnection networks<>tc<>dharma p. agrawal<>
4336<>3195_17<>fillia makedon:ivan hal sudborough<>topological bandwidth<>caap<>christos h. papadimitriou<>
1016<>3495_13<>dennis tsichritzis:stavros christodoulakis:p. economopoulos:christos faloutsos:d. lee:j. vandenbroeck:carson c. woo<>a multimedia office filing system<>vldb<>a. lee<>
12207<>3570_5<>douglas b. lenat<>why am and eurisko appear to work<>aaai<>john seely brown<>
9055<>3575_4<>dirk janssens<>hypergraph systems and their extensions<>ita<>grzegorz rozenberg<>
9030<>3580_10<>andrzej ehrenfeucht:david haussler<>on regularity of context-free languages<>tcs<>grzegorz rozenberg<>
9034<>3580_14<>andrzej ehrenfeucht:joost engelfriet<>context free normal systems and etol systems<>jcss<>grzegorz rozenberg<>
9043<>3580_23<>andrzej ehrenfeucht<>on the separating power of eol systems<>ita<>grzegorz rozenberg<>
34137<>3702_0<>c. chvatal:vojtech rodl:endre szemeredi<>the ramsey number of a graph with bounded maximum degree<>jct<>w. t. trotter jr.<>
8301<>3772_40<>gerard m. baudet:jean vuillemin<>area-time optimal vlsi circuits for convolution<>tc<>franco p. preparata<>
8303<>3772_42<>alberto apostolico<>optimal off-line detection of repetitions in a string<>tcs<>franco p. preparata<>
8319<>3772_58<>kurt mehlhorn<>area-time optimal vlsi integer multiplier with minimum computation time<>iandc<>franco p. preparata<>
8338<>3772_77<>nulo<>a mesh-connected area-time optimal vlsi multiplier of large integers<>tc<>franco p. preparata<>
8384<>3772_123<>nulo<>optimal three-dimensional vlsi layouts<>mst<>franco p. preparata<>
2910<>3775_3<>ling zhang<>the statistical inference method in heuristic search techniques<>ijcai<>bo zhang<>
32558<>3781_3<>steven a. shafer:john r. kender<>gradient space under orthography and perspective<>cvgip<>takeo kanade<>
32595<>3781_40<>martin herman:shigeru kuroe<>the 3d mosaic scene understanding system<>ijcai<>takeo kanade<>
32613<>3781_58<>steven a. shafer<>using shadows in finding surface orientations<>cvgip<>takeo kanade<>
13302<>3842_0<>andrzej ehrenfeucht:grzegorz rozenberg<>context free normal systems and etol systems<>jcss<>joost engelfriet<>
6083<>3890_20<>edward g. coffman jr.:m. r. garey<>dynamic bin packing<>siamcomp<>david s. johnson<>
6084<>3890_21<>edward g. coffman jr.:m. r. garey:andrea s. lapaugh<>scheduling file transfers in a distributed network<>podc<>david s. johnson<>
6112<>3890_49<>anthony c. klug<>optimizing conjunctive queries that contain untyped variables<>siamcomp<>david s. johnson<>
38135<>3894_0<>kang g. shin<>analysis of backward error recovery for concurrent processes with recovery blocks<>icpp<>yann-hang lee<>
14260<>3994_0<>nulo<>"hierarchical set definition by q-analysis, part i. the hierarchical backcloth."<>ijmms<>j. h. johnson<>
14262<>3994_2<>nulo<>"hierarchical set definition by q-analysis, part ii. traffic on the hierarchical backcloth."<>ijmms<>j. h. johnson<>
27074<>4105_63<>judea pearl<>searching for an optimal path in a tree with random costs<>ai<>richard m. karp<>
27096<>4105_85<>michael luby<>monte-carlo algorithms for enumeration and reliability problems<>focs<>richard m. karp<>
11089<>4566_112<>nulo<>a quadtree medial axis transform<>cacm<>hanan samet<>
17485<>4714_18<>werner bux:bernd meister<>bridges for interconnection of ring networks: a simulation study<>ifip<>johnny w. wong<>
30298<>4780_0<>clement w. h. lam:m. k. siu<>the existence and nonexistence of perfect addition sets<>jct<>s. l. ma<>
11269<>4800_12<>nulo<>search and reasoning in problem solving<>ai<>herbert a. simon<>
33042<>4985_20<>hisao tamaki<>enumeration of success patterns in logic programs<>icalp<>taisuke sato<>
10811<>5068_23<>arto salomaa:derick wood<>l codes and number systems<>tcs<>hermann a. maurer<>
10835<>5068_47<>istvan sebestyen<>inhouse  public videotex systems<>cn<>hermann a. maurer<>
24930<>5073_0<>tat-hung chan<>on the finite-valuedness problem for sequential machines<>tcs<>oscar h. ibarra<>
24940<>5073_10<>shlomo moran<>some time-space tradeoff results concerning single-tape and offline tm's<>siamcomp<>oscar h. ibarra<>
24952<>5073_22<>brian s. leininger<>on the zero-inequivalence problem for loop programs<>jcss<>oscar h. ibarra<>
24961<>5073_31<>nulo<>on some decision questions concerning pushdown machines<>tcs<>oscar h. ibarra<>
24987<>5073_57<>shlomo moran<>probabilistic algorithms for deciding equivalence of straight-line programs<>jacm<>oscar h. ibarra<>
24993<>5073_63<>louis e. rosier<>simple programming languages and restricted classes of turing machines<>tcs<>oscar h. ibarra<>
24999<>5073_69<>tat-hung chan<>on the space and time complexity of functions computable by simple programs<>siamcomp<>oscar h. ibarra<>
25061<>5073_131<>shlomo moran:louis e. rosier<>on the control power of integer division<>tcs<>oscar h. ibarra<>
22356<>5148_35<>carlo batini<>a methodology for data schema integration in the entity-relationship model<>er<>maurizio lenzerini<>
21582<>5157_13<>sanjay dhar:donald f. wann<>timing control of vlsi based nlogn and crossbar networks<>icpp<>mark a. franklin<>
10342<>5312_0<>harry d. conway<>bending and stretching an elastic strip around a narrow cylindrical drum<>ibmrd<>ho chong lee<>
15601<>5327_16<>nulo<>the implication problem for functional and inclusion dependencies<>iandc<>john c. mitchell<>
2511<>5328_15<>nulo<>human factors of interactive software<>ibm<>ben shneiderman<>
2528<>5328_32<>nulo<>direct manipulation: a step beyond programming languages<>computer<>ben shneiderman<>
15752<>5331_0<>nulo<>file servers<>ac<>james g. mitchell<>
24629<>5359_7<>nulo<>concurrency control for resilient nested transactions<>pods<>nancy a. lynch<>
24726<>5359_104<>michael j. fischer:mike paterson<>impossibility of distributed consensus with one faulty process<>pods<>nancy a. lynch<>
24728<>5359_106<>danny dolev:shlomit s. pinter:eugene w. stark:william e. weihl<>reaching approximate agreement in the presence of faults<>srds<>nancy a. lynch<>
24734<>5359_112<>eshrat arjomandi:michael j. fischer<>efficiency of synchronous versus asynchronous distributed systems<>jacm<>nancy a. lynch<>
15425<>5453_21<>nulo<>performability modeling of distributed real-time systems<>mcpr<>john f. meyer<>
7816<>5877_13<>gerard salton:harry wu<>extended boolean information retrieval<>cacm<>edward a. fox<>
24908<>6022_100<>shimon even<>on the security of multi-party ping-pong protocols<>focs<>oded goldreich<>
6766<>6091_7<>nulo<>a problem reduction approach to program synthesis<>ijcai<>douglas r. smith<>
12170<>6165_9<>nulo<>learning to program<>ijcai<>john r. anderson<>
7926<>6286_59<>m. r. garey:david s. johnson<>dynamic bin packing<>siamcomp<>edward g. coffman jr.<>
7952<>6287_10<>nulo<>the binary code arising from a 2-design with a nice collection of ovals<>tit<>e. f. assmus jr.<>
1477<>6481_15<>hermann a. maurer:derick wood<>l codes and number systems<>tcs<>arto salomaa<>
25507<>6484_6<>nulo<>exception handling in c programs<>spe<>p. a. lee<>
28425<>6555_44<>chung-chun yang<>picture information measures for similarity retrieval<>cvgip<>shi-kuo chang<>
1334<>6584_48<>zohar manna<>how to cook a temporal proof system for your pet language<>popl<>amir pnueli<>
1335<>6584_49<>zohar manna<>proving precedence properties: the temporal way<>icalp<>amir pnueli<>
1389<>6584_103<>nulo<>on the extremely fair treatment of probabilistic algorithms<>stoc<>amir pnueli<>
1394<>6584_108<>mordechai ben-ari:zohar manna<>the temporal logic of branching time<>acta<>amir pnueli<>
3665<>6675_1<>nulo<>specification and design of (parallel) programs<>ifip<>cliff b. jones<>
3670<>6675_6<>nulo<>tentative steps toward a development method for interfering programs<>toplas<>cliff b. jones<>
1897<>6684_34<>leonidas j. guibas:d. t. lee<>the power of geometric duality<>focs<>bernard chazelle<>
1923<>6684_60<>nulo<>a decision procedure for optimal polyhedron partitioning<>ipl<>bernard chazelle<>
1947<>6684_84<>nulo<>how to search in history<>fct<>bernard chazelle<>
1961<>6684_98<>nulo<>an improved algorithm for the fixed-radius neighbor problem<>ipl<>bernard chazelle<>
5668<>6707_9<>frank k. hwang:jia feng weng<>a class of full steiner minimal trees<>dm<>ding-zhu du<>
5645<>6804_25<>dina bitton:carolyn turbyfill<>benchmarking database systems a systematic approach<>vldb<>david j. dewitt<>
