 | 2012 |
| 22 |  | Kai-Min Chung,
Henry Lam,
Zhenming Liu,
Michael Mitzenmacher:
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified.
STACS 2012: 124-135 |
| 21 |  | Kai-Min Chung,
Rafael Pass,
Wei-Lung Dustin Tseng:
The Knowledge Tightness of Parallel Zero-Knowledge.
TCC 2012: 512-529 |
| 2011 |
| 20 |  | Kai-Min Chung,
Yael Tauman Kalai,
Feng-Hao Liu,
Ran Raz:
Memory Delegation.
CRYPTO 2011: 151-168 |
| 19 |  | Ching-Hua Yu,
Sherman S. M. Chow,
Kai-Min Chung,
Feng-Hao Liu:
Efficient Secure Two-Party Exponentiation.
CT-RSA 2011: 17-32 |
| 18 |  | Kai-Min Chung,
Rafael Pass:
The Randomness Complexity of Parallel Repetition.
FOCS 2011: 658-667 |
| 17 |  | Kai-Min Chung,
Omer Reingold,
Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution.
ACM Transactions on Algorithms 7(3): 30 (2011) |
| 16 |  | Kai-Min Chung,
Yael Tauman Kalai,
Feng-Hao Liu,
Ran Raz:
Memory Delegation.
IACR Cryptology ePrint Archive 2011: 273 (2011) |
| 2010 |
| 15 |  | Kai-Min Chung,
Feng-Hao Liu,
Chi-Jen Lu,
Bo-Yin Yang:
Efficient String-Commitment from Weak Bit-Commitment.
ASIACRYPT 2010: 268-282 |
| 14 |  | Kai-Min Chung,
Yael Tauman Kalai,
Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption.
CRYPTO 2010: 483-501 |
| 13 |  | Vladimir Braverman,
Kai-Min Chung,
Zhenming Liu,
Michael Mitzenmacher,
Rafail Ostrovsky:
AMS Without 4-Wise Independence on Product Domains.
STACS 2010: 119-130 |
| 12 |  | Kai-Min Chung,
Feng-Hao Liu:
Parallel Repetition Theorems for Interactive Arguments.
TCC 2010: 19-36 |
| 11 |  | Kai-Min Chung,
Yael Tauman Kalai,
Salil P. Vadhan:
Improved Delegation of Computation using Fully Homomorphic Encryption.
IACR Cryptology ePrint Archive 2010: 241 (2010) |
| 2009 |
| 10 |  | Kai-Min Chung,
Feng-Hao Liu:
Tight Parallel Repetition Theorems for Public-coin Arguments.
Electronic Colloquium on Computational Complexity (ECCC) 16: 109 (2009) |
| 2008 |
| 9 |  | Kai-Min Chung,
Salil P. Vadhan:
Tight Bounds for Hashing Block Sources.
APPROX-RANDOM 2008: 357-370 |
| 8 |  | Kai-Min Chung,
Salil P. Vadhan:
Tight Bounds for Hashing Block Sources
CoRR abs/0806.1948: (2008) |
| 2007 |
| 7 |  | Kai-Min Chung,
Omer Reingold,
Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution.
IEEE Conference on Computational Complexity 2007: 236-249 |
| 6 |  | Kai-Min Chung,
Omer Reingold,
Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution.
Electronic Colloquium on Computational Complexity (ECCC) 14(030): (2007) |
| 2004 |
| 5 |  | Wei-Chun Kao,
Kai-Min Chung,
Chia-Liang Sun,
Chih-Jen Lin:
Decomposition Methods for Linear Support Vector Machines.
Neural Computation 16(8): 1689-1704 (2004) |
| 4 |  | Kai-Min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem.
SIAM J. Comput. 34(2): 373-387 (2004) |
| 2003 |
| 3 |  | Kai-Min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem.
ESA 2003: 136-147 |
| 2 |  | Kai-Min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem
CoRR cs.DS/0311020: (2003) |
| 1 |  | Kai-Min Chung,
Wei-Chun Kao,
Chia-Liang Sun,
Li-Lun Wang,
Chih-Jen Lin:
Radius Margin Bounds for Support Vector Machines with the RBF Kernel.
Neural Computation 15(11): 2643-2681 (2003) |