Oded Goldreich
Weizmann Institute of Science
H-index: 98
Asia-Israel
Top articles of Oded Goldreich
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Testing distributions of huge objects | TheoretiCS | Oded Goldreich Dana Ron | 2023/12/30 |
On the lower bound on the length of relaxed locally decodable codes | Electron. Colloquium Comput. Complex., TR23-064 | Oded Goldreich | 2023/5/3 |
A Lower Bound on the Complexity of Testing Grained Distributions | computational complexity | Oded Goldreich Dana Ron | 2023/12 |
On teaching the approximation method for circuit lower bounds | Electron. Colloquium Comput. Complex. | Oded Goldreich | 2023/3/15 |
On Testing Isomorphism to a Fixed Graph in the Bounded-Degree Graph Model | Oded Goldreich Laliv Tauber | 2023/9/28 | |
On interactive proofs of proximity with proof-oblivious queries | Oded Goldreich Guy N Rothblum Tal Skverer | 2023 | |
On coarse and fine approximate counting of t-cliques | Oded Goldreich | 2023/9/21 | |
On the complexity of enumerating ordered sets | Oded Goldreich | 2023/9/14 | |
On Testing Group Properties | Oded Goldreich Laliv Tauber | 2023/12/31 | |
Good permutation codes based on the shuffle-exchange network | Israel Journal of Mathematics | Oded Goldreich Avi Wigderson | 2023/9 |
Improved bounds on the AN-complexity of -linear functions | computational complexity | Oded Goldreich | 2022/12 |
Non-adaptive vs adaptive queries in the dense graph testing model | Oded Goldreich Avi Wigderson | 2022/2/7 | |
On properties that are non-trivial to test | Electronic Colloquium on Computational Complexity (ECCC) | Nader H Bshouty Oded Goldreich | 2022/2/5 |
Randomness extraction from somewhat dependent sources | Marshall Ball Oded Goldreich Tal Malkin | 2022 | |
Testing in the bounded-degree graph model with degree bound two | Electron. Colloquium Comput. Complex. | Oded Goldreich Laliv Tauber | 2022/12/28 |
Robustly self-ordered graphs: Constructions and applications to property testing | TheoretiCS | Oded Goldreich Avi Wigderson | 2022/12/21 |
On the locally testable code of Dinur et al.(2021) | Electron. Colloquium Comput. Complex | Oded Goldreich | 2021/12/7 |
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP | Theoretical computer science | Oded Goldreich Tom Gur | 2021/7/22 |
Open problems in property testing of graphs | Electronic Colloquium on Computational Complexity (ECCC) | Oded Goldreich | 2021/6/26 |
Robust self-ordering versus local self-ordering | ECCC, TR21-034 | Oded Goldreich | 2021/3/9 |
Co-Authors
