Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ANALYSE ALGORITHME")

Document Type [dt]

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

Publication Year[py]

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

Discipline (document) [di]

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

Language

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

Author Country

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

Results 1 to 25 of 6799

  • Page / 272

Export

Selection :

  • and

LINEAR ALGORITHMS TO RECOGNIZE OUTERPLANAR AND MAXIMAL OUTERPLANAR GRAPHSMITCHELL SL.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 229-232; BIBL. 5 REF.Article

EIN EFFIZIENZVERGLEICH DER FAKTORISIERUNGSVERFAHREN VON MORRISON-BULLHART UND SCHROEPPEL = COMPARAISON D'ALGORITHMES DE FACTORISATION D'ENTIERS DE MORRISON-BRILLHART ET SCHROEPPELSATTLER J; SCHNORR CP.1983; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1983; VOL. 30; NO 2; PP. 91-110; ABS. ENG; BIBL. 11 REF.Article

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBROWN DJ; BAKER BS; KATSEFF HP et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 207-225; BIBL. 11 REF.Article

A NEW ALGORITHM FOR GENERATING DERANGEMENTSAKL SG.1980; ; BIT; DNK; DA. 1980; VOL. 20; NO 1; PP. 2-7; BIBL. 8 REF.Article

A SHARPENED VERSION OF THE AANDERAA-ROSENBERG CONJECTURE.BEST M; VAN EMDE BOAS P; LENSTRA HW JR et al.1974; STICHTG MATH. CENTRUM, AFD. ZUIVERE WISKDE; NEDERL.; DA. 1974; NO 30; PP. 1-20; BIBL. 8 REF.Article

ANALYSIS OF AN ALGORITHM FOR COMPOSITION OF BINARY QUADRATIC FORMSILIOPOULOS CS.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 157-159; BIBL. 5 REF.Article

SOME SIMPLE IN-PLACE MERGING ALGORITHMSJIN KUE WONG.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 2; PP. 157-166; BIBL. 6 REF.Article

AN ANALYSIS OF TWO RELATED LOOP-FREE ALGORITHMS FOR GENERATING INTEGER PARTITIONSFENNER TI; LOIZOU G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 2; PP. 237-252; BIBL. 13 REF.Article

VORONOI DIAGRAMS FROM CONVEX HULLSBROWN KQ.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 223-228; BIBL. 25 REF.Article

DESIGNING EFFICIENT PARALLEL ALGORITHMS FOR MULTIPLE-OUTPUT COMPUTATIONS WITH FAN-IN CONSTRAINTSSANTORO N; PROBERT RL.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 204-210; BIBL. 9 REF.Conference Paper

CYBERNETIC ALGORITHM DESIGN FOR FINITE DOMAINSJONES B; JONES L.1982; KYBERNETES; ISSN 0368-492X; GBR; DA. 1982; VOL. 11; NO 4; PP. 255-260; BIBL. 2 REF.Article

AN INTRODUCTION TO THREE ALGORITHMS FOR SORTING IN SITUDIJKSTRA EW; VAN GASTEREN AJM.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 3; PP. 129-134; BIBL. 4 REF.Article

EXACT ALGORITHMS FOR THE IMPLEMENTATION OF CAUCHY'S RULEAKRITAS AG.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 4; PP. 323-333; BIBL. 9 REF.Article

A LINEAR ALGORITHM FOR FINDING THE CONVEX HULL OF A SIMPLE POLYGONMCCALLUM D; AVIS D.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 201-206; BIBL. 7 REF.Article

SOME PROPERTIES OF A CENTROID OF A FREE TREE.KANG ANC; AULT DA.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 18-20; BIBL. 2 REF.Article

AN IMPROVEMENT OF THE BINARY MERGE ALGORITHMMAITHANH; BUI TD.1982; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 4; PP. 454-462; BIBL. 7 REF.Article

HIGH-SPEED MULTIDIMENSIONAL CONVOLUTIONCHANG EUN KIM; STRINTZIS MG.1980; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1980; VOL. 2; NO 3; PP. 269-273; BIBL. 14 REF.Article

REFINED ANALYSIS AND IMPROVEMENTS ON SOME FACTORING ALGORITHMSSCHNORR CP.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 101-127; BIBL. 27 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

TWO ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATIONLEE DT; SCHACHTER BJ.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 3; PP. 219-242; BIBL. 37 REF.Article

OPTIMAL SEARCH IN PLANAR SUBDIVISIONSKIRKPATRICK D.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 28-35; BIBL. 28 REF.Article

ON THE COST OF EVALUATING POLYNOMIALS AND THEIR DERIVATIVESDANIELO POULOS SD.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 4; PP. 373-380; ABS. GER; BIBL. 3 REF.Article

SORTING A LINKED LIST WITH EQUAL KEYSWEGNER LM.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 5; PP. 205-208; BIBL. 9 REF.Article

APPLYING PARALLEL COMPUTATION ALGORITHMS IN THE DESIGN OF SERIAL ALGORITHMSMEGIDDO N.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 399-408; BIBL. 21 REF.Conference Paper

ON VARIETIES OF OPTIMAL ALGORITHMS FOR THE COMPUTATION OF BILINEAR MAPPINGS. I. THE ISOTROPY GROUP OF A BILINEAR MAPPINGDE GROOTE HF.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 1; PP. 1-24; BIBL. 15 REF.Article

  • Page / 272