A CRITERION OF UNDECIDABILITY OF ALGORITHMIC THEORIESDANKO W.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 205-218; BIBL. 14 REF.Conference Paper

GERARCHIE E PROBLEMI DI DECISIONE PER FUNZIONI DI SEQUENZA = HIERARCHIE DE FONCTIONS DE SEQUENCE ET PROBLEMES DE DECISIONFACHINI E.1981; RIV. INFORM.; ISSN 0390-668X; ITA; DA. 1981; VOL. 11; NO 3; SUPPL.; PP. 41-47; BIBL. 6 REF.Article

PRIMALITY TESTING AND FACTORINGFINN J; LIEBERHERR K.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 211-215; BIBL. 6 REF.Article

STRUCTURAL SIMILARITY OF PROGRAMS AND SOME CONCEPTS OF ALGORITHMIC METHODCULIK K.1972; LECTURE NOTES ECON. MATH. SYST.; GERM.; DA. 1972; NO 75; PP. 249-280; BIBL. 3 REF.Serial Issue

COMPLETENESS IN CLASSICAL LOGIC OF COMPLEX ALGORITHMSRASIOWA H.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 488-503; BIBL. 14 REF.Conference Paper

DATA STRUCTURES FOR SPARSE MATRICESREID JK.1982; RELATIONSHIP BETWEEN NUMERICAL COMPUTATION AND PROGRAMMING LANGUAGES./WORKING CONFERENCE 1981-08-03/BOULDER COI; NLD/USA/GBR; AMSTERDAM; NEW YORK; OXFORD: NORTH-HOLLAND; DA. 1982; PP. 153-161; BIBL. 2 REF.Conference Paper

THREE NEW COMBINATION ALGORITHMS WITH THE MINIMAL CHANGE PROPERTYLAM CWH; SOICHER LH.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 8; PP. 555-559; BIBL. 5 REF.Article

PROBABILISTIC ALGORITHMS AND STRAIGHT-LINE PROGRAMS FOR SOME RANK DECISION PROBLEMSIBARRA OH; MORAN S; ROSIER LE et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 227-232; BIBL. 8 REF.Article

ON BASIC CONCEPTS IN PARALLEL NUMERICAL MATHEMATICSSCHENDEL U.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 373-394; BIBL. 32 REF.Conference Paper

THE REPRESENTATION THEOREM FOR ALGORITHMIC ALGEBRASMIRKOWSKA G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 300-310; BIBL. 10 REF.Conference Paper

DYNAMIC ALGEBRAS WHICH ARE NOT KRIPKE STRUCTURESREITERMAN J; TRNKOVA V.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 528-538; BIBL. 15 REF.Conference Paper

AN AXIOMATIC APPROACH TO THE THEORY OF DATA STRUCTURES.BANACHOUSKI L.1975; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1975; VOL. 23; NO 3; PP. 315-323; ABS. RUSSE; BIBL. 5 REF.Article

SUR LA LIAISON ENTRE PROBLEMES COMBINATOIRES ET ALGORITHMIQUESVAZENIN JM.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 1; PP. 33-41; BIBL. 10 REF.Article

THE INFLUENCE OF THE ALGORITHMIC POINT OF VIEW ON MATHEMATICS AND SCIENCESTRAUB JB.1979; PERSPECTIVES SUR LA RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE. 10EME ANNIVERSAIRE DE L'INSTITUT DE RECHERCHE D'INFORMATIQUE ET D'AUTOMATIQUE. COLLOQUE/1978/PARIS; FRA; ROCQUENCOURT: IRIA; DA. 1979; PP. 43-50; BIBL. 3 REF.Conference Paper

PARALLEL NON-LINEAR ALGORITHMSFEILMEIER M; ROENSCH W.1982; COMPUT. PHYS. COMMUN.; ISSN 0010-4655; NLD; DA. 1982; VOL. 26; NO 3/4; PP. 335-348; BIBL. 15 REF.Conference Paper

ABSTRACTO 84: THE NEXT GENERATIONMEERTENS L.1979; ACM 79. ASSOCIATION FOR COMPUTING MACHINERY. 1979 ANNUAL CONFERENCE/1979/DETROIT MI; USA; NEW YORK: ACM; DA. 1979; PP. 33-39; BIBL. 5 REF.Conference Paper

ELEMENTS DE CALCUL NUMERIQUE DES FONCTIONS DE REPARTITION RELATIVES A LA REPRESENTATION TRIDIMENSIONNELLE DES TEXTURES ET AU TRACE AUTOMATIQUE DES FIGURES DE POLES CORRESPONDANTES.DURAND G.1977; ; S.L.; DA. 1977; PP. 1-5; H.T. 137; (THESE (ANNEXE) DOCT. UNIV., MENTION MATH. SPEC. ALGORITHMIQUE NUMER.; PAUL-SABATIER TOULOUSE)Thesis

COMPLETE AXIOMATIZATION OF ALGORITHMIC PROPERTIES OF PROGRAM SCHEMES WITH BOUNDED NONDETERMINISTIC INTERPRETATIONSMIRKOWSKA G.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 14-21; BIBL. 11 REF.Conference Paper

HIERARCHICAL DISCRETE SYSTEMS AND REALISATION OF PARALLEL ALGORITHMSKASABOV NK; BIJEV GT; JECHEV BJ et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 414-422; BIBL. 7 REF.Conference Paper

EXISTENCE D'ALGORITHMES OPTIMAUX POUR LES PROBLEMES COMBINATOIRES ET LES LANGAGESAJZENSHTEJN M KH.1980; USPEHI MAT. NAUK; ISSN 0042-1316; SUN; DA. 1980; VOL. 35; NO 5; PP. 221-222; BIBL. 6 REF.Article

THE DESIGN AND IMPLEMENTATION OF THE NAG MASTER LIBRARY FILE SYSTEM.RICHARDSON MG; HAGUE SJ.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 1; PP. 127-137; BIBL. 5 REF.Article

A SURVEY OF ANALYSIS TECHNIQUES FOR DISCRETE ALGORITHMS.WEIDE B.1977; COMPUTG SURV.; U.S.A.; DA. 1977; VOL. 9; NO 4; PP. 291-313; BIBL. 2 P.Article

ON THE PROPOSITIONAL ALGORITHMIC LOGICMIRKOWSKA G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 381-389; BIBL. 9 REF.Conference Paper

THEOREM ON THE NORMAL FORM OF A PROGRAM.PERKOWSKA E.1974; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 4; PP. 439-442; ABS. RUSSE; BIBL. 4 REF.Article

DEGREE OF RECURSIVE UNSOLVABILITY OF ALGORITHMIC LOGICKRECZMAR A.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 8; PP. 615-617; ABS. RUSSE; BIBL. 4 REF.Serial Issue