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

HYBRID SORTING ALGORITHMS: A SURVEYAKL SG; MEIJER H.1981; CLASSIFICATION AUTOMATIQUE ET PERCEPTION PAR ORDINATEUR. SEMINAIRE/1979/ROCQUENCOURT; FRA; ROCQUENCOURT: INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE; DA. 1981; PP. 111-120; BIBL. 8 REF.Conference Paper

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

SELECTING THE TOP THREE ELEMENTSAIGNER M.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 4; PP. 247-267; BIBL. 6 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

BOUNDING DATA IN THE X, Y PLANEGREENBERG I.1983; MATHEMATISCHE OPERATIONSFORSCHUNG UND STATISTIK. SERIES OPTIMIZATION; ISSN 0323-3898; DDR; DA. 1983; VOL. 14; NO 2; PP. 277-284; ABS. GER/RUS; BIBL. 2 REF.Article

ON A NEW ADAPTIVE LATTICE ALGORITHM FOR RECURSIVE FILTERSAYALA IL.1982; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS.; ISSN 0096-3518; USA; DA. 1982; VOL. 30; NO 2; PP. 316-319; BIBL. 4 REF.Article

EFFICACITE D'UN ALGORITHME ADAPTATIF AVEC REGULARISATION DE LA MATRICE DE CORRELATION D'ECHANTILLONNAGECHEREMISIN OP.1982; RADIOTEHNIKA I ELEKTRONIKA; ISSN 508322; SUN; DA. 1982; VOL. 27; NO 10; PP. 1933-1941; BIBL. 4 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

A NEW LINEAR ALGORITHM FOR INTERSECTING CONVEX POLYGONSO'ROURKE J; CHI BIN CHIEN; OLSON T et al.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 19; NO 4; PP. 384-391; BIBL. 5 REF.Article

A MINIMUM SPANNING ELLIPSE ALGORITHMPOST MJ.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 115-122; BIBL. 5 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

EFFICIENT PARALLEL ALGORITHMS FOR SOME GRAPH PROBLEMSCHIN FY; LAM J; CHEN IN et al.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 9; PP. 659-665; BIBL. 22 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