Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("SORT ROUTINE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 262

  • Page / 11
Export

Selection :

  • and

THE THEORY AND PRACTICE OF CONSTRUCTING AN OPTIMAL POLYPHASE SORTER MC; LOWDEN BGT.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 1; PP. 93-101; BIBL. 6 REF.Article

A COMPUTER ANIMATION COMPOSED OF CONNECTED ANIMATION PRIMITIVESAGUI T; NAKAJIMA M; SEKINE H et al.1981; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1981 PUBL. 1982; VOL. 12; NO 2; PP. 45-54; BIBL. 12 REF.Article

QUICKSHUNT - A DISTRIBUTIVE SORTING ALGORITHMMCCULLOCH CM.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 1; PP. 102-104; BIBL. 3 REF.Article

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

A STABLE QUICKSORTMOTZKIN D.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 6; PP. 607-611; BIBL. 16 REF.Article

AN EFFICIENT VARIATION OF BUBBLE SORTDOBOSIEWICZ W.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 5-6; BIBL. 3 REF.Article

SUR DEUX METHODES DE TRI DES ELEMENTS DANS LES BLOCS D'INFORMATIONZABELLO EP.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 2; PP. 17-21; ABS. ANGL.; BIBL. 7 REF.Article

More on shellsort increment sequencesWEISS, M. A; SEDGEWICK, R.Information processing letters. 1990, Vol 34, Num 5, pp 267-270, issn 0020-0190Article

A versatile sorting and ranking programBROPHY, A. L.Behavior research methods and instrumentation. 1983, Vol 15, Num 4, pp 465-466, issn 0005-7878Article

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

SUR LA QUALITE DE LA REALISATION DES VARIABLES A INDICES PAR UN TRADUCTEUR OPTIMISANT DU FORTRAN POUR UN SYSTEME UNIFIE DE CALCULATEURSOSTROVSKIJ VV.1983; VESTNIK MOSKOVSKOGO UNIVERSITETA. SERIJA15: VYCISLITEL'NAJA MATEMATIKA I KIBERNETIKA; ISSN 509701; SUN; DA. 1983; NO 1; PP. 52-58; BIBL. 4 REF.Article

AN IMPROVED METHOD OF IMMEDIATE GARBAGE COLLECTIONFUJITA Y; NISHIDA F.1981; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1981 PUBL. 1982; VOL. 12; NO 2; PP. 39-44; BIBL. 7 REF.Article

LINEAR EXPECTED TIME OF A SIMPLE UNION-FIND ALGORITHM.DOYLE J; RIVEST RL.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 5; PP. 146-148; BIBL. 4 REF.Article

A CASE STUDY OF STRUCTURED PROGRAMMING WITH CORRECTNESS PROOFS.ICHBIAH JD; HELIARD JC.1976; LECTURES NOTES COMPUTER SCI.; GERM.; DA. 1976; NO 44; PP. 276-286; BIBL. 12 REF.; (EUR. COOP. INF. CONF. 1. PROC.; AMSTERDAM; 1976)Conference Paper

OPTIMAL SORTING ALGORITHMS FOR PARALLEL COMPUTERS.BAUDET G; STEVENSON D.sdIN: ANAL. CONTROLE SYST. SEMIN.; ROCQUENCOURT; 1975; LE CHESNAY; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 41-50; BIBL. 10 REF.Conference Paper

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

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

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

  • Page / 11