Oded Goldreich 0001 - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 99 from 99

2025

Doubly Sub-Linear Interactive Proofs of ProximityNoga Amir, Oded Goldreich 0001, Guy N. Rothblum. innovations 2025: [doi]

2024

2023

On Interactive Proofs of Proximity with Proof-Oblivious QueriesOded Goldreich 0001, Guy N. Rothblum, Tal Skverer. innovations 2023: [doi]

Testing Distributions of Huge ObjectsOded Goldreich 0001, Dana Ron. theoretics, 2, 2023. [doi]

On Testing Isomorphism to a Fixed Graph in the Bounded-Degree Graph ModelOded Goldreich 0001, Laliv Tauber. eccc, TR23, 2023. [doi]

On the complexity of enumerating ordered setsOded Goldreich 0001. eccc, TR23, 2023. [doi]

On the Lower Bound on the Length of Relaxed Locally Decodable CodesOded Goldreich 0001. eccc, TR23, 2023. [doi]

On Testing Group PropertiesOded Goldreich 0001, Laliv Tauber. eccc, TR23, 2023. [doi]

A Lower Bound on the Complexity of Testing Grained DistributionsOded Goldreich 0001, Dana Ron. cc, 32(2):11, December 2023. [doi]

On teaching the approximation method for circuit lower boundsOded Goldreich 0001. eccc, TR23, 2023. [doi]

t-cliquesOded Goldreich 0001. eccc, TR23, 2023. [doi]

2022

Testing Distributions of Huge ObjectsOded Goldreich 0001, Dana Ron. innovations 2022: [doi]

Improved bounds on the AN-complexity of O(1)-linear functionsOded Goldreich 0001. cc, 31(2):7, 2022. [doi]

On Interactive Proofs of Proximity with Proof-Oblivious QueriesOded Goldreich 0001, Guy N. Rothblum, Tal Skverer. eccc, TR22, 2022. [doi]

Testing in the bounded-degree graph model with degree bound twoOded Goldreich 0001, Laliv Tauber. eccc, TR22, 2022. [doi]

Robustly Self-Ordered Graphs: Constructions and Applications to Property TestingOded Goldreich 0001, Avi Wigderson. theoretics, 1, 2022. [doi]

Randomness Extraction from Somewhat Dependent SourcesMarshall Ball, Oded Goldreich 0001, Tal Malkin. innovations 2022: [doi]

On properties that are non-trivial to testNader H. Bshouty, Oded Goldreich 0001. eccc, 29:13, 2022. [doi]

2021

Non-adaptive vs Adaptive Queries in the Dense Graph Testing ModelOded Goldreich 0001, Avi Wigderson. focs 2022: 269-275 [doi]

Robustly Self-Ordered Graphs: Constructions and Applications to Property TestingOded Goldreich 0001, Avi Wigderson. coco 2021: [doi]

A Lower Bound on the Complexity of Testing Grained DistributionsOded Goldreich 0001, Dana Ron. eccc, 28:129, 2021. [doi]

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSPOded Goldreich 0001, Tom Gur. TCS, 878-879:83-101, 2021. [doi]

On the Locally Testable Code of Dinur et al. (2021)Oded Goldreich 0001. eccc, 28:175, 2021. [doi]

Open Problems in Property Testing of GraphsOded Goldreich 0001. eccc, 28:88, 2021. [doi]

Testing Distributions of Huge ObjectsOded Goldreich 0001, Dana Ron. eccc, 28:133, 2021. [doi]

Robust Self-Ordering versus Local Self-OrderingOded Goldreich 0001. eccc, 28:34, 2021. [doi]

The KW Games as a TeaserOded Goldreich 0001. eccc, 28:181, 2021. [doi]

Communication Complexity with Defective RandomnessMarshall Ball, Oded Goldreich 0001, Tal Malkin. coco 2021: [doi]

2020

One-Sided Error Testing of Monomials and Affine SubspacesOded Goldreich 0001, Dana Ron. eccc, 27:68, 2020. [doi]

On Testing Asymmetry in the Bounded Degree Graph ModelOded Goldreich 0001. eccc, 27:118, 2020. [doi]

Robustly Self-Ordered Graphs: Constructions and Applications to Property TestingOded Goldreich 0001, Avi Wigderson. eccc, 27:149, 2020. [doi]

The Subgraph Testing ModelOded Goldreich 0001, Dana Ron. toct, 12(4), 2020. [doi]

Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange NetworkOded Goldreich 0001, Avi Wigderson. eccc, 27:192, 2020. [doi]

On Testing Hamiltonicity in the Bounded Degree Graph ModelOded Goldreich 0001. eccc, 27:109, 2020. [doi]

Non-adaptive vs Adaptive Queries in the Dense Graph Testing ModelOded Goldreich 0001, Avi Wigderson. eccc, 27:160, 2020. [doi]

On Counting $t$-Cliques Mod 2Oded Goldreich 0001. eccc, 27:104, 2020. [doi]

On the Effect of the Proximity Parameter on Property TestersOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 36-40, Springer, 2020. [doi]

Flexible Models for Testing Graph PropertiesOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 352-362, Springer, 2020. [doi]

Reducing Testing Affine Spaces to Testing Linearity of FunctionsOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 199-219, Springer, 2020. [doi]

On Emulating Interactive Proofs with Public CoinsOded Goldreich 0001, Maya Leshkowitz. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 178-198, Springer, 2020. [doi]

Worst-Case to Average-Case Reductions for Subclasses of POded Goldreich 0001, Guy N. Rothblum. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 249-295, Springer, 2020. [doi]

Two Comments on Targeted Canonical DerandomizersOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 24-35, Springer, 2020. [doi]

Deconstructing 1-Local ExpandersOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 220-248, Springer, 2020. [doi]

Bridging a Small Gap in the Gap Amplification of Assignment TestersOded Goldreich 0001, Or Meir. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 9-16, Springer, 2020. [doi]

On the Optimal Analysis of the Collision Probability Tester (an Exposition)Oded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 296-305, Springer, 2020. [doi]

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property TestingOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 87-118, Springer, 2020. [doi]

The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed DistributionOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 152-172, Springer, 2020. [doi]

On (Valiant's) Polynomial-Size Monotone Formula for MajorityOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 17-23, Springer, 2020. [doi]

On Constructing Expanders for Any Number of VerticesOded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 374-379, Springer, 2020. [doi]

On Constant-Depth Canonical Boolean Circuits for Computing Multilinear FunctionsOded Goldreich 0001, Avishay Tal. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 306-325, Springer, 2020. [doi]

Constant-Round Interactive Proof Systems for AC0[2] and NC1Oded Goldreich 0001, Guy N. Rothblum. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 326-351, Springer, 2020. [doi]

On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition)Oded Goldreich 0001, Dana Ron. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 141-151, Springer, 2020. [doi]

On the Size of Depth-Three Boolean Circuits for Computing Multilinear FunctionsOded Goldreich 0001, Avi Wigderson. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 41-86, Springer, 2020. [doi]

Super-Perfect Zero-Knowledge ProofsOded Goldreich 0001, Liav Teichner. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 119-140, Springer, 2020. [doi]

Communication Complexity with Defective RandomnessMarshall Ball, Oded Goldreich 0001, Tal Malkin. eccc, 27:54, 2020. [doi]

Pseudo-mixing Time of Random WalksItai Benjamini, Oded Goldreich 0001. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 363-373, Springer, 2020. [doi]

A Probabilistic Error-Correcting Scheme that Provides Partial SecrecyScott E. Decatur, Oded Goldreich 0001, Dana Ron. In Oded Goldreich 0001, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Volume 12050 of Lecture Notes in Computer Science, pages 1-8, Springer, 2020. [doi]

2019

The Subgraph Testing ModelOded Goldreich 0001, Dana Ron. innovations 2018: [doi]

Improved bounds on the AN-complexity of multilinear functionsOded Goldreich 0001. eccc, 26:171, 2019. [doi]

Testing Isomorphism in the Bounded-Degree Graph ModelOded Goldreich 0001. eccc, 26:102, 2019. [doi]

Multi-pseudodeterministic algorithmsOded Goldreich 0001. eccc, 26:12, 2019. [doi]

Strong Locally Testable Codes with Relaxed Local DecodersOded Goldreich 0001, Tom Gur, Ilan Komargodski. toct, 11(3), 2019. [doi]

On the Complexity of Estimating the Effective Support SizeOded Goldreich 0001. eccc, 26:88, 2019. [doi]

Hierarchy Theorems for Testing Properties in Size-Oblivious Query ComplexityOded Goldreich 0001. cc, 28(4):709-747, 2019. [doi]

On some noncryptographic works of Goldwasser and MicaliOded Goldreich 0001. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 527-542, ACM, 2019. [doi]

On the impact of cryptography on complexity theoryOded Goldreich 0001. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 497-526, ACM, 2019. [doi]

How to construct random functionsOded Goldreich 0001, Shafi Goldwasser, Silvio Micali. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 241-264, ACM, 2019. [doi]

How to play any mental game, or a completeness theorem for protocols with honest majorityOded Goldreich 0001, Silvio Micali, Avi Wigderson. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 307-328, ACM, 2019. [doi]

Proofs that yield nothing but their validity and a methodology of cryptographic protocol designOded Goldreich 0001, Silvio Micali, Avi Wigderson. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 285-306, ACM, 2019. [doi]

PrefaceOded Goldreich 0001. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. ACM, 2019. [doi]

On the foundations of cryptographyOded Goldreich 0001. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 411-496, ACM, 2019. [doi]

Randomness Extraction from Somewhat Dependent SourcesMarshall Ball, Oded Goldreich 0001, Tal Malkin. eccc, 26:183, 2019. [doi]

Pseudo-Mixing Time of Random WalksItai Benjamini, Oded Goldreich 0001. eccc, 26:78, 2019. [doi]

Every Set in P Is Strongly Testable Under a Suitable EncodingIrit Dinur, Oded Goldreich 0001, Tom Gur. innovations 2018: [doi]

2018

Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable SetsOded Goldreich 0001, Guy N. Rothblum. innovations 2018: [doi]

Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof SystemsOded Goldreich 0001, Guy N. Rothblum. focs 2018: 77-88 [doi]

On Doubly-Efficient Interactive Proof SystemsOded Goldreich 0001. fttcs, 13(3):158-246, 2018. [doi]

Universal Locally Testable CodesOded Goldreich 0001, Tom Gur. cjtcs, 2018, 2018. [doi]

Testing Graphs in Vertex-Distribution-Free ModelsOded Goldreich 0001. eccc, 25:171, 2018. [doi]

Matrix rigidity of random Toeplitz matricesOded Goldreich 0001, Avishay Tal. cc, 27(2):305-350, 2018. [doi]

Proofs of proximity for context-free languages and read-once branching programsOded Goldreich 0001, Tom Gur, Ron D. Rothblum. iandc, 261(Part):175-201, 2018. [doi]

Hierarchy Theorems for Testing Properties in Size-Oblivious Query ComplexityOded Goldreich 0001. eccc, 25:98, 2018. [doi]

The Subgraph Testing ModelOded Goldreich 0001, Dana Ron. eccc, 25:45, 2018. [doi]

Counting $t$-cliques: Worst-case to average-case reductions and Direct interactive proof systemsOded Goldreich 0001, Guy N. Rothblum. eccc, 25:46, 2018. [doi]

Constant-round interactive proof systems for AC0[2] and NC1Oded Goldreich 0001, Guy N. Rothblum. eccc, 25:69, 2018. [doi]

Flexible models for testing graph propertiesOded Goldreich 0001. eccc, 25:104, 2018. [doi]

Every set in P is strongly testable under a suitable encodingIrit Dinur, Oded Goldreich 0001, Tom Gur. eccc, 25:50, 2018. [doi]

2017

On Constant-Depth Canonical Boolean Circuits for Computing Multilinear FunctionsOded Goldreich 0001, Avishay Tal. eccc, 24:193, 2017. [doi]

Introduction to Property TestingOded Goldreich 0001. Cambridge University Press, 2017.

2004

Pseudorandomness - Part IOded Goldreich 0001. In Steven Rudich, Avi Wigderson, editors, Computational Complexity Theory. Volume 10 of IAS / Park City mathematics series, pages 253-285, AMS Chelsea Publishing, 2004. [doi]

Preface to "Week Three: Randomness in Computation"Oded Goldreich 0001. In Steven Rudich, Avi Wigderson, editors, Computational Complexity Theory. Volume 10 of IAS / Park City mathematics series, pages 249-251, AMS Chelsea Publishing, 2004. [doi]

1993

A taxonomy of proof systems (part 1)Oded Goldreich 0001. sigact, 24(4):2-13, 1993. [doi]

1992

Critique of some trends in the TCS community in light of two controversiesOded Goldreich 0001. sigact, 23(1):44-46, 1992. [doi]

See Also

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

Filter by Venue
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Oded Goldreich 0001'

Viewing Publication 1 - 99 from 99

2025

2024

2023

2022

2021

2020

2019

2018

2017

2004

1993

1992

See Also

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag

Filter by VenueOR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Oded Goldreich 0001'

Viewing Publication 1 - 99 from 99

2025

2024

2023

2022

2021

2020

2019

2018

2017

2004

1993

1992

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Venue
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1