Justin Oh

According to our database, Justin Oh authored at least 7 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Pseudorandomness Beating the Hybrid Argument for Insensitive Algorithms.

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Electron. Colloquium Comput. Complex., 2026

Extractors for Samplable Distributions from the Two-Source Extractor Recipe.

Justin Oh, Ronen Shaltiel

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Online Condensing of Unpredictable Sources via Random Walks.

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate.

Geoffrey Mon, Dana Moshkovitz, Justin Oh

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Almost Chor-Goldreich Sources and Adversarial Random Walks.

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2020

Randomness Efficient Noise Stability and Generalized Small Bias Sets.

Dana Moshkovitz, Justin Oh, David Zuckerman

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Nearly Optimal Pseudorandomness From Hardness.

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020