Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Jyun-Jie Liao
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Improved Exponent for Marton's Conjecture in $\mathbb{F}_2^n$
2024
Jyun-Jie Liao
+
Recursive Error Reduction for Regular Branching Programs
2023
Eshan Chattopadhyay
Jyun-Jie Liao
+
PDF
Chat
Extractors for sum of two sources
2022
Eshan Chattopadhyay
Jyun-Jie Liao
+
Affine Extractors for Almost Logarithmic Entropy.
2021
Eshan Chattopadhyay
Jesse Goodman
Jyun-Jie Liao
+
Extractors for Sum of Two Sources
2021
Eshan Chattopadhyay
Jyun-Jie Liao
+
Optimal Error Pseudodistributions for Read-Once Branching Programs
2020
Eshan Chattopadhyay
Jyun-Jie Liao
+
On Integer Solution of the Diophantine Equation x~3+1 = Dy~2
2014
Jyun-Jie Liao
+
DISJOINT BOOLEAN ALGEBRA AND ITS APPLICATION
1984
Jyun-Jie Liao
Common Coauthors
Coauthor
Papers Together
Eshan Chattopadhyay
5
Jesse Goodman
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Randomness is Linear in Space
1996
Noam Nisan
David Zuckerman
2
+
Randomization and derandomization in space-bounded computation
2002
Michael Saks
1
+
PDF
Chat
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008
Yevgeniy Dodis
Rafail Ostrovsky
Leonid Reyzin
Adam Smith
1
+
PDF
Chat
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2013
Zeev Dvir
Swastik Kopparty
Shubhangi Saraf
Madhu Sudan
1
+
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
2017
William M. Hoza
Chris Umans
1
+
Towards optimal two-source extractors and Ramsey graphs
2017
Gil Cohen
1
+
PDF
Chat
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols
2016
Eshan Chattopadhyay
Xin Li
1
+
Improved non-malleable extractors, non-malleable codes and independent source extractors
2017
Xin Li
1
+
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
2019
Avraham Ben-Aroya
Dean Doron
Amnon Ta‐Shma
1
+
PDF
Chat
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions
2020
Eshan Chattopadhyay
Vipul Goyal
Xin Li
1
+
Randomness-optimal oblivious sampling
1997
ZuckermanDavid
1
+
PDF
Chat
Improved Extractors for Small-Space Sources
2022
Eshan Chattopadhyay
Jesse Goodman
1
+
Revisiting Norm Estimation in Data Streams
2008
Daniel M. Kane
Jelani Nelson
David P. Woodruff
1
+
Explicit Resilient Functions Matching Ajtai-Linial
2017
Raghu Meka
1