BOUNDS ON OPTIMAL MERGE PERFORMANCE, AND A STRATEGY FOR OPTIMALITYFRAZER WD; BENNETT BT.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 4; PP. 641-648; BIBL. 7 REF.Serial Issue

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

IMPROVED DIVIDE/SORT/MERGE SORTING NETWORKS.DRYSDALE RLS III; YOUNG FH.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 264-270; BIBL. 8 REF.Article

PARALLELISM IN COMPARISON PROBLEMS.VALIANT LG.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 348-355; BIBL. 7 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

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

MEDIAN SELECTION OF 9 ELEMENTS IN 14 COMPARISONS.NOSHITA K.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 8-12; BIBL. 2 REF.Article

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

ESTIMATION DE L'EFFICACITE DE L'ALGORITHME DE FUSION DE DEUX ENSEMBLES ORDONNESRYBINSKY H.1973; ALGORYTMY; POLSKA; DA. 1973; VOL. 10; NO 17; PP. 45-57; ABS. RUSSE ANGL.; BIBL. 5 REF.Serial Issue

STABLE SORTING IN ASYMPTOTICALLY OPTIMAL TIME AND EXTRA SPACE.HORVATH EC.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 2; PP. 179-199; BIBL. 11 REF.Article

TRI DANS LE STANDARD OFFICIEL "LANGAGE DE PROGRAMMATION COBOL"PERVIN YU A.1978; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1978; NO 3; PP. 73-76Article

A SORTING ALGORITHM FOR POLYNOMIAL MULTIPLICATION.HOROWITZ E.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 450-462; BIBL. 6 REF.Article

ALLOCATION OPTIMALE ET QUASI OPTIMALE DE LA MEMOIRE CENTRALE DANS LE TRI PAR FUSION SUR DISQUE.HYAFIL L; PRUSKER F; VUILLEMIN J et al.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 85; PP. 1-10; ABS. ANGL.; BIBL. 5 REF.Article

PARALLEL COMPLEXITY OF SORTING PROBLEMSAIGNER M.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 79-88; BIBL. 6 REF.Article

TRI PAR LA METHODE DE FUSION SUR UN CALCULATEUR PARALLELECHARNAYA IS.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 9; PP. 186-191; ABS. ENG; BIBL. 3 REF.Article

REMARKS ON "A SYNTHESIS OF SEVERAL SORTING ALGORITHMS" BY JOHN DARLINGTONBARSTOW DR.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 3; PP. 225-227; BIBL. 7 REF.Article

RANKING PROBLEM BASED ON PAIRED COMPARISON DATAISHIKAWA M; MATSUDA I; KAYA Y et al.1979; ELECTR. ENG. JPN.; ISSN 0036-9691; USA; DA. 1979 PUBL. 1981; VOL. 99; NO 6; PP. 128-136; BIBL. 10 REF.Article

A PARELLEL MERGING ALGORITHMBARLOW RH; EVANS DJ; SHANEHCHI J et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 103-106; BIBL. 8 REF.Article

SORTING AND MERGING IN ROUNDSHAEGGKVIST R; HELL P.1982; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 465-473; BIBL. 17 REF.Conference Paper

Transposition of matrix stored on sequential fileTWIGG, D. W.IEEE transactions on computers. 1983, Vol 32, Num 12, pp 1185-1188, issn 0018-9340Article

Merging by decomposition revisitedDVORAK, S; DURIAN, B.Computer journal (Print). 1988, Vol 31, Num 6, pp 553-556, issn 0010-4620Article

A hardware sort-merge systemTAKAGI, N; WONG, C. K.IBM journal of research and development. 1985, Vol 29, Num 1, pp 49-67, issn 0018-8646Article

Stable linear time sublinear space mergingDVORAK, S; DURIAN, B.Computer journal (Print). 1987, Vol 30, Num 4, pp 372-375, issn 0010-4620Article

Page / 4