Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COMPLEXITE ESPACE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 655

  • Page / 27
Export

Selection :

  • and

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 HYBRID CLUSTERING PROCEDURE FOR CONCENTRIC AND CHAIN-LIKE CLUSTERSNARASIMHA MURTY M; KRISHNA G.1981; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 6; PP. 397-412; BIBL. 8 REF.Article

THE SPACE COMPLEXITY OF PEBBLE GAMES ON TREESLENGAUER T; TARJAN RE.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 184-188; BIBL. 10 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

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

UTILISATION DE LA NUMEROTATION BINAIRE POUR LE CALCUL DE LA CONSANGUINITELEFEBVRE J.1981; ANN. GENET. SEL. ANIM.; ISSN 0003-4002; FRA; DA. 1981; VOL. 13; NO 4; PP. 447-458; ABS. ENG; BIBL. 17 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 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

SYMMETRIC SPACE-BOUNDED COMPUTATIONLEWIS HR; PAPADIMITRIOU CH.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 161-187; BIBL. 23 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

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

AN ASSESSMENT OF A NEW TECHNIQUE FOR THE REPRESENTATION OF BOOLEAN MATRICESDODD WP.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 2; PP. 115-139; BIBL. 1 REF.Article

BLACK-WHITE PEBBLES AND GRAPH SEPARATIONLENGAUER T.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 4; PP. 465-475; BIBL. 15 REF.Article

ON SIMULTANEOUS RESOURCE BOUNDS (PRELIMINARY VERSION)PIPPENGER 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. 307-311; BIBL. 13 REF.Conference Paper

EPSILON -PRODUCTIONS IN CONTEXT-FREE GRAMMARSGOLDSCHLAGER LM.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 303-308; BIBL. 10 REF.Article

A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINESBORODIN A; FISCHER MJ; KIRKPATRICK DG et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 351-364; BIBL. 18 REF.Article

THE SPACE EFFICIENCY OF QUADTREESDYER CR.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 19; NO 4; PP. 335-348; BIBL. 17 REF.Article

A NOTE ON REPRESENTATIONS OF A CERTAIN MONOIDSQUIER C; WRATHALL C.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 229-231; BIBL. 3 REF.Article

ON TIME VERSUS SPACE IIPAUL W; REISCHUK R.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 312-327; BIBL. 11 REF.Article

RELATIVIZING TIME AND SPACEBOOK RV; WILSON CB; XU MEIRUI et al.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 254-259; BIBL. 15 REF.Conference Paper

A TIME-SPACE TRADEOFF FOR SORTING ON A GENERAL SEQUENTIAL MODEL OF COMPUTATIONBORODIN A; COOK S.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 287-297; BIBL. 16 REF.Article

PEBBLING WITH AN AUXILIARY PUSH DOWNPIPPENGER N.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 2; PP. 151-165; BIBL. 16 REF.Conference Paper

A SPACE BOUND FOR ONE-TAPE MULTIDIMENSIONAL TURING MACHINESLOUI MC.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 311-320; BIBL. 9 REF.Article

  • Page / 27