AAAAAA

   
Results: 1-16 |
Results: 16
EFFICIENT APPROXIMATION OF PRODUCT DISTRIBUTIONS
Authors: EVEN G GOLDREICH O LUBY M NISAN N VELICKOVIC B
Citation: G. Even et al., EFFICIENT APPROXIMATION OF PRODUCT DISTRIBUTIONS, Random structures & algorithms, 13(1), 1998, pp. 1-16
COMPUTATIONAL INDISTINGUISHABILITY - ALGORITHMS VS. CIRCUITS
Authors: GOLDREICH O MEYER B
Citation: O. Goldreich et B. Meyer, COMPUTATIONAL INDISTINGUISHABILITY - ALGORITHMS VS. CIRCUITS, Theoretical computer science, 191(1-2), 1998, pp. 215-218
COMPUTATIONAL-COMPLEXITY AND KNOWLEDGE COMPLEXITY
Authors: GOLDREICH O OSTROVSKY R PETRANK E
Citation: O. Goldreich et al., COMPUTATIONAL-COMPLEXITY AND KNOWLEDGE COMPLEXITY, SIAM journal on computing, 27(4), 1998, pp. 1116-1141
FREE BITS, PCPS, AND NONAPPROXIMABILITY - TOWARDS TIGHT RESULTS
Authors: BELLARE M GOLDREICH O SUDAN M
Citation: M. Bellare et al., FREE BITS, PCPS, AND NONAPPROXIMABILITY - TOWARDS TIGHT RESULTS, SIAM journal on computing, 27(3), 1998, pp. 804-915
FAULT-TOLERANT COMPUTATION IN THE FULL INFORMATION MODEL
Authors: GOLDREICH O GOLDWASSER S LINIAL N
Citation: O. Goldreich et al., FAULT-TOLERANT COMPUTATION IN THE FULL INFORMATION MODEL, SIAM journal on computing, 27(2), 1998, pp. 506-544
ON THE COMPLEXITY OF INTERACTIVE PROOFS WITH BOUNDED COMMUNICATION
Authors: GOLDREICH O HASTAD J
Citation: O. Goldreich et J. Hastad, ON THE COMPLEXITY OF INTERACTIVE PROOFS WITH BOUNDED COMMUNICATION, Information processing letters, 67(4), 1998, pp. 205-214
TINY FAMILIES OF FUNCTIONS WITH RANDOM PROPERTIES - A QUALITY-SIZE TRADE-OFF FOR HASHING
Authors: GOLDREICH O WIGDERSON A
Citation: O. Goldreich et A. Wigderson, TINY FAMILIES OF FUNCTIONS WITH RANDOM PROPERTIES - A QUALITY-SIZE TRADE-OFF FOR HASHING, Random structures & algorithms, 11(4), 1997, pp. 315-343
ON UNIVERSAL LEARNING ALGORITHMS
Authors: GOLDREICH O RON D
Citation: O. Goldreich et D. Ron, ON UNIVERSAL LEARNING ALGORITHMS, Information processing letters, 63(3), 1997, pp. 131-136
SOFTWARE PROTECTION AND SIMULATION ON OBLIVIOUS RAMS
Authors: GOLDREICH O OSTROVSKY R
Citation: O. Goldreich et R. Ostrovsky, SOFTWARE PROTECTION AND SIMULATION ON OBLIVIOUS RAMS, Journal of the ACM, 43(3), 1996, pp. 431-473
HOW TO CONSTRUCT CONSTANT-ROUND ZERO-KNOWLEDGE PROOF SYSTEMS FOR NP
Authors: GOLDREICH O KAHAN A
Citation: O. Goldreich et A. Kahan, HOW TO CONSTRUCT CONSTANT-ROUND ZERO-KNOWLEDGE PROOF SYSTEMS FOR NP, Journal of cryptology, 9(3), 1996, pp. 167-189
ON-LINE OFF-LINE DIGITAL-SIGNATURES
Authors: EVEN S GOLDREICH O MICALI S
Citation: S. Even et al., ON-LINE OFF-LINE DIGITAL-SIGNATURES, Journal of cryptology, 9(1), 1996, pp. 35-67
ON THE COMPOSITION OF ZERO-KNOWLEDGE PROOF SYSTEMS
Authors: GOLDREICH O KRAWCZYK H
Citation: O. Goldreich et H. Krawczyk, ON THE COMPOSITION OF ZERO-KNOWLEDGE PROOF SYSTEMS, SIAM journal on computing, 25(1), 1996, pp. 169-192
LOWER BOUNDS FOR SAMPLING ALGORITHMS FOR ESTIMATING THE AVERAGE
Authors: CANETTI R EVEN G GOLDREICH O
Citation: R. Canetti et al., LOWER BOUNDS FOR SAMPLING ALGORITHMS FOR ESTIMATING THE AVERAGE, Information processing letters, 53(1), 1995, pp. 17-25
DEFINITIONS AND PROPERTIES OF ZERO-KNOWLEDGE PROOF SYSTEMS
Authors: GOLDREICH O OREN Y
Citation: O. Goldreich et Y. Oren, DEFINITIONS AND PROPERTIES OF ZERO-KNOWLEDGE PROOF SYSTEMS, Journal of cryptology, 7(1), 1994, pp. 1-32
THE RANDOM ORACLE HYPOTHESIS IS FALSE
Authors: CHANG R CHOR B GOLDREICH O HARTMANIS J HASTAD J RANJAN D ROHATGI P
Citation: R. Chang et al., THE RANDOM ORACLE HYPOTHESIS IS FALSE, Journal of computer and system sciences, 49(1), 1994, pp. 24-39
ON THE EXISTENCE OF PSEUDORANDOM GENERATORS
Authors: GOLDREICH O KRAWCZYK H LUBY M
Citation: O. Goldreich et al., ON THE EXISTENCE OF PSEUDORANDOM GENERATORS, SIAM journal on computing, 22(6), 1993, pp. 1163-1175
Risultati: 1-16 |