Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("VALIANT LG")

Results 1 to 24 of 24

  • Page / 1
Export

Selection :

  • and

COMPUTING MULTIVARIATE POLYNOMIALS IN PARALLELVALIANT LG.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 44-45; BIBL. 5 REF.Article

RELATIVE COMPLEXITY OF CHECKING AND EVALUATING.VALIANT LG.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 1; PP. 20-23; BIBL. 12 REF.Article

SPACE-TIME TRADEOFFS IN COMPUTATIONS.VALIANT LG.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 253-264; BIBL. 2 P. 1/2; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

THE COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMSVALIANT LG.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 410-421; BIBL. 23 REF.Article

A SCHEME FOR FAST PARALLEL COMMUNICATIONVALIANT LG.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 350-361; BIBL. 12 REF.Article

GRAPH-THEORETIC PROPERTIES IN COMPUTATIONAL COMPLEXITY.VALIANT LG.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 3; PP. 278-285; BIBL. 7 REF.Article

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.VALIANT LG.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 123-133; BIBL. 6 REF.Article

NEGATION CAN BE EXPONENTIALLY POWERFULVALIANT LG.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 303-314; BIBL. 23 REF.Article

THE EQUIVALENCE PROBLEM FOR DOL SYSTEMS AND ITS DECIDABILITY FOR BINARY ALPHABETS.VALIANT LG.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 31-37; BIBL. 8 REF.Conference Paper

PARALLELISM IN COMPARISON PROBLEMS.VALIANT LG.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 348-355; BIBL. 7 REF.Article

UNIVERSALITY CONSIDERATIONS IN VLSI CIRCUITSVALIANT LG.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 2; PP. 135-140; BIBL. 12 REF.Article

NEGATIVE RESULTS ON COUNTINGVALIANT LG.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 38-46; BIBL. 32 REF.Conference Paper

THE COMPLEXITY OF COMPUTING THE PERMANENTVALIANT LG.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 189-201; BIBL. 28 REF.Article

A NOTE ON THE SUCCINCTNESS OF DESCRIPTIONS OF DETERMINISTIC LANGUAGES.VALIANT LG.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 32; NO 2; PP. 139-145; BIBL. 10 REF.Article

GENERAL CONTEXT-FREE RECOGNITION IN LESS THAN CUBIC TIME.VALIANT LG.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 308-315; BIBL. 8 REF.Article

REGULARITY AND RELATED PROBLEMS FOR DETERMINISTIC PUSHDOWN AUTOMATO.VALIANT LG.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 1; PP. 1-10; BIBL. 13 REF.Article

A COMPLEXITY THEORY BASED ON BOOLEAN ALGEBRASKYUM S; VALIANT LG.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 244-253; BIBL. 24 REF.Conference Paper

CIRCUIT SIZE IS NONLINEAR IN DEPTH.PATERSON MS; VALIANT LG.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 397-400; BIBL. 1 REF.Article

UNIVERSAL SCHEMES FOR PARALLEL COMMUNICATIONVALIANT LG; BREBNER GJ.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. 263-277; BIBL. 17 REF.Conference Paper

SHIFTING GRAPHS AND THEIR APPLICATIONS.PIPPENGER N; VALIANT LG.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 423-432; BIBL. 19 REF.Article

FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGSANGLUIN D; VALIANT LG.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 2; PP. 155-193; BIBL. 29 REF.Article

SIZE BOUNDS FOR SUPERCONCENTRATORSLEV G; VALIANT LG.1983; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1983; VOL. 22; NO 3; PP. 233-251; BIBL. 22 REF.Article

FAST PARALLEL COMPUTATION OF POLYNOMIALS USING FEW PROCESSORSVALIANT LG; SKYUM S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 132-139; BIBL. 8 REF.Conference Paper

A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKSLEV GF; PIPPENGER N; VALIANT LG et al.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 2; PP. 93-100; BIBL. 22 REF.Article

  • Page / 1