Chi-Jen Lu, Omer Reingold, Salil Vadhan, and Avi Wigderson. Extractors: optimal up to constant factors. To appear in Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), 2003.
Yan-Cheng Chang, Chun-Yun Hsiao, and Chi-Jen Lu. On the impossibilities of basing one-way permutations on central cryptographic primitives. Advances in Cryptology - ASIACRYPT 2002, pp. 110-124, 2002.
Chi-Jen Lu. Hyper-encryption against space-bounded adversaries from on-line strong extractors. Advances in Cryptology - CRYPTO 2002, pp. 257-271, 2002. Journal version to appear in Journal of Cryptology.
Chi-Jen Lu. Improved pseudorandom generators for combinatorial rectangles. Combinatorica, 22(3), pp. 417-434, 2002..
Chi-Jen Lu. Derandomizing Arthur-Merlin games under uniform assumptions. Computational Complexity, 10(3), pp. 247-259, 2001.
Yan-Cheng Chang and Chi-Jen Lu. Oblivious polynomial evaluation and oblivious neural learning. In Advances in Cryptology - ASIACRYPT 2001, pp. 369-384, 2001.
Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, and Tzu-Chin Lin. Efficient algorithms for two generalized 2-median problems on trees. In Proceedings of the 12th Annual International Symposium on Algorithms And Computation, pp. 768-778, 2001.
Tom Leighton, Chi-Jen Lu, Satish Rao, and Aravind Srinivasan. New algorithmic aspects of the Local Lemma with applications to routing and partitioning. SIAM Journal on Computing, 31(2), pp. 626-641, 2001. Conference version appeared as the following:
Chi-Jen Lu. A deterministic approximation algorithm for a minmax integer programming problem. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 663-668, 1999.
Chi-Jen Lu. An exact characterization of symmetric functions in qAC0. Theoretical Computer Science, 261(2), pp. 297-303, 2001.
David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, and Sven Skyum. On monotone plannar circuits. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp. 24-31, 1999.
Chi-Jen Lu. Deterministic hypergraph coloring and its applications. In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 35-46, 1998.
Dave Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, and Sven Skyum. Searching constant width mazes captures the AC0-hierarchy. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 73-83, 1998.
Last updated: 03/21/2003.