( en | de | ru )

 

Disambiguation of "Goldreich, Oded"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithmic Aspects of Property Testing in the Dense Graphs Model.

, and . Electron. Colloquium Comput. Complex., (2008)

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 Löwenbein

Oded Friedmann

Oded Krebs

 

Other publications of authors with the same name

Testing Bipartiteness in the Dense-Graph Model., and . Encyclopedia of Algorithms, (2016)Improved Derandomization of BPP Using a Hitting Set Generator., and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 131-137. Springer, (1999)Pseudorandomness.. ICALP, volume 1853 of Lecture Notes in Computer Science, page 687-704. Springer, (2000)Another Motivation for Reducing the Randomness Complexity of Algorithms.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Average Case Complexity, Revisited.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)On Security Preserving Reductions - Revised Terminology.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Bravely, Moderately: A Common Theme in Four Recent Works.. Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits.. TCC, volume 4392 of Lecture Notes in Computer Science, page 174-193. Springer, (2007)More Constructions of Lossy and Correlation-Secure Trapdoor Functions., , , , and . IACR Cryptology ePrint Archive, (2009)Preface to "Week Three: Randomness in Computation".. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)