The parallel recursive decoupling algorithm for solving tridiagonal linear systemsSPALETTA, G; EVANS, D. J.Parallel computing. 1993, Vol 19, Num 5, pp 563-576, issn 0167-8191Article

METHODE DE PRIORITE ET PROBLEMES DE SEPARATIONSHEN A KH.1979; DOKL. AKAD. NAUK SSSR; ISSN 0002-3264; SUN; DA. 1979; VOL. 248; NO 6; PP. 1309-1313; BIBL. 6 REF.Article

THE THEORY OF RECURSIVE FUNCTIONS, APPROACHING ITS CENTENNIALKLEENE SC.1981; BULL. AM. MATH. SOC.; ISSN 0002-9904; USA; DA. 1981; VOL. 5; NO 1; PP. 43-61; BIBL. 3 P.Article

ORIGINS OF RECURSIVE FUNCTION THEORYKLEENE SC.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 371-382; BIBL. 3 P.Conference Paper

EIN NORMALFORMENTHEOREM FUER SIGMA ₂-FUNKTIONEN = UN THEOREME DE FORME NORMALE POUR DES FONCTIONS SIGMA ₂KLETTE R; GOETZE B.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 5; PP. 251-256; ABS. ENG/RUS; BIBL. 6 REF.Article

RELATIONS ENTRE LES DIFFERENTS TYPES DE CALCULABILITE RELATIVE DES FONCTIONSPOLYAKOV EA; ROZINAS MG.1978; MAT. SBOR; SUN; DA. 1978; VOL. 107; NO 1; PP. 134-145; BIBL. 11 REF.Article

A METHOD FOR THE RECURSIVE COMPUTATION OF F-STATISTICS.HAVERLAND U.1976; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1976; VOL. 7; NO 5; PP. 721-727; ABS. ALLEM. RUSSE; BIBL. 8 REF.Article

EIN REKURSIVDEFINIERTES GEORDNETES PAAR. = UNE PAIRE ORDONNEE DEFINIE RECURSIVEMAURER C.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 3; PP. 211-214; BIBL. 5 REF.Article

BUSY BEAVER SETS: CHARACTERIZATIONS AND APPLICATIONSDALEY RP.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 52-67; BIBL. 10 REF.Article

CONSTRUCTIVELY NONPARTIAL RECURSIVE FUNCTIONSHOROWITZ BM.1980; NOTRE DAME J. FORM. LOGIC; USA; DA. 1980; VOL. 21; NO 2; PP. 273-276; BIBL. 3 REF.Article

CARACTERE QUASI DE PEANO DES FONCTIONS RECURSIVESMARCHENKOV SS.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 35; PP. 199-204; BIBL. 6 REF.Article

INDEXMENGEN UND ERKENNUNG REKURSIVER FUNKTIONEN. = ENSEMBLES D'INDICES ET RECONNAISSANCE DE FONCTIONS RECURSIVESKLETTE R.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 3; PP. 231-238; BIBL. 10 REF.Article

PRINZIPIEN UND ANWENDUNGSMOEGLICHKEITEN DIGITALER FILTER IN DER NACHRICHTENTECHNIK = PRINCIPES ET POSSIBILITES D'APPLICATION DES FILTRES NUMERIQUES DANS LA TECHNIQUE DES TELECOMMUNICATIONSGOECKLER H.1981; FREQUENZ; ISSN 0016-1136; DEU; DA. 1981; VOL. 35; NO 3-4; PP. 67-73; ABS. ENG; BIBL. 16 REF.Article

RECURSIVE FUNCTIONS WITH MEASURABLE ORACLES: AN APPROACH TO A PROBABILISTIC RECURSION THEORYSTEFANI S.1980; BOLL. UN. MAT. ITAL.; ITA; DA. 1980; VOL. 17B; NO 2; PP. 634-649; ABS. ITA; BIBL. 10 REF.Article

RECURSIVE TECHNIQUE FOR THE CONSTRUCTION OF EXPERIMENTAL DESIGNSECCLESTON JA.1980; J. STAT. PLANN. INFERENCE; ISSN 0378-3758; NLD; DA. 1980; VOL. 4; NO 3; PP. 291-297; BIBL. 6 REF.Article

METHODES CATEGORIQUES EN CALCULABILITE. I. FONCTIONS RECURSIVES ET RECURSIVES NON PRIMITIVESCALUDE C.1978; STUD. CERC. MAT.; ROMAN.; DA. 1978; VOL. 30; NO 3; PP. 253-277; ABS. ANGL.; BIBL. 2 P. 1/2Article

ALLGEMEINE UNTERSUCHUNGEN ZUR ENTSCHEIDBARKEIT UND TRENNBARKEIT BEZUEGLICH KODIERUNGEN. = ETUDE GENERALE SUR LA CAPACITE DE DECISION ET LA CAPACITE DE SEPARATION EN CE QUI CONCERNE LES CODAGESHEMMERLING A.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 6; PP. 295-309; ABS. ANGL. RUSSE; BIBL. 4 REF.Article

FAST ALGORITHMS FOR RECURSIVE IDENTIFICATION.MORF M; KAILATH T; LJUNG L et al.1976; IN: CONF. DECIS. CONTROL. SYMP. ADAPT. PROCESSES. 15. PROC.; CLEARWATER, FLA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 916-921; BIBL. 44 REF.Conference Paper

UN EXEMPLE SIMPLE D'APPRENTISSAGE AU 1ER ET AU 2EME ORDRE.KODRATOFF Y.sdIN: COMPREHENSION. SEMIN. JOURN.; ARC ET SENANS; 1977; LE CHESNAY; INST. RECH. INF. AUTOM.; DA. S.D.; PP. (3P.)Conference Paper

CLASSE DE FONCTIONNELLES REPRESENTATIVE DES FONCTIONS PROUVABLEMENT DELTA _N+1⁰ (N >OU= 0) = CLASS OF REPRESENTATIVE FUNCTIONALS OF PROVABLY DELTA _N+1⁰ (N >OU= 0) FUNCTIONSSIBILLE EMMANUEL.1982; ; FRA; DA. 1982; 55 P.; 30 CM; BIBL. 17 REF.; TH. 3E CYCLE: MATH./PARIS 7/1982Thesis

HIERARCHIES OF ONE ARGUMENT PRIMITIVE RECURSIVE FUNCTIONS.GEORGIEVA N.1976; C. R. ACAD. BULG. SCI.; BULG.; DA. 1976; VOL. 29; NO 7; PP. 919-922; BIBL. 4 REF.Article

QUELQUES PROPRIETES DES CALCULS LIMITESZDEBSKAYA GV.1979; VEROJATN. METODY KIBERN.; SUN; DA. 1979; NO 15; PP. 34-39; BIBL. 6 REF.Article

THEOREME RELATIF AU CARACTERE INDEMONTRABLE DES BORNES INFERIEURES TEMPORELLES POUR QUELQUES CLASSES DE FONCTIONSMAKAROV II.1979; VEROJATN. METODY KIBERN.; SUN; DA. 1979; NO 15; PP. 48-50; BIBL. 1 REF.Article

SUR L'ACCELERATION DE L'IDENTIFICATION LIMITE DES FONCTIONS RECURSIVES PAR UN CHANGEMENT DE L'ORDRE DES QUESTIONSKINDER EB.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 7-8; PP. 369-383; ABS. ANGL. ALLEM.; BIBL. 9 REF.Article

TABULATION TECHNIQUES FOR RECURSIVE PROGRAMSBIRD RS.1980; ACM COMPUT. SURV.; ISSN 0360-0300; USA; DA. 1980; VOL. 12; NO 4; PP. 403-417; BIBL. 26 REF.Article