ALGORITHME DE RECHERCHE TAXONOMIQUE ORIENTE DES SOUS-SYSTEMES DE CRITERES D'INFORMATIONELKINA VN; ZAGORUJKO NG; TIMERKAEV VS et al.1974; VYCHISLIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 49-70; H.T. 2; BIBL. 11 REF.Article

PRINCIPES DE PRODUCTION D'UN JEU COMPLET D'ALGORITHMES POUR DES PROGRAMMES DE SERVICE PAR L'EXEMPLE DU PROGRAMME "TRI-FUSION"KAZARITSKIJ SD; ZUBOV VS.1974; TRUDY MOSKOV. ENERGET. INST.; S.S.S.R.; DA. 1974; NO 176; PP. 32-38; BIBL. 4 REF.Article

TRI ARBORESCENT DES ENREGISTREMENTS D'UN CALCULATEURKOZLOVA SI.1974; KIBERNETICA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 4; PP. 28-29; ABS. ANGL.; BIBL. 5 REF.Article

A LEXICAL-SORTING ROUTINE.BERNABEI R; D'ANGELO S; MARCHIORO P et al.1975; ATTI ACCAD. NAZION. LINCEI, R.C., CL. SCI. FIS. MAT. NAT.; ITAL.; DA. 1975; VOL. 58; NO 3; PP. 398-404; ABS. ITAL.; BIBL. 5 REF.Article

MINIMAL-GROWTH-RATE MERGE SORTARKUN ME.1971; MICROWAVE RES. INST. SYMP. SER.; U.S.A.; DA. 1971; VOL. 21; PP. 313-326; BIBL. 11 REF.Serial Issue

ON FINDING THE MAXIMA OF A SET OF VECTORS.KUNG HT; LUCCIO F; PREPARATA FP et al.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 469-476; BIBL. 4 REF.Article

PROGRAMMES DE TAXONOMIE (AGREGATION) D'OBJETSGRIGOR'EV YU D; KOTYUKOV VI.1974; VYCHISBIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 71-77Article

ECONOMICAL ASPECTS OF SORTING IN MULTIPROCESSOR SYSTEMSKARCZEWSKI J; KOWALSKI AC.1972; PRACE C.O.P.A.N.; POLSKA; DA. 1972; NO 71; PP. 1-21; ABS. ANGL. RUSSE; BIBL. 1 P 1/2Serial Issue

A STABLE MINIMUM STORAGE SORTING ALGORITHM.DEWAR RBK.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 2; NO 6; PP. 162-164; BIBL. 2 REF.Article

A STRUCTURED PROGRAM TO GENERATE ALL TOPOLOGICAL SORTING ARRANGEMENTS.KNUTH DE; SZWARCFITER JL.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 2; NO 6; PP. 153-157; BIBL. 6 REF.Article

SORTING PRESORTED FILESMEHLHORN K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 199-212; BIBL. 8 REF.Conference Paper

TRI NON HOMOGENEANISIMOV AV; KNUTH DE.1979; PROGRAMMIROVANIE; SUN; DA. 1979; NO 1; PP. 11-14; BIBL. 2 REF.Article

SOME ASPECTS OF SORTING IN TWO DIMENSIONSFERRETTI C.1978; CALCOLO; ITA; DA. 1978 PUBL. 1979; VOL. 15; NO 3; PP. 259-275; BIBL. 5 REF.Article

A SYNTHESIS OF SEVERAL SORTING ALGORITHMSDARLINGTON J.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 11; NO 1; PP. 1-30; BIBL. 6 REF.Article

A NUMBERING SYSTEM FOR PERMUTATIONS OF COMBINATIONS.KNOTT GD.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 6; PP. 355-356; BIBL. 7 REF.Article

SORTING BY NATUREL SELECTIONFRAZER WD; WONG CK.1972; COMMUNIC. A.C.M.; U.S.A.; DA. 1972; VOL. 15; NO 10; PP. 910-913; BIBL. 5 REF.Serial Issue

CONTROLLED DENSITY SORTINGMELVILLE R; GRIES D.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 169-172; BIBL. 5 REF.Article

SELECTION BY DISTRIBUTIVE PARTITIONINGALLISON DCS; NOGA MT.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 7-8; BIBL. 6 REF.Article

SYNTHESIS AND STRUCTURAL ANALYSIS OF ABSTRACT PROGRAMSCOWELL DF; GILLIES DF; KAPOSI AA et al.1980; COMPUTER J.; GBR; DA. 1980; VOL. 23; NO 3; PP. 243-247; BIBL. 15 REF.Article

FORTRAN SUBROUTINES FOR RANDOM SAMPLING WITHOUT REPLACEMENT.GREEN BF JR.1977; BEHAV. RES. METHODS INSTRUMENT.; U.S.A.; DA. 1977; VOL. 9; NO 6; PP. 559; BIBL. 4 REF.Article

ORGANISATION DES PSEUDOBLOCS EN REFALLEBEDINSKIJ MM.1974; ZAP. NAUCH. SEMINAR. L.O.M.I.; S.S.S.R.; DA. 1974; VOL. 48; PP. 18-22; BIBL. 1 REF.Article

A balanced bin sort of hypercube multicomputersYOUNGJU WON; SARTAJ SAHNI.Journal of supercomputing. 1988, Vol 2, Num 4, pp 435-448, issn 0920-8542Article

A note on the higher moments of the expected behavior of straight insertion sortPANNY, W.Information processing letters. 1986, Vol 22, Num 4, pp 175-177, issn 0020-0190Article

Matching nuts and bolts fasterALON, N; BRADFORD, P. G; FLEISCHER, R et al.Information processing letters. 1996, Vol 59, Num 3, pp 123-127, issn 0020-0190Article

A note on synthesis and classification of sorting algorithmsLAU, K. K.Acta informatica. 1989, Vol 27, Num 1, pp 73-80, issn 0001-5903Article