FAST ALGORITHMS FOR BIN PACKING.JOHNSON DS.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 272-314; BIBL. 11 REF.; (13TH ANNU. IEEE SYMP. SWITCHING AUTOM. THEORY; COLLEGE PARK, MD.; 1972)Conference Paper

FINDING VERTICES IN A PICTURE.FENG HY; PAVLIDIS T.1973; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1973; VOL. 2; NO 2; PP. 103-117; BIBL. 13 REF.Article

ETUDE DE PERFORMANCE D'ALGORITHMES D'AFFECTATION.FLORY A; GUNTHER J; KOULOUMDJIAN J et al.sdIN: CLASSIF. AUTOM. PERCEPT. ORDINATEUR. SEMIN.; ROCQUENCOURT; 1975; LE CHESNAY, FR.; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 41-52Conference Paper

MORE ACCURATE ALGORITHMS FOR ITERATIVE 3-DIMENSIONAL RECONSTRUCTION.OPPENHEIM BE.1974; I.E.E.E. TRANS. NUCL. SCI.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 72-77; BIBL. 3 REF.Article

A TUTORIAL ON ART. (ALGEBRAIC RECONSTRUCTION TECHNIQUES).GORDON R.1974; I.E.E.E. TRANS. NUCL. SCI.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 78-93; BIBL. 1 P. 1/2Article

THE WORST AND THE MOST PROBABLE PERFORMANCE OF A CLASS OF SET-COVERING ALGORITHMSLIFSCHITZ V; PITTEL B.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 329-346; BIBL. 17 REF.Article

FAST MODULAR TRANSFORMS.BORODIN A; MOENCK R.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 366-386; BIBL. 1 P.; (13TH ANNU. IEEE SYMP. SWITCHING AUTOM. THEORY; COLLEGE PARK, MD.; 1972)Conference Paper

EFFECTIVE CALCULATION OF THE INCOMPLETE GAMMA FUNCTION FOR PARAMETER VALUES ALPHA =(2N+1)/2, N=0,,5.SPELLUCCI P; PULAY P.1975; ANGEW. INFORMAT.; DTSCH.; DA. 1975; VOL. 17; NO 1; PP. 30-32; ABS. ALLEM.; BIBL. 9 REF.Article

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBAKER BS; BROWN DJ; KATSEFF HP et al.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 174-179; BIBL. 7 REF.Conference Paper

INVESTIGATION INTO SCHEDULING FOR AN INTERACTIVE COMPUTING SYSTEM.ANDERSON HA JR; SARGENT RG.1974; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1974; VOL. 18; NO 2; PP. 125-137; BIBL. 12 REF.Article

COMPUTATIONAL GEOMETRY ON INTEGER GRIDSKEIL JM; KIRKPATRICK DG.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 41-50; BIBL. 18 REF.Conference Paper

INTERACTIVE CLUSTERING OF PATTERNSNIEMANN H.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 301-304; BIBL. 8 REF.Conference Paper

BOUNDS FOR SELECTION.HYAFIL L.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 77; PP. 1-9; ABS. FR.; BIBL. 6 REF.Article

METHODES DE CALCUL ANALYTIQUES DE L'EFFICACITE DES ALGORITHMES DE COMPRESSION DES DONNEES A OUVERTURE REGLABLESVIRIDENKO VA.1974; IN: VOPR. KIBERN. SZHATIE DANNYKH.; MOSKVA; AKAD. NAUK SSSR; DA. 1974; PP. 62-76; BIBL. 14 REF.Book Chapter

ESTIMATION OF THE PROBABILITY OF ERROR WITHOUT GROUND TRUTH AND KNOWN A PRIORI PROBABILITIES.HAVENS KA; MINTER TC; TNADANI SG et al.1977; I.E.E.E. TRANS. GEOSCI. ELECTRON.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 147-152; BIBL. 2 REF.Article

THE FOURIER RECONSTRUCTION OF A HEAD SECTION.SHEPP LA; LOGAN BF.1974; I.E.E.E. TRANS. NUCL. SCI.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 21-43; BIBL. 13 REF.Article

TWO ALGORITHMS FOR PIECEWISE-LINEAR CONTINUOUS APPROXIMATION OF FUNCTIONS OF ONE VARIABLE.TOMEK I.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 4; PP. 445-448; BIBL. 2 REF.Article

AN IMPROVED VERTEX ENUMERATION ALGORITHMDYER ME; PROLL LG.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 9; NO 4; PP. 359-368; BIBL. 11 REF.Article

CONCURRENT SEARCH AND INSERTION IN 2-3 TREESELLIS CS.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 14; NO 1; PP. 63-86; BIBL. 5 REF.Article

OCENA EFEKTYWNOSCI WYBRANYCH ALGORYTMOW GOSPODARKI PAMIECIA OPERACYJNA METODA SYMULACJI CYFROWEJ = ESTIMATION DE L'EFFICACITE DE QUELQUES ALGORITHMES DE GESTION DE LA MEMOIRE PAR SIMULATION NUMERIQUEIZYDORCZYK J.1980; PODSTAWY STEROWAN.; POL; DA. 1980; VOL. 10; NO 1; PP. 23-33; ABS. ENG/RUS; BIBL. 9 REF.Article

UNIDIMENSIONAL MINIMIZATION WITH PARALLEL PROCESSINGWEISTROFFER HR; BLAKEY LC.1979; SOUTH AFRICAN SYMPOSIUM ON NUMERICAL MATHEMATICS. 5/1979/DURBAN; ZAF; DURBAN: COMPUTER SCIENCE DEPARTMENT, UNIVERSITY OF NATAL; DA. 1979; PP. 89-99; BIBL. 1 P.Conference Paper

DETERMINING THE SPATIAL CONTAINMENT OF A POINT IN GENERAL POLYHEDRAKALAY YE.1982; COMPUTER GRAPHICS AND IMAGE PROCESSING; ISSN 0146-664X; USA; DA. 1982; VOL. 19; NO 4; PP. 303-334; BIBL. 13 REF.Article

REPRESENTATION OF MULTIVALUED FUNCTIONS USING THE DIRECT COVER METHODPOMPER G; ARMSTRONG JR.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 9; PP. 674-679; BIBL. 7 REF.Article

AN ANALYSIS OF PROXIMITY-DETECTION AND OTHER ALGORITHMS IN THE ROSS SIMULATORFAUGHT WILLIAM S; KLAHR PHILIP.1981; ; USA; SANTA MONICA; RAND; DA. 1981; RAND/N-1587-AF; 46 P.; 28 CM; BIBL. 4 REF.Report

ANALYSIS OF ALGORITHMS ON THREATED TREESBRINCK K; FOO NY.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 148-155; BIBL. 6 REF.Article