AAAAAA
Results:
1-15
|
Results: 15
Authors:
Goldreich, O
Ron, D
Citation: O. Goldreich et D. Ron, Property testing in bounded degree graphs, ALGORITHMIC, 32(2), 2002, pp. 302-343
Authors:
Goldreich, O
Citation: O. Goldreich, General secure multiparty computation - Preface, J CRYPTOL, 13(1), 2000, pp. 1-7
Authors:
Bellare, M
Goldreich, O
Petrank, E
Citation: M. Bellare et al., Uniform generation of NP-witnesses using an NP-oracle, INF COMPUT, 163(2), 2000, pp. 510-526
Authors:
Goldreich, O
Goldwasser, S
Lehman, E
Ron, D
Samorodnitsky, A
Citation: O. Goldreich et al., Testing monotonicity, COMBINATORI, 20(3), 2000, pp. 301-337
Authors:
Goldreich, O
Safra, S
Citation: O. Goldreich et S. Safra, A combinatorial consistency lemma with application to proving the PCP theorem, SIAM J COMP, 29(4), 2000, pp. 1132-1154
Authors:
Decatur, SE
Goldreich, O
Ron, D
Citation: Se. Decatur et al., Computational sample complexity, SIAM J COMP, 29(3), 2000, pp. 854-879
Authors:
Goldreich, O
Goldwasser, S
Citation: O. Goldreich et S. Goldwasser, On the limits of nonapproximability of lattice problems, J COMPUT SY, 60(3), 2000, pp. 540-563
Authors:
Goldreich, O
Ron, D
Sudan, M
Citation: O. Goldreich et al., Chinese remaindering with errors, IEEE INFO T, 46(4), 2000, pp. 1330-1338
Authors:
Goldreich, O
Petrank, E
Citation: O. Goldreich et E. Petrank, Quantifying knowledge complexity, COMP COMPLE, 8(1), 1999, pp. 50-98
Authors:
Goldreich, O
Ron, D
Citation: O. Goldreich et D. Ron, A sublinear bipartiteness tester for bounded degree graphs, COMBINATORI, 19(3), 1999, pp. 335-373
Authors:
Goldreich, O
Sudan, M
Citation: O. Goldreich et M. Sudan, Computational indistinguishability: A sample hierarchy, J COMPUT SY, 59(2), 1999, pp. 253-269
Authors:
Goldreich, O
Micciancio, D
Safra, S
Seifert, JP
Citation: O. Goldreich et al., Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, INF PROCESS, 71(2), 1999, pp. 55-61
Authors:
De Santis, A
De Crescenzo, G
Goldreich, O
Persiano, G
Citation: A. De Santis et al., The graph clustering problem has a perfect zero-knowledge interactive proof, INF PROCESS, 69(4), 1999, pp. 201-206
Authors:
Chor, B
Goldreich, O
Kushilevitz, E
Sudan, M
Citation: B. Chor et al., Private information retrieval, J ACM, 45(6), 1998, pp. 965-982
Authors:
Goldreich, O
Goldwasser, S
Ron, D
Citation: O. Goldreich et al., Property testing and its connection to learning and approximation, J ACM, 45(4), 1998, pp. 653-750
Risultati:
1-15
|