Chin Ho Lee

According to our database1, Chin Ho Lee authored at least 24 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Pseudorandomness, symmetry, smoothing: II.
CoRR, 2024

Boosting Uniformity in Quasirandom Groups: Fast and Simple.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Pseudorandomness, Symmetry, Smoothing: I.
Proceedings of the 39th Computational Complexity Conference, 2024

Trace Reconstruction from Local Statistical Queries.
Proceedings of the Approximation, 2024

2023
On the Power of Regular and Permutation Branching Programs.
Electron. Colloquium Comput. Complex., 2023

Approximate Trace Reconstruction from a Single Trace.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Fourier Growth of Regular Branching Programs.
Electron. Colloquium Comput. Complex., 2022

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Fourier growth of structured 𝔽<sub>2</sub>-polynomials and applications.
Electron. Colloquium Comput. Complex., 2021

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications.
CoRR, 2021

Polynomial-time trace reconstruction in the smoothed complexity model.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Fractional Pseudorandom Generators from Any Fourier Level.
Proceedings of the 36th Computational Complexity Conference, 2021

2019
Bounded Independence versus Symmetric Tests.
ACM Trans. Comput. Theory, 2019

Fourier bounds and pseudorandom generators for product tests.
Electron. Colloquium Comput. Complex., 2019

2018
Bounded Independence Plus Noise Fools Products.
SIAM J. Comput., 2018

2017
More on bounded independence plus noise: Pseudorandom generators for read-once polynomials.
Electron. Colloquium Comput. Complex., 2017

The coin problem for product tests.
Electron. Colloquium Comput. Complex., 2017

2016
Bounded independence vs. moduli.
Electron. Colloquium Comput. Complex., 2016

2015
Homomorphic evaluation requires depth.
IACR Cryptol. ePrint Arch., 2015

Some limitations of the sum of small-bias distributions.
Electron. Colloquium Comput. Complex., 2015

2012
On the depth complexity of homomorphic encryption schemes.
Electron. Colloquium Comput. Complex., 2012

Limits of provable security for homomorphic encryption.
Electron. Colloquium Comput. Complex., 2012

2011
Homomorphic encryption from codes.
IACR Cryptol. ePrint Arch., 2011


  Loading...