Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Chin Ho Lee
Observed name:
Lee, Chin Ho
Institutions:
North Carolina State University,
Cornell University,
The Ohio State University
Observed institutions:
Northeastern University,
Harvard University,
North Carolina State University,
Chinese University of Hong Kong,
Cornell University,
The Ohio State University,
Columbia University,
University of Pennsylvania
show all 8
ORCID:
0000-0001-5072-8110
Observed ORCID:
0000-0001-5072-8110
OpenAlex ID:
A5016270337
Polynomial-time trace reconstruction in the smoothed complexity model
2021
·
Xi Chen
, Anindya De
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
20
Homomorphic encryption from codes
2011
·
Bogdanov, Andrej
, Lee, Chin Ho
·
arXiv (Cornell University)
·
20
PDF
Limits of Provable Security for Homomorphic Encryption
2013
·
Andrej Bogdanov
, Chin Ho Lee
·
Lecture notes in computer science
·
19
Bounded Independence Plus Noise Fools Products
2018
·
Elad Haramaty
, Chin Ho Lee
, et al.
·
SIAM Journal on Computing
·
15
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
2022
·
Xi Chen
, Anindya De
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
10
PDF
Fourier Bounds and Pseudorandom Generators for Product Tests
2019
·
Lee, Chin Ho
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
The Coin Problem for Product Tests
2018
·
Chin Ho Lee
, Emanuele Viola
·
ACM Transactions on Computation Theory
·
10
PDF
More on bounded independence plus noise: Pseudorandom generators for read-once polynomials.
2017
·
Chin Ho Lee
, Emanuele Viola
·
10
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime
2021
·
Chen, Xi
, De, Anindya
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
Untitled
2017
·
Chin Ho Lee
, Emanuele Viola
·
Theory of Computing
·
6
PDF
Bounded independence plus noise fools products
2017
·
Elad Haramaty
, Chin Ho Lee
, et al.
·
5
Homomorphic Evaluation Requires Depth
2015
·
Andrej Bogdanov
, Chin Ho Lee
·
Lecture notes in computer science
·
4
Some limitations of the sum of small-bias distributions.
2015
·
Chin Ho Lee
, Emanuele Viola
·
Electronic colloquium on computational complexity
·
4
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model
2022
·
Xi Chen
, Anindya De
, et al.
·
ACM Transactions on Algorithms
·
3
PDF
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime
2020
·
Chen, Xi
, De, Anindya
, et al.
·
arXiv (Cornell University)
·
3
PDF
Untitled
2020
·
Chin Ho Lee
, Emanuele Viola
·
Theory of Computing
·
3
PDF
Bounded Independence versus Symmetric Tests
2019
·
Ravi Boppana
, Johan Håstad
, et al.
·
ACM Transactions on Computation Theory
·
3
PDF
Approximate Trace Reconstruction from a Single Trace
2023
·
Xi Chen
, Anindya De
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
2
PDF
Fractional Pseudorandom Generators from Any Fourier Level
2021
·
Chattopadhyay, Eshan
, Gaitonde, Jason
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Polynomial-time trace reconstruction in the smoothed complexity model
2020
·
Chen, Xi
, De, Anindya
, et al.
·
arXiv (Cornell University)
·
2
PDF
Fourier Conjectures, Correlation Bounds, and Majority
2020
·
Chattopadhyay, Eshan
, Gaitonde, Jason
, et al.
·
arXiv (Cornell University)
·
2
PDF
Bounded Independence vs. Moduli
2016
·
Boppana, Ravi
, Håstad, Johan
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Fourier bounds and pseudorandom generators for product tests
2019
·
Lee, Chin Ho
·
arXiv (Cornell University)
·
1
PDF
On the depth complexity of homomorphic encryption schemes.
2012
·
Andrej Bogdanov
, Chin Ho Lee
·
Electronic colloquium on computational complexity
·
1
Exponential Correlation Bounds for Polynomials
2026
·
Chattopadhyay, Eshan
, Hatami, Pooya
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
38
Citation count:
156
H-index:
7
I10-index:
6
Year
Topic
Type
