USING A MICROPROCESSOR AT SPEEDS BEYOND ITS APPARENT INTRINSIC LIMIT.SCHWARTZ M; WINTER K.1976; COMPUTER DESIGN; U.S.A.; DA. 1976; VOL. 15; NO 6; PP. 106-110 (3P.)Article

TIME BOUNDS ON THE PARALLEL EVALUATION OF ARITHMETIC EXPRESSIONS.KUCK DJ; MARUYAMA K.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 2; PP. 147-162; BIBL. 19 REF.Article

BOUNDS FOR THE STRING EDITING PROBLEM.WONG CK; CHANDRA AK.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 13-16; BIBL. 4 REF.Article

PRESERVING ORDER IN A FOREST IN LESS THAN LOGARITHMIC TIME.EMDE BOAS PV.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 75-84; BIBL. 11 REF.Conference Paper

FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES.SMITH ML; PANWALKAR SS; DUDEK RA et al.1975; MANAG. SCI.; U.S.A.; DA. 1975; VOL. 21; NO 5; PP. 544-549; BIBL. 5 REF.Article

TIME AND PARALLEL PROCESSOR BOUNDS FOR LINEAR RECURRENCE SYSTEM.SHYH CHING CHEN; KUCK DJ.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 7; PP. 701-717; BIBL. 10 REF.Article

BOUNDS FOR SELECTION.HYAFIL L.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 109-114; BIBL. 6 REF.Article

SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPANBRUNO J; DOWNEY P; FREDERICKSON GN et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 100-113; BIBL. 8 REF.Article

TWO SINGLE MACHINE SEQUENCING PROBLEMS INVOLVING CONTROLLABLE JOB PROCESSING TIMESVICKSON RG.1980; A.I.I.E. TRANS.; USA; DA. 1980; VOL. 12; NO 3; PP. 258-262; BIBL. 13 REF.Article

VERIFICATION OF COMPUTER SYSTEM MODELS BY MEASURED CP4 PROCESSING TIME DISTRIBUTIONHARADA N; HAKOZAKI K.1978; SYST. COMPUTERS CONTROLS; USA; DA. 1978; VOL. 9; NO 1; PP. 69-76; BIBL. 11 REF.Article

A PROCESSOR IN SERIES WITH DEMAND-INTERRUPTING DEVICES, A STOCHASTIC MODEL.HOFRI M; YADIN M.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 270-290; BIBL. 7 REF.Article

UN FIL D'ARIANE. II: MICROPROCESSEURS ET CONCEPTION DES PETITS ORDINATEURSBOUHOT JP; COTTIN G; TRICOT J et al.sdCA.H., C.I.L.O.; FRA; DA. S.D.; NO 6; PP. 3-16Article

ANALYSIS OF SELF-INDEXING, DISC FILES.WATERS SJ.1975; COMPUTER J.; G.B.; DA. 1975; VOL. 18; NO 3; PP. 200-205; BIBL. 7 REF.Article

IMPLEMENTATION OF A COMPUTER JOB SCHEDULING ALGORITHM: A CASE HISTORYGUJAR UG; FELLOWS DM.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 5; PP. 529-542; BIBL. 12 REF.Article

MODIFICATIONS TO THE FORSYTHE-MOLER ALGORITHM FOR SOLVING LINEAR ALGEBRAIC SYSTEMS.SMITH DA; GUIPRE PS.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 6; PP. 174-177; BIBL. 2 REF.Article

WITHDRAWAL FROM HEROIN IN THREE OR SIX WEEKS: COMPARISON OF METHADYL ACETATE AND METHADONESORENSEN JL; HARGREAVES WA; WEINBERG JA et al.1982; ARCHIVES OF GENERAL PSYCHIATRY; ISSN 0003-990X; USA; DA. 1982; VOL. 39; NO 2; PP. 167-171; BIBL. 19 REF.Article

IMPROVEMENT OF RELOCATABLE LINKAGE EDITOR (LOADER) INPUTMUCKE FU; TRIER W.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 4; PP. 417-419; BIBL. 4 REF.Article

A SIMPLE PRIORITY QUEUE IN WHICH INITIALIZATION AND QUEUE OPERATIONS TAKE O (LOGLOG N) TIMEJOHNSON DB.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 66-71; BIBL. 11 REF.Conference Paper

A SOLVABLE CASE OF THE ONE-MACHINE SCHEDULING PROBLEM WITH READY AND DUE TIMES.KISE H; IBARAKI T; MINE H et al.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 121-126; BIBL. 7 REF.Article

APPLICATION OF PROBABILISTIC TECHNIQUES TO NP-HARD NUMBER PROBLEMSJOHNSON DB; KASHDAN SD.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 46-51; BIBL. 17 REF.Conference Paper

MINIMIZING PROCESSING RESTS IN AN AUTOMATED OFFICE SYSTEMSMITH SA.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 5; PP. 232-242; BIBL. 12 REF.Article

SPEEDUP IN PARALLEL ALGORITHMS FOR ADAPTIVE QUADRATURELEMME JM; RICE JR.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 1; PP. 65-71; BIBL. 5 REF.Article

COMPARISON OF DIFFERENT DISK SEARCHING METHODSQUITTNER P; KOTSIS D.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 6; PP. 673-679; BIBL. 5 REF.Article

MINIMAL RESOURCES FOR FIXED AND VARIABLE JOB SCHEDULES.GERTSBAKH I; STERN HI.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 68-85; BIBL. 11 REF.Article

A STUDY OF LINE OVERHEAD IN THE ARPANET.KLEINROCK L; NAYLOR WE; OPDERBECK H et al.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 1; PP. 3-13; BIBL. 23 REF.Article