( en | de | ru )

 

Disambiguation of "Goldreich, Oded"

Author of the publication

copydeleteadd this publication to your clipboard
On the possibilities and limitations of pseudodeterministic algorithms.

, , and . ITCS, page 127-138. ACM, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oded Green

Oded Maron

Oded Friedmann

Oded Löwenbein

Oded Winter

 

Other publications of authors with the same name

On the Randomness Complexity of Property Testing., and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 509-524. Springer, (2007)Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval., , , and . CCC, page 175-183. IEEE Computer Society, (2002)Deterministic Amplification of Space-Bounded Probabilistic Algorithms., , and . CCC, page 188-. IEEE Computer Society, (1999)A theory of goal-oriented communication., , and . PODC, page 299-300. ACM, (2011)Every Set in P Is Strongly Testable Under a Suitable Encoding., , and . ITCS, volume 124 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Bit Extraction Problem of t-Resilient Functions (Preliminary Version), , , , , and . FOCS, page 396-407. IEEE Computer Society, (1985)Fault-tolerant Computation in the Full Information Model (Extended Abstract), , and . FOCS, page 447-457. IEEE Computer Society, (1991)Three theorems regarding testing graph properties, and . Random Struct. Algorithms, 23 (1): 23-57 (2003)On Pseudorandomness with respect to Deterministic Observes., and . ICALP Satellite Workshops, page 77-84. Carleton Scientific, Waterloo, Ontario, Canada, (2000)On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators., and . J. Cryptol., 16 (2): 71-93 (2003)