MINICOMPUTERS ARE BURSTING OUT ALL OVER.WOODHAM R.1975; NATURE; G.B.; DA. 1975; VOL. 257; NO 5527; PP. 558-564; BIBL. 16 REF.Article

NEW ASPECTS OF DYNAMICAL DAMPING IN AB INITIO MOLECULAR SCF CALCULATIONSRAMEK M; FRITZER HP.1982; COMPUTERS & CHEMISTRY; ISSN 0097-8485; USA; DA. 1982; VOL. 6; NO 4; PP. 165-168; BIBL. 20 REF.Article

LE PROBLEME DE TRANSPORT. UNE METHODE A 2 DIRECTIONSSAWA R.1975; PRACE C.O. P.A.N.; POLSKA; DA. 1975; NO 193; PP. 1-18; ABS. ANGL.; BIBL. 4 REF.Article

THE COMPUTING TIME OF THE EUCLIDENA ALGORITHM.COLLINS GE.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 1-10; BIBL. 12 REF.Article

ON THE PROBABLE BEHAVIOUR OF SOME ALGORITHMS FOR FINDING THE STABILITY NUMBER OF A GRAPHPITTEL B.1982; MATH. PROC. CAMB. PHILOS. SOC.; ISSN 0305-0041; GBR; DA. 1982; VOL. 92; NO 3; PP. 511-526; BIBL. 11 REF.Article

THE EXACT TIME REQUIRED TO PERFORM GENERALIZED ADDITION.FLOYD RW.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 3-5; BIBL. 3 REF.Conference Paper

CONGRUENCE ARITHMETIC ALGORITHMS FOR POLYNOMIAL REAL ZERO DETERMINATION.HEINDEL LE.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 9; NO 1; PP. 109-128; BIBL. 9 REF.Article

THE MARKOV ALGORITHM AS A LANGUAGE PARSER-LINEAR BOUNDSKATZENELSON J.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 5; PP. 465-478; BIBL. 7 REF.Serial Issue

AN INTRODUCTION TO THE DYNAMIC CLUSTERS METHOD. (DYC PROGRAM)DIDAY E.1972; METRA; FR.; DA. 1972; VOL. 11; NO 3; PP. 505-519; ABS. FR. ALLEM. ITAL. ESP.; BIBL. 1 P.Serial Issue

POLYNOMIAL MULTIPLICATION, POWERS AND ASYMPTOTIC ANALYSIS: SOME COMMENTS.FATEMAN RJ.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 196-213; BIBL. 19 REF.Article

MINIMIZING THE COMPUTATION TIME FOR USING THE TECHNIQUE OF SECTIONING FOR DIGITAL FILTERING OF PICTURESHUNT BR.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 11; PP. 1219-1222; BIBL. 3 REF.Serial Issue

SORTING X+Y.HARPER LH; PAYNE TH; SAVAGE JE et al.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 6; PP. 347-349; BIBL. 3 REF.Article

ALGORITHMS FOR FAST EVALUATION OF BOOLEAN EXPRESSIONS.BREITBART Y; REITER A.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 107-116; BIBL. 5 REF.Article

HIGH-SPEED MULTIPLICATION SYSTEMSKAMAL AA; GHANNAM MAN.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 9; PP. 1017-1021; BIBL. 7 REF.Serial Issue

FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME.HADLOCK F.1975; S.I.AM. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 221-225; BIBL. 8 REF.Article

HOW DOES A REAL TIME COMPUTER SPEND ITS TIME.HEERMA MJB; OUD AJHM.1975; J. A; BELG.; DA. 1975; VOL. 16; NO 2; PP. 79-82Article

APPLICATION OF CONTINUED FRACTIONS FOR FAST EVALUATION OF CERTAIN FUNCTIONS ON A DIGITAL COMPUTER.BRACHA BARAK A.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 3; PP. 301-309; BIBL. 8 REF.Article

ANWENDUNG BESONDERS EINFACHER, RECHENZEITSPARENDER DDC-ALGORITHMEN. = APPLICATIONS D'ALGORITHMES DE COMMANDE NUMERIQUE DIRECTE PARTICULIEREMENT SIMPLES ET ECONOMIQUES EN TEMPS DE CALCULITSCHNER B.1976; REGELUNGSTECHNIK; DTSCH.; DA. 1976; VOL. 24; NO 10; PP. 342-347; ABS. ANGL.; BIBL. 11 REF.Article

SOME ASPECTS OF THE ZOOM TRANSFORM.YIP PCY.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 3; PP. 287-296; BIBL. 17 REF.Article

AUTOMATIC GENERATION OF TIME EFFICIENT DIGITAL SIGNAL PROCESSING SOFTWARE.MORRIS LR.1976; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS. CONF. REC.; PHILADELPHIA, PA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 622-625; BIBL. 9 REF.Conference Paper

MEASUREMENT DESIGNS TO IMPROVE THE COMPUTATIONAL EFFICIENCY OF LINEAR SYSTEM STATE ESTIMATORS. = CONCEPTIONS DE MESURES POUR AMELIORER L'EFFICACITE DE CALCUL NUMERIQUE D'ESTIMATEURS D'ETAT DE SYSTEMES LINEAIRESSTAMM JC; PRIEMER R.1975; INTERNATION. J. CONTROL.; G.B.; DA. 1975; VOL. 22; NO 4; PP. 445-460; BIBL. 18 REF.Article

EIN ADAPTIVES, EXPLIZITES PARAMETERSCHAETZVERFAHREN MIT GERINGEM SPEICHERPLATZ -UND RECHENZEITBEDARF. = UNE METHODE ADAPTATIVE, EXPLICITE D'ESTIMATION DES PARAMETRES AVEC DE FAIBLES BESOINS EN MEMOIRE ET EN TEMPS CALCULSCHEURER HG.1975; REGELUNGSTECHNIK; DTSCH.; DA. 1975; VOL. 23; NO 12; PP. 427-433; ABS. ANGL.; BIBL. 11 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

MINIMIZATION OF INTERPROCESSOR COMMUNICATION FOR PARALLEL COMPUTATIONIRANI KB; CHEN KW.1981; INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING/1981/BELLAIRE OH; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1981; PP. 274-281; BIBL. 13 REF.Conference Paper

POLYNOMIAL AND ABSTRACT SUBRECURSIVE CLASSES.MEHLHORN K.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 2; PP. 147-178; BIBL. 1 P. 1/2; (ANNU. ACM SYMP. THEORY COMPUT. 6; SEATTLE, WASH.; 1974)Conference Paper