ON THE COMPLEXITY OF THE THEORIES OF WEAK DIRECT POWERS.RACKOFF C.1976; J. SYMBOLIC LOGIC; U.S.A.; DA. 1976; VOL. 41; NO 3; PP. 561-573; BIBL. 18 REF.Article

THE COMPLEXITY OF THEORIES OF THE MONADIC PREDICATE CALCULUS.RACKOFF C.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 136; PP. 1-11; ABS. FR.; BIBL. 6 REF.Serial Issue

A DECISION PROCEDURE FOR THE FIRST ORDER THEORY OF REAL ADDITION WITH ORDER.FERRANTE J; RACKOFF C.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 1; PP. 69-76; BIBL. 5 REF.Article

A study of password securityLUBY, M; RACKOFF, C.Journal of cryptology. 1989, Vol 1, Num 3, pp 151-158, issn 0933-2790, 8 p.Article

CBC MAC for real-time data sourcesPETRANK, E; RACKOFF, C.Journal of cryptology. 2000, Vol 13, Num 3, pp 315-338, issn 0933-2790Article

RANDOM WALKS, UNIVERSAL TRAVERSAL SEQUENCES, AND THE COMPLEXITY OF MAZE PROBLEMSALELIUNAS R; KARP RM; LIPTON RJ et al.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. 218-223; BIBL. 6 REF.Conference Paper

The knowledge complexity of interactive proof systemsGOLDWASSER, S; MICALI, S; RACKOFF, C et al.SIAM journal on computing (Print). 1989, Vol 18, Num 1, pp 186-208, issn 0097-5397Article

Fast parallel computation of polynomials using few processorsVALIANT, L. G; SKYUM, S; BERKOWITZ, S et al.SIAM journal on computing (Print). 1983, Vol 12, Num 4, pp 641-644, issn 0097-5397Article

A secure protocol for the oblivious transfer (extended abstract)FISCHER, M. J; MICALI, S; RACKOFF, C et al.Journal of cryptology. 1996, Vol 9, Num 3, pp 191-195, issn 0933-2790Article