| 2009 |
|---|
| 38 | EE | Chi-Jen Lu:
On the Security Loss in Cryptographic Reductions.
EUROCRYPT 2009: 72-87 |
| 37 | EE | Chi-Yuan Chan,
Shan-Chyun Ku,
Chi-Jen Lu,
Biing-Feng Wang:
Efficient algorithms for two generalized 2-median problems and the group median problem on trees.
Theor. Comput. Sci. 410(8-10): 867-876 (2009) |
| 2008 |
|---|
| 36 | EE | Feng-Hao Liu,
Chi-Jen Lu,
Bo-Yin Yang:
Secure PRNGs from Specialized Polynomial Maps over Any .
PQCrypto 2008: 181-202 |
| 35 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Complexity of Hardness Amplification.
IEEE Transactions on Information Theory 54(10): 4575-4586 (2008) |
| 2007 |
|---|
| 34 | EE | Chun-Yuan Hsiao,
Chi-Jen Lu,
Leonid Reyzin:
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility.
EUROCRYPT 2007: 169-186 |
| 33 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
Impossibility Results on Weakly Black-Box Hardness Amplification.
FCT 2007: 400-411 |
| 32 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Complexity of Hard-Core Set Constructions.
ICALP 2007: 183-194 |
| 31 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
Improved hardness amplification in NP.
Theor. Comput. Sci. 370(1-3): 293-298 (2007) |
| 2006 |
|---|
| 30 | EE | Chia-Jung Lee,
Chi-Jen Lu,
Shi-Chun Tsai:
Deterministic Extractors for Independent-Symbol Sources.
ICALP (1) 2006: 84-95 |
| 29 | EE | Chi-Jen Lu:
On the Complexity of Parallel Hardness Amplification for One-Way Functions.
TCC 2006: 462-481 |
| 28 | EE | Yan-Cheng Chang,
Chun-Yuan Hsiao,
Chi-Jen Lu:
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives.
J. Cryptology 19(1): 97-114 (2006) |
| 27 | EE | Fu Chang,
Chin-Chin Lin,
Chi-Jen Lu:
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies.
Journal of Machine Learning Research 7: 2125-2148 (2006) |
| 2005 |
|---|
| 26 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Complexity of Hardness Amplification.
IEEE Conference on Computational Complexity 2005: 170-182 |
| 25 | EE | Chia-Jung Lee,
Chi-Jen Lu,
Shi-Chun Tsai,
Wen-Guey Tzeng:
Extracting randomness from multiple independent sources.
IEEE Transactions on Information Theory 51(6): 2224-2227 (2005) |
| 24 | EE | Yan-Cheng Chang,
Chi-Jen Lu:
Oblivious polynomial evaluation and oblivious neural learning.
Theor. Comput. Sci. 341(1-3): 39-54 (2005) |
| 2004 |
|---|
| 23 | EE | Fu Chang,
Chun-Jen Chen,
Chi-Jen Lu:
A linear-time component-labeling algorithm using contour tracing technique.
Computer Vision and Image Understanding 93(2): 206-220 (2004) |
| 22 | EE | Chi-Jen Lu:
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors.
J. Cryptology 17(1): 27-42 (2004) |
| 21 | EE | Chi-Jen Lu:
Deterministic Hypergraph Coloring and Its Applications.
SIAM J. Discrete Math. 18(2): 320-331 (2004) |
| 2003 |
|---|
| 20 | EE | Chi-Jen Lu,
Omer Reingold,
Salil P. Vadhan,
Avi Wigderson:
Extractors: optimal up to constant factors.
STOC 2003: 602-611 |
| 2002 |
|---|
| 19 | EE | Yan-Cheng Chang,
Chun-Yun Hsiao,
Chi-Jen Lu:
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives.
ASIACRYPT 2002: 110-124 |
| 18 | EE | Chi-Jen Lu:
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors.
CRYPTO 2002: 257-271 |
| 17 | EE | Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles.
Combinatorica 22(3): 417-434 (2002) |
| 2001 |
|---|
| 16 | EE | Yan-Cheng Chang,
Chi-Jen Lu:
Oblivious Polynomial Evaluation and Oblivious Neural Learning.
ASIACRYPT 2001: 369-384 |
| 15 | EE | Shan-Chyun Ku,
Chi-Jen Lu,
Biing-Feng Wang,
Tzu-Chin Lin:
Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
ISAAC 2001: 768-778 |
| 14 | EE | Chi-Jen Lu:
Derandomizing Arthur-Merlin games under uniform assumptions.
Computational Complexity 10(3): 247-259 (2001) |
| 13 | EE | Frank Thomson Leighton,
Chi-Jen Lu,
Satish Rao,
Aravind Srinivasan:
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SIAM J. Comput. 31(2): 626-641 (2001) |
| 12 | EE | Chi-Jen Lu,
Shi-Chun Tsai:
A Note on Iterating an alpha-ary Gray Code.
SIAM J. Discrete Math. 14(2): 237-239 (2001) |
| 11 | EE | Chi-Jen Lu:
An exact characterization of symmetric functions in qAC0[2].
Theor. Comput. Sci. 261(2): 297-303 (2001) |
| 2000 |
|---|
| 10 | EE | Chi-Jen Lu:
Derandomizing Arthur-Merlin Games under Uniform Assumptions.
ISAAC 2000: 302-312 |
| 1999 |
|---|
| 9 | EE | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
On Monotone Planar Circuits.
IEEE Conference on Computational Complexity 1999: 24- |
| 8 | EE | Chi-Jen Lu:
A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem.
SODA 1999: 663-668 |
| 1998 |
|---|
| 7 | EE | Chi-Jen Lu:
An Exact Characterization of Symmetric Functions in qAC0[2].
COCOON 1998: 167-173 |
| 6 | EE | Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles.
ICALP 1998: 223-234 |
| 5 | EE | Chi-Jen Lu:
Deterministic Hypergraph Coloring and Its Applications.
RANDOM 1998: 35-46 |
| 4 | | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
Searching Constant Width Mazes Captures the AC0 Hierarchy.
STACS 1998: 73-83 |
| 1997 |
|---|
| 3 | EE | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
Searching constant width mazes captures the AC0 hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 4(44): (1997) |
| 1992 |
|---|
| 2 | EE | Gen-Huey Chen,
Biing-Feng Wang,
Chi-Jen Lu:
On the Parallel Computation of the Algebraic Path Problem.
IEEE Trans. Parallel Distrib. Syst. 3(2): 251-256 (1992) |
| 1990 |
|---|
| 1 | | Biing-Feng Wang,
Chi-Jen Lu,
Gen-Huey Chen:
Constant Time Algorithms for the Transitive Closure Problem and Its Applications.
ICPP (3) 1990: 52-59 |
