PARALLEL ALGORITHMS FOR THE ITERATIVE SOLUTION TO LINEAR SYSTEMSBARLOW RH; EVANS DJ.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 1; PP. 56-60; BIBL. 8 REF.Article

A QUANTIZATION APPROXIMATION FOR MODELING COMPUTER NETWORK NODAL QUEUEING DELAYNIZNIK CA.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 245-253; BIBL. 42 REF.Article

PARALLEL SORTINGBOLLOBAS B; THOMASON A.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 1; PP. 1-11; BIBL. 10 REF.Article

THE NECESSITY OF PUBLISHING PROGRAMSDUNHAM CB.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 1; PP. 61-62; BIBL. 8 REF.Article

PRESENTATION DE LA "MACHINE VECTORIELLE", MODELE ABSTRAIT DU CRAY-1BOSSAVIT A.1982; BULLETIN DE LA DIRECTION DES ETUDES ET RECHERCHES - ELECTRICITE DE FRANCE. SERIE C, MATHEMATIQUES, INFORMATIQUE; ISSN 0013-4511; FRA; DA. 1982; NO 1; PP. 55-69; BIBL. 22 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

CONCURRENT ALGORITHMS FOR ROOT SEARCHINGERIKSEN O; STAUNSTRUP J.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 361-376; BIBL. 3 REF.Article

A CONSTANT-TIME PARELLEL ALGORITHM FOR COMPUTING CONVEX HULLSAKL SG.1982; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 2; PP. 130-134; BIBL. 14 REF.Article

PARALLEL ALGORITHMS IN GRAPH THEORY PLANARITY TESTINGJA'JA' J; SIMON J.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 314-328; BIBL. 24 REF.Article

PERMUTATION GENERATION ON VECTOR PROCESSORSMOR M; FRAENKEL AS.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 4; PP. 423-428; BIBL. 16 REF.Article

A PARALLEL ALGORITHM FOR CONSTRUCTING MINIMUM SPANNING TREESBENTLEY JL.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 11-20; BIBL. 12 REF.Conference Paper

A HYBRID ALGORITHM FOR THE SHORTEST PATH BETWEEN TWO NODES IN THE PRESENCE OF FEW NEGATIVE ARCSYAP CK.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 181-182; BIBL. 2 REF.Article

MORE ABOUT A THINNING ALGORITHMARCELLI C; ORDELLA LP; LEVIALDI S et al.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 2; PP. 51-53; BIBL. 6 REF.Article

A PARALLEL ALGORITHM FOR CONSTRUCTING MINIMUM SPANNING TREESBENTLEY JL.1980; J. ALOGARITHMS; USA; DA. 1980; VOL. 1; NO 1; PP. 51-59; BIBL. 12 REF.Article

IMPROVED SPEEDUP BOUNDS FOR PARALLEL ALPHA-BETA SEARCHFINKEL RA; FISHBURN JP.1983; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; ISSN 0162-8828; USA; DA. 1983; VOL. 5; NO 1; PP. 89-92; BIBL. 5 REF.Article

ORGANISATION DU CALCUL EN PARALLELE DE RECURRENCES VECTORIELLES = ORGANISATION OF THE CALCULATION IN PARALLEL OF VECTORIAL RECURRENCESROBERT Y; TCHUENTE M.1981; ; FRA; DA. 1981; IMAG-RR/261; 19 P.; 30 CM; ABS. ENG; BIBL. 2 REF.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-261]Report

ON THE REPRESENTATION OF MULTI-INPUT SYSTEMS: COMPUTATIONAL PROPERTIES OF POLYNOMIAL ALGORITHMSPOGGIO T; REICHARDT W.1980; BIOL. CYBERN.; DEU; DA. 1980; VOL. 37; NO 3; PP. 167-186; BIBL. 42 REF.Article

A NOTE ON THE PARALLEL COMPLEXITY OF COMUTING THE RANK OF ORDER N MATRICESIBARRA OH; MORAN S; ROSIER LE et al.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 4-5; PP. 162; BIBL. 2 REF.Article

INSOLUBILITE DU TRAITEMENT PARALLELE MAXIMALVAL'KOVSKIJ VA.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 5; PP. 148; BIBL. 4 REF.Article

SOLVING LINEAR ALGEBRAIC EQUATIONS ON AN MIMD COMPUTERLORD RE; KOWALIK JS; KUMAR SP et al.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 103-117; BIBL. 11 REF.Article

BINARY TREES AND PARALLEL SCHEDULING ALGORITHMSDEKEL E; SAHNI S.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 307-315; BIBL. 38 REF.Article

MODELING UNUSUAL BEHAVIOR OF PARALLEL ALGORITHMSWEIDE BW.1982; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 11; PP. 1126-1130; BIBL. 11 REF.Article

PARALLEL ALGORITHMS FOR THE SINGLE SOURCE SHORTEST PATH PROBLEMMATETI P; DEO N.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 1; PP. 31-49; ABS. GER; BIBL. 26 REF.Article

COMMUNICATION ISSUES IN THE DESIGN AND ANALYSIS OF PARALLEL ALGORITHMSLINT B; AGERWALA T.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 2; PP. 174-188; BIBL. 71 REF.Article

DESIGN AND DEVELOPMENT OF CONCURRENT PROGRAMSJULLIAND J; PERRIN GR.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 464-479; BIBL. 14 REF.Conference Paper