A GENERAL CLASS OF RESOURCE TRADEOFFSBENTLEY JL; BROWN DJ.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 2; PP. 214-238; BIBL. 29 REF.Article

A LOWER BOUND TO FINDING CONVEX HULLSCHI CHIH YAO A.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 780-787; BIBL. 5 REF.Article

A LOWER BOUND OF KN² ON TIME-COMPLEXITY FOR ONE-TAPE AUTOMATON COMPUTATIONSTAO RENJI.1982; SCI. SIN., SER. A, MATH. PHYS. ASTRON. TECH. SCI.; ISSN 504289; CHN; DA. 1982; VOL. 25; NO 8; PP. 866-876; BIBL. 3 REF.Article

A NOTE ON STRUCTURE AND LOOKING BACK APPLIED TO THE RELATIVE COMPLEXITY OF COMPUTABLE FUNCTIONSCHEW P; MACHTEY M.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 53-59; BIBL. 2 REF.Article

A SPACE-OPTIMAL SOLUTION OF GENERAL REGION LOCATIONEDELSBRUNNER H; MAURER HA.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 329-336; BIBL. 14 REF.Article

ACCESSIBILITY OF VALUES AS A DETERMINANT OF RELATIVE COMPLEXITY IN ALGEBRASLYNCH NA.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 101-113; BIBL. 5 REF.Article

LOCALIZED SEARCH IN SORTED LISTKOSARAJU SR.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 62-69; BIBL. 6 REF.Conference Paper

LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIESFREDMAN ML.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 696-705; BIBL. 11 REF.Article

ON THE COMPUTATIONAL POWER OF AUTOMATA WITH TIME OR SPACE BOUNDED BY ACKERMANN'S OR SUPEREXPONENTIAL FUNCTIONSREN JI TAO.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 115-148; BIBL. 11 REF.Article

A HARDEST LANGUAGE RECOGNIZED BY TWO-WAY NONDETERMINISTIC PUSHDOWN AUTOMATARYTTER W.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 145-146; BIBL. 3 REF.Article

A NOTE ON LINEAR EXPECTED TIME ALGORITHMS FOR FINDING CONVEX HULLSDEVROYE L; TOUSSAINT GT.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 26; NO 4; PP. 361-366; ABS. GER; BIBL. 14 REF.Article

A HOMOMORPHIC CHARACTERIZATION OF TIME AND SPACE COMPLEXITY CLASSES OF LANGUAGESCULIK K II; DIAMOND ND.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 207-222; BIBL. 9 REF.Article

LENGTH OF PREDICATE CALCULUS FORMULAS AS A NEW COMPLEXITY MEASUREIMMERMAN N.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. 337-347; BIBL. 15 REF.Conference Paper

ON TIME VERSUS SPACE.HOPCROFT J; PAUL W; VALIANT L et al.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 2; PP. 332-337; BIBL. 11 REF.Article

PREEMPTIVE SCHEDULING OF PERIODIC JOBS IN UNIFORM MULTIPROCESSOR SYSTEMSBERTOSSI AA; BONUCELLI MA.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 3-6; BIBL. 7 REF.Article

EXTREME TIME-SPACE TRADEOFFS FOR GRAPHS WITH SMALL SPACE REQUIREMENTSCARLSON DA; SAVAGE JE.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 223-227; BIBL. 15 REF.Article

ON THE TIME-SPACE TRADEOFF FOR SORTING WITH LINEAR QUERIESCHI CHIH YAO A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 203-218; BIBL. 7 REF.Article

SORTING NUMBERS IN LINEAR EXPECTED TIME AND OPTIMAL EXTRA SPACEGONZALEZ TF; JOHNSON DB.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 3; PP. 119-124; BIBL. 13 REF.Article

PARALLEL MATRIX AND GRAPH ALGORITHMSDEKEL E; NASSIMI D; SARTAJ SAHNI et al.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 657-675; BIBL. 33 REF.Article

SEARCHING GAME TREES IN PARALLELAKL SG; BARNARD DT; DORAN RJ et al.1981; CLASSIFICATION AUTOMATIQUE ET PERCEPTION PAR ORDINATEUR. SEMINAIRE/1979/ROCQUENCOURT; FRA; ROCQUENCOURT: INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE; DA. 1981; PP. 121-128; BIBL. 12 REF.Conference Paper

THE DYNAMIC SIMULATION OF RECURSIVE AND STACK MANIPULATING PROGRAMSRYTTER W.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 2; PP. 58-63; BIBL. 8 REF.Article

TIME AND SPACE BOUNDED COMPLEXITY CLASSES AND BAND WIDTH CONSTRAINED PROBLEMS. (A SURVEY)MONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 78-93; BIBL. 27 REF.Conference Paper

ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORSDAVIS E; JAFFE JM.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 721-736; BIBL. 13 REF.Article

BOUNDS FOR ON-LINE SELECTIONRUZICKA P.1981; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1981; VOL. 17; NO 2; PP. 147-157; BIBL. 3 REF.Article

TWO FAMILIAR TRANSITIVE CLOSURE ALGORITHMS WHICH ADMIT NO POLYNOMIAL TIME, SUBLINEAR SPACE IMPLEMENTATIONSTOMPA M.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 333-338; BIBL. 17 REF.Conference Paper