Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("LIPTON RJ")

Results 1 to 25 of 46

  • Page / 2

Export

Selection :

  • and

POLYNOMIALS WITH 0-1 COEFFICIENTS THAT ARE HARD TO EVALUATE.LIPTON RJ.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 6-10; BIBL. 7 REF.Conference Paper

REDUCTION: A METHOD OF PROVING PROPERTIES OF PARALLEL PROGRAMS.LIPTON RJ.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 12; PP. 717-721; BIBL. 6 REF.; (2ND. ACM SYMP. PRINC. PROGRAM. LANG.; PALO ALTO, CALIF.; 1975)Conference Paper

THE CONSISTENCY OF "P=NP" AND RELATED PROBLEMS WITH FRAGMENTS OF NUMBER THEORYDEMILLO RA; LIPTON RJ.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 45-57; BIBL. 32 REF.Conference Paper

THE ORBIT PROBLEM IS DECIDABLERAVINDRAN KANNAN; LIPTON RJ.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 252-261; BIBL. 13 REF.Conference Paper

APPLICATIONS OF A PLANAR SEPARATOR THEOREMLIPTON RJ; TARJAN RE.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 615-627; BIBL. 33 REF.Article

EVALUATION OF POLYNOMIALS WITH SUPER-PRECONDITIONING.LIPTON RJ; STOCKMEYER LJ.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 2; PP. 124-139; BIBL. 18 REF.Article

A LINEAR TIME ALGORITHM FOR DECIDING SUBJECT SECURITY.LIPTON RJ; SNYDER L.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 455-464; BIBL. 6 REF.Article

ON THE COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVESDOBKIN DP; LIPTON RJ.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 1; PP. 86-91; BIBL. 7 REF.Article

WORD PROBLEMS SOLVABLE IN LOGSPACE.LIPTON RJ; ZALCSTEIN Y.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 522-526; BIBL. 16 REF.Article

CENSUS FUNCTIONS: AN APPROACH TO VLSI UPPER BOUNDSLIPTON RJ; VALDES J.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 13-22; BIBL. 6 REF.Conference Paper

COMPUTING EXTREMAL AND APPROXIMATE DISTANCES IN GRAPHS HAVING UNIT COST EDGESBOOTH KS; LIPTON RJ.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 319-328; BIBL. 8 REF.Article

ON FAULT TOLERANT SYSTEMSLIPTON RJ; SAYWARD FG.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 209-216; BIBL. 9 REF.Conference Paper

THE ENFORCEMENT OF SECURITY POLICIES FOR COMPUTATIONJONES AK; LIPTON RJ.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 1; PP. 35-55; BIBL. 17 REF.Article

A BATCHING METHOD FOR COLORING PLANAR GRAPHSLIPTON RJ; MILLER RE.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 185-188; BIBL. 6 REF.Article

A PROBABILISTIC REMARK ON ALGEBRAIC PROGRAM TESTINGDEMILLO RA; LIPTON RJ.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 193-195; BIBL. 7 REF.Article

COMPLEXITY MEASURES AND HIERARCHIES FOR THE EVALUATION OF INTEGERS AND POLYNOMIALS.LIPTON RJ; DOBKIN D.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 349-357; BIBL. 10 REF.Article

A CONSTRUCTIVE GENERALIZATION OF THE BOREL-CANTELLI LEMMA WITH APPLICATION TO THE COMPLEXITY OF INFINITE STRINGSDE MILLO RA; LIPTON RJ.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 95-104; BIBL. 7 REF.Article

SOME CONNECTIONS BETWEEN NONUNIFORM AND UNIFORM COMPLEXITY CLASSESKARP RM; LIPTON RJ.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 302-309; BIBL. 18 REF.Conference Paper

MULTIDIMENSIONAL SEARCHING PROBLEMS.DOBKIN D; LIPTON RJ.1976; S.I.A.M.J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 2; PP. 181-186; BIBL. 5 REF.Article

LOWER BOUNDS FOR VLSILIPTON RJ; SEDGENICK R.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. 300-307; BIBL. 11 REF.Conference Paper

ADDITION CHAIN METHODS FOR THE EVALUATION OF SPECIFIC POLYNOMIALSDOBKIN D; LIPTON RJ.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 121-125; BIBL. 11 REF.Article

A SEPARATOR THEOREM FOR PLANAR GRAPHSLIPTON RJ; TARJAN RE.1979; S.I.A.M. J. APPL. MATH.; USA; DA. 1979; VOL. 36; NO 2; PP. 177-189; BIBL. 17 REF.Article

MUTATION ANALYSIS OF DECISION TABLE PROGRAMSBUDD TA; LIPTON RJ.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; ABS. 346-349; BIBL. 7 REF.Conference Paper

A LOWER BOUND OF 1/2N2 ON LINEAR SEARCH PROGRAMS FOR THE KNAPSACK PROBLEMDOBKIN D; LIPTON RJ.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 3; PP. 413-417; BIBL. 11 REF.Article

THE ENFORCEMENT OF SECURITY POLICIES FOR COMPUTATION.JONES AK; LIPTON RJ.1975; IN: SYMP. OPER. SYST. PRINC. 5; AUSTIN; 1975; NEW YORK; ASSOC. FOR COMPUTING MACHINERY; DA. 1975; PP. 197-206; BIBL. 15 REF.Conference Paper

  • Page / 2