Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("PREPARATA FP")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 42

  • Page / 2

Export

Selection :

  • and

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

OPTIMAL OFF-LINE DETECTION OF REPETITIONS IN A STRINGASPOTOLICO A; PREPARATA FP.1983; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1983; VOL. 22; NO 3; PP. 297-315; BIBL. 17 REF.Article

AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEMLEE DT; PREPARATA FP.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 218-224; BIBL. 7 REF.Article

FINDING THE INTERSECTION OF N HALF-SPACES IN TIME O(N LOG N)PREPARATA FP; MULLER DE.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 1; PP. 45-55; BIBL. 5 REF.Article

AN IMPROVED PARALLEL PROCESSOR BOUND IN FAST MATRIX INVERSION.PREPARATA FP; SARWATE DV.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 3; PP. 148-150; BIBL. 8 REF.Article

EFFICIENT PARALLEL EVALUATION OF BOOLEAN EXPRESSIONSPREPARATA FP; MULLER DE.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 5; PP. 548-549; BIBL. 3 REF.Article

CONTINOUSLY VALUED LOGICPREPARATA FP; YEH RT.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 5; PP. 397-418; BIBL. 13 REF.Serial Issue

PLANE-SWEEP ALGORITHMS FOR INTERSECTING GEOMETRIC FIGURESNIEVERGELT J; PREPARATA FP.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 10; PP. 739-747; BIBL. 8 REF.Article

AREA-TIME OPTIMAL VLSI NETWORKS FOR MULTIPLYING MATRICESPREPARATA FP; VUILLEMIN JE.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 2; PP. 77-80; BIBL. 6 REF.Article

THE CUBE-CONNECTED-CYCLES: A VERSATILE NETWORK FOR PARALLEL COMPUTATION (EXTENDED ABSTRACT)PREPARATA FP; VUILLEMIN J.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P. R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 140-147; BIBL. 21 REF.Conference Paper

AN OPTIMAL ALGORITHM FOR FINDING THE KERNEL OF A POLYGONLEE DT; PREPARATA FP.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 3; PP. 415-421; BIBL. 1 REF.Article

THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONSLEE DT; PREPARATA FP.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 189-192; BIBL. 4 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

  • Page / 2