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

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

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

ITERATION STRIKES BACK-AT THE CYCLIC TOWERS OF HANOIWALSH TR.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 91-93; BIBL. 5 REF.Article

ITERATIVE SYSTEMS AND DIAGRAM ALGORITHMSMARTIC B.1981; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1981; VOL. 27; NO 6; PP. 561-564; BIBL. 8 REF.Article

SOLVING COMPLEX CONFLICTSFRASER NM; HIPEL KW.1979; I.E.E.E. TRANS. SYST. MAN CYBERN.; USA; DA. 1979; VOL. 9; NO 12; PP. 805-816; BIBL. 22 REF.Article

ON COMPUTABILITY OF THE MEAN DEVIATIONWINKLER PM.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 1; PP. 36-38; BIBL. 4 REF.Article

ON SOME DECISION PROBLEMS FOR RAM PROGRAMSIBARRA OH; MORAN S.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 69-81; BIBL. 8 REF.Article

THREE NEW COMBINATION ALGORITHMS WITH THE MINIMAL CHANGE PROPERTYLAM CWH; SOICHER LH.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 8; PP. 555-559; BIBL. 5 REF.Article

A REFINEMENT OF A SPHERICAL DECOMPOSITION ALGORITHMMOHR R.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 1; PP. 51; BIBL. 1 REF.Article

APPROXIMATION ALGORITHMS FOR CONVEX HULLSBENTLEY JL; FAUST MG; PREPARAT FP et al.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 1; PP. 64-68; BIBL. 10 REF.Article

GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANELEE DT; DRYSDALE RL III.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 73-87; BIBL. 22 REF.Article

LINEAR-TIME APPROXIMATION ALGORITHMS FOR FINDING THE MINIMUM-WEIGHT PERFECT MATCHING ON A PLANEIRI M; MUROTA K; MATSUI S et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 206-209; BIBL. 4 REF.Article

ON THE AVERAGE COMPLEXITY OF SOME BUCKETING ALGORITHMSDEVROYE L.1981; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1981; VOL. 7; NO 5; PP. 407-412; BIBL. 8 REF.Article

ON THE COMPLEXITY OF VECTOR COMPUTATIONS IN BINARY TREE MACHINESTOLLE DM; SIDDALL WE.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 120-124; BIBL. 3 REF.Article