COMPUTING RATIONAL ZEROS OF INTEGRAL POLYNOMIALS BY P-ADIC EXPANSIONLOOS R.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 286-293; BIBL. 10 REF.Article

VLSI ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEMHAMBRUSCH SE.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 354-365; BIBL. 16 REF.Article

A PERFORMANCE ANALYSIS OF A SIMPLE PRIME-TESTING ALGORITHMWUNDERLICH MC.1983; MATHEMATICS OF COMPUTATION; ISSN 0025-5718; USA; DA. 1983; VOL. 40; NO 162; PP. 709-714; BIBL. 7 REF.Article

TWO REMARKS ON A CONVEX HULL ALGORITHMAKL SG.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 2; PP. 108-109; BIBL. 1 REF.Article

COMPLEXITE DE QUELQUES ALGORITHMES DE THEORIE DES GRAPHES.BERSTEL J.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 31-39; ABS. ANGL.; BIBL. 1 P. 1/2Conference Paper

LES PROBLEMES DE GRAPHE ET LA COMPLEXITE DES ALGORITHMES.ARDITTI JC.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 7-22; ABS. ANGL.; BIBL. 7 REF.Conference Paper

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

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

FAST CANONIZATION OF CIRCULAR STRINGSSHILOACH Y.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 107-121; BIBL. 5 REF.Article

A FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES.HUNT JW; SZYMANSKI TG.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 5; PP. 350-353; BIBL. 7 REF.Article

TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR PROGRAMMINGMEGIDDO N.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 347-353; BIBL. 12 REF.Article

A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2^NGAMES RA; HUI CHAN A.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 144-146; BIBL. 4 REF.Article

ALGORITHMICAL COMPLEXITY OF SOME STATISTICAL DECISION PROCESS. IISINDELAR J.1980; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1980; VOL. 16; NO 4; PP. 357-376; BIBL. 4 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

THE TOWERS OF HANOR REVISITED: MOVING THE RINGS BY COUNTING THE MOVESWALSH TR.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 64-67; BIBL. 5 REF.Article

SUR L'ISOMORPHISME DES GRAPHES D'APPLICATIONSGOROKHOVSKIJ SS; RYSTSOV IK.1982; KIBERNETIKA; ISSN 506850; UKR; DA. 1982; NO 6; PP. 117-118; BIBL. 7 REF.Article

A LONGEST COMMON SUBSEQUENCE ALGORITHM SUITABLE FOR SIMILAR TEXT STRINGSNAKATSU N; KAMBAYASHI Y; YAJIMA S et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 171-179; BIBL. 6 REF.Article

ALGORITHMICAL COMPLEXITY OF SOME STATISTICAL DECISION PROCESSES. ISINDERLAR J.1980; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1980; VOL. 16; NO 4; PP. 345-356Article

A FAST CONVEX HULL ALGORITHM.AKL SG; TOUSSAINT GT.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 5; PP. 219-222; BIBL. 16 REF.Article

ESTIMATIONS DE LA COMPLEXITE DES PROBLEMES ALGORITHMIQUES D'ANALYSE CONSTRUCTIVESHURYGIN VA.1977; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1977; VOL. 233; NO 6; PP. 1064-1067; BIBL. 10 REF.Article

FAST ALGORITHM FOR SPARSE MATRIX MULTIPLICATIONSCHOOR A.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 87-89; BIBL. 2 REF.Article

FAST ALGORITHMS FOR FINDING A SUBDIRECT DECOMPOSITION AND INTERESTING CONGRUENCES OF FINITE ALGEBRASDEMEL J.1982; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1982; VOL. 18; NO 2; PP. 121-130; BIBL. 11 REF.Article

FAST DETECTION OF POLYHEDRAL INTERSECTIONSDOBKIN DP; KIRKPATRICK DG.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 154-165; BIBL. 9 REF.Conference Paper

FINDING AN EXTREMUM IN A NETWORKLEVITAN SP; FOSTER CC.1982; ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE. 9/1982-04-26/AUSTIN TX; USA; NEW YORK: IEEE; DA. 1982; PP. 321-326; BIBL. 14 REF.Conference Paper