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

ELECTROCHEMICAL DETOXIFICATION OF HEMOFILTRATEWEIDLICH E; WIESE H; MUND K et al.1983; SIEMENS FORSCHUNGS - UND ENTWICKLUNGSBERICHTE; ISSN 0370-9736; DEU; DA. 1983; VOL. 12; NO 2; PP. 96-100; BIBL. 7 REF.Article

ELECTROCATALYTIC GLUCOSE SENSORGEBHARDT U; LUFT G; MUND K et al.1983; SIEMENS FORSCHUNGS - UND ENTWICKLUNGSBERICHTE; ISSN 0370-9736; DEU; DA. 1983; VOL. 12; NO 2; PP. 91-95; BIBL. 4 REF.Article

SYNTHESE D'UN ALGORITHME ADAPTIF DE FILTRAGEPEROV AI.1983; IZVESTIJA VYSSIH UCEBNYH ZAVEDENIJ. RADIOELEKTRONIKA; ISSN 0021-3470; SUN; DA. 1983; VOL. 26; NO 1; PP. 70-74; BIBL. 5 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

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

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

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

ALGORITHMES NUMERIQUES OPTIMUMS D'UNE RECEPTION DE L'INFORMATION PAR ESTIMATION SYMBOLIQUEZHODZISHSKIJ MI.1983; RADIOTEHNIKA I ELEKTRONIKA; ISSN 508322; SUN; DA. 1983; VOL. 28; NO 2; PP. 290-297; BIBL. 5 REF.Article

CONVEX DECOMPOSITIONS OF POLYHEDRACHAZELLE BM.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 70-79; BIBL. 8 REF.Conference Paper

ON THE CONJECTURE RELATING MINIMAX AND MINIMEAN COMPLEXITY NORMSRUZICKA P; WIEDERMANN J.1979; APL. MAT.; CSK; DA. 1979; VOL. 24; NO 5; PP. 321-325; ABS. SLO; BIBL. 3 REF.Article

THE PARALLEL ANICKSORT ALGORITHM. I: RUN TIME ANALYSISEVANS DJ; DUNBAR RC.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 12; NO 1; PP. 19-55; BIBL. 6 REF.Article

ANALYSIS OF ALGORITHMS FOR THE EVALUATION OF MONOTONIC BOOLEAN FUNCTIONSBREITBART Y; GAL S.1978; I.E.E.E. TRANS COMPUTERS; USA; DA. 1978; VOL. 27; NO 11; PP. 1083-1087; BIBL. 11 REF.Article

HEURISTIC ALGORITHMS FOR RECTILINEAR STEINER TREESSERVIT M.1981; DIGIT. PROCESSES; ISSN 0301-4185; CHE; DA. 1981; VOL. 7; NO 1; PP. 21-32; ABS. FRE/GER; BIBL. 16 REF.Article

A LIST-COPYING ALGORITHM FOR TREE-STRUCTURED LISTSKIKUNO T; HOSHINO T.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 5; PP. 11-19; BIBL. 7 REF.Article

DETECTION OF CONNECTIVITY FOR REGIONS REPRESENTED BY LINEAR QUADTREESGARGANTINI I.1982; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1982; VOL. 8; NO 4; PP. 319-327; BIBL. 8 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

ESTIMATION DU COUT D'INFORMATION DU DIAGNOSTIC PAR TEST DES CIRCUITSGORYASHKO AP.1982; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1982; NO 7; PP. 123-127; ABS. ENG; BIBL. 4 REF.Article

REALISATION DES FONCTIONS BOOLEENNES PAR DES POLYNOMES ARITHMETIQUESMALYUGIN VD.1982; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1982; NO 4; PP. 84-93; ABS. ENG; BIBL. 13 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

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

VARIABLE JUMP SEARCH: THE ALGORITHM AND ITS EFFICIENCYJANKO W.1981; ANGEW. INFORM.; ISSN 0013-5704; DEU; DA. 1981; VOL. 23; NO 1; PP. 6-11; ABS. GER; BIBL. 4 REF.Article