Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROGRAMME TRI")

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 286

  • Page / 12
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

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 PRINCIPLE OF INDEPENDENCE FOR BINARY TREE SEARCHING.GUIBAS LJ.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 4; PP. 293-298; BIBL. 6 REF.Article

PROGRAMME DE TRI INTERNE POUR LE CALCULATEUR MINSK-32KORMILITSYN NS; KOSAREV YU G.1974; VYCHISLIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 78-83Article

MINIMAL COMPARISON SORTING BY CHOOSING MOST EFFICIENT COMPARISONS.WARREN HS JR.1973; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1973; VOL. 2; NO 5; PP. 129-130; BIBL. 5 REF.Article

A FAST STABLE MINIMUM-STORAGE SORTING ALGORITHM.RIVEST RL.1973; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1973; NO 43; PP. 1-10; ABS. FR.; BIBL. 3 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

A STUDY ON THE EVALUATION OF SHELL'S SORTING TECHNIQUE.GHOSHDASTIDAR D; ROY MK.1975; COMPUTER J.; G.B.; DA. 1975; VOL. 18; NO 3; PP. 234-235; BIBL. 5 REF.Article

PARALLELISM IN TAPESORTING. = PARALLELISME DANS LE TRI SUR BANDEEVEN S.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 4; PP. 202-204Article

PROGRAMME DE TRI INTERNE D'UN BLOC DE PHRASES DU TYPE PK POUR LE CALCULATEUR MINSK-32KORMILITSYN NS; KOSAREV YU G.1974; VYCHISLIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 84-89Article

ALGORITHMES PARALLELES DE TRIIVANOV GG.1972; OPTIMIZACIJA; S.S.S.R.; DA. 1972; NO 6; PP. 8-15; BIBL. 9 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

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

A TECHNIQUE FOR REDUCING COMPARISON TIMES IN CERTAIN APPLICATIONS OF THE MERGING METHOD OF SORTING. = UNE TECHNIQUE DE REDUCTION DES TEMPS DE COMPARAISON DANS CERTAINES APPLICATIONS DE LA METHODE DE TRI-FUSIONBARNETT JKR.1973; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1973; VOL. 2; NO 5; PP. 127-128; BIBL. 1 REF.Article

  • Page / 12