A NOTE ON LOCATING A SET OF POINTS IN A PLANAR SUBDIVISIONPREPARATA FP.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 542-545; BIBL. 4 REF.Article

OPTIMAL THREE-DIMENSIONAL VLSI LAYOUTSPREPARATA FP.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 1; PP. 1-8; BIBL. 7 REF.Article

A NEW APPROACH TO PLANAR POINT LOCATIONPREPARATA FP.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 473-482; BIBL. 17 REF.Article

NEW PARALLEL-SORTING SCHEMES = NOUVEAUX SCHEMAS DE TRI PARALLELEPREPARATA FP.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 7; PP. 669-673; BIBL. 6 REF.Article

ON MULTITRANSMISSION NETWORKSPREPARATA FP.1973; I.E.E.E. TRANS. CIRCUIT THEORY; U.S.A.; DA. 1973; VOL. 20; NO 1; PP. 67-69; BIBL. 6 REF.Serial Issue

A MESH-CONNECTED AREA-TIME OPTIMAL VLSI MULTIPLIER OF LARGE INTEGERSPREPARATA FP.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 2; PP. 194-198; BIBL. 16 REF.Article

AN OPTIMAL REAL-TIME ALGORITHM FOR PLANAR CONVEX HULLSPREPARATA FP.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 7; PP. 402-405; BIBL. 7 REF.Article

TESTING A SIMPLE POLYGON FOR MONOTONICITYPREPARATA FP; SUPOWIT KJ.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 161-164; BIBL. 4 REF.Article

RESTRUCTURING OF ARITHMETIC EXPRESSIONS FOR PARALLEL EVALUATION.MULLER DE; PREPARATA FP.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 534-543; BIBL. 11 REF.Article

COMPUTATIONAL COMPLEXITY OF FOURIER TRANSFORMS OVER FINITE FIELDS.PREPARATA FP; SARWATE DV.1977; MATH. OF COMPUT.; U.S.A.; DA. 1977; VOL. 31; NO 139; PP. 740-751; BIBL. 15 REF.Article

THE TIME REQUIRED TO EVALUATE DIVISION-FREE ARITHMETIC EXPRESSIONS.PREPARATA FP; MULLER DE.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 5; PP. 144-146; BIBL. 4 REF.Article

BOUNDS TO COMPLEXITIES OF NETWORKS FOR SORTING AND FOR SWITCHING.MULLER DE; PREPARATA FP.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 195-201; BIBL. 6 REF.Article

FINDING THE INTERSECTION OF TWO CONVEX POLYHEDRAMULLER DE; PREPARATA FP.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 2; PP. 217-236; BIBL. 8 REF.Article

THE DENSEST HEMISPHERE PROBLEM.JOHNSON DS; PREPARATA FP.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 1; PP. 93-107; BIBL. 4 REF.Article

CONVEX HULLS OF FINITE SETS OF POINTS IN TWO AND THREE DIMENSIONS.PREPARATA FP; HONG SJ.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 2; PP. 87-93; BIBL. 11 REF.Article

LOCATION OF A POINT IN A PLANAR SUBDIVISION AND ITS APPLICATIONS.LEE DT; PREPARATA FP.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 594-606; BIBL. 4 REF.Article

AREA-TIME OPTIMAL VLSI NETWORKS FOR COMPUTING INTEGER MULTIPLICATION AND DISCRETE FOURIER TRANSFORMPREPARATA FP; VUILLEMIN JE.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 29-40; BIBL. 14 REF.Conference Paper

AREA-TIME OPTIMAL VLSI NETWORKS BASED ON THE CUBE-CONNECTED-CYCLESPREPARATA FP; VUILLEMIN JE.1980; RAPP. RECH., I.N.R.I.A.; FRA; DA. 1980; NO 13; PP. 1-13; ABS. FRE; BIBL. 13 REF.Serial Issue

THE CUBE-CONNECTED CYCLES: A VERSATILE NETWORK FOR PARALLEL COMPUTATIONPREPARATA FP; VUILLEMIN J.1979; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1979; NO 356; 34 P.; ABS. FRE; BIBL. 20 REF.Serial Issue

ON PERMUTATION-EMBEDDING SEQUENCES.GALBIATI G; PREPARATA FP.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 30; NO 3; PP. 421-423; BIBL. 2 REF.Article

STORAGE FOR CONSECUTIVE RETRIEVAL.LUCCIO F; PREPARATA FP.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 3; PP. 68-71; BIBL. 2 REF.Article

FINDING THE CONTOUR OF A UNION OF ISO-ORIENTED RECTANGLESLIPSKI W JR; PREPARATA FP.1980; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1980; VOL. 1; NO 3; PP. 235-246; BIBL. 3 REF.Article

SEGMENTS, RECTANGLES, CONTOURSLIPSKI W JR; PREPARATA FP.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 1; PP. 63-76; BIBL. 10 REF.Article

AREA-TIME OPTIMAL VLSI CIRCUITS FOR CONVOLUTIONBAUDET GM; PREPARATA FP; WILLEMIN JE et al.1980; RAPP. RECH., I.N.R.I.A.; FRA; DA. 1980; NO 30; PP. 1-16; ABS. FRE; BIBL. 9 REF.Serial Issue

A CRITIQUE OF NETWORK SPEED IN VLSI MODELS OF COMPUTATIONBILARDI G; PRACCHI M; PREPARATA FP et al.1982; IEEE JOURNAL OF SOLID-STATE CIRCUITS; ISSN 0018-9200; USA; DA. 1982; VOL. 17; NO 4; PP. 696-702; BIBL. 11 REF.Article