Chi-Jen Lu

Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, Shenghuo Zhu: Online Optimization with Gradual Variations. Journal of Machine Learning Research - Proceedings Track 23: 6.1-6.20 (2012)

Chi-Jen Lu: Hitting Set Generators for Sparse Polynomials over Any Finite Fields. IEEE Conference on Computational Complexity 2012: 280-286

Jen-Hou Chou, Chi-Jen Lu, Mu-En Wu: Making Profit in a Prediction Market. COCOON 2012: 556-567

Shang-Tse Chen, Hsuan-Tien Lin, Chi-Jen Lu: An Online Boosting Algorithm with Theoretical Justifications. ICML 2012

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu: Complexity of Hard-Core Set Proofs. Computational Complexity 20(1): 145-171 (2011)

Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai: Extracting Computational Entropy and Learning Noisy Linear Functions. IEEE Transactions on Information Theory 57(8): 5485-5496 (2011)

Chi-Jen Lu, Wei-Fu Lu: Making Online Decisions with Bounded Memory. ALT 2011: 249-261

Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai: Computational Randomness from Generalized Hardcore Sets. FCT 2011: 78-89

Chi-Jen Lu, Hsin-Lung Wu: On the Hardness against Constant-Depth Linear-Size Circuits. Discrete Math., Alg. and Appl. 2(4): 515-526 (2010)

Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen Lu: Tree Decomposition for Large-Scale SVM Problems. Journal of Machine Learning Research 11: 2935-2972 (2010)

Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai: Deterministic Extractors for Independent-Symbol Sources. IEEE Transactions on Information Theory 56(12): 6501-6512 (2010)

Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang: Efficient String-Commitment from Weak Bit-Commitment. ASIACRYPT 2010: 268-282

Jen-Hou Chou, Chi-Jen Lu: Communication Requirements for Stable Marriages. CIAC 2010: 371-382

Chi-Jen Lu, Hsin-Lung Wu: On the Hardness against Constant-Depth Linear-Size Circuits. COCOON 2010: 13-22

Chao-Kai Chiang, Chi-Jen Lu: Online Learning with Queries. SODA 2010: 616-629

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)

Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai: Extracting Computational Entropy and Learning Noisy Linear Functions. COCOON 2009: 338-347

Chi-Jen Lu: On the Security Loss in Cryptographic Reductions. EUROCRYPT 2009: 72-87

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)

Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang: Secure PRNGs from Specialized Polynomial Maps over Any . PQCrypto 2008: 181-202

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu: Improved hardness amplification in NP. Theor. Comput. Sci. 370(1-3): 293-298 (2007)

Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. EUROCRYPT 2007: 169-186

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu: Impossibility Results on Weakly Black-Box Hardness Amplification. FCT 2007: 400-411

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu: On the Complexity of Hard-Core Set Constructions. ICALP 2007: 183-194

Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang, Jintai Ding: Secure PRNGs from Specialized Polynomial Maps over Any F_q. IACR Cryptology ePrint Archive 2007: 405 (2007)

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)

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)

Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai: Deterministic Extractors for Independent-Symbol Sources. ICALP (1) 2006: 84-95

Chi-Jen Lu: On the Complexity of Parallel Hardness Amplification for One-Way Functions. TCC 2006: 462-481

Yan-Cheng Chang, Chi-Jen Lu: Oblivious polynomial evaluation and oblivious neural learning. Theor. Comput. Sci. 341(1-3): 39-54 (2005)

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)

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu: On the Complexity of Hardness Amplification. IEEE Conference on Computational Complexity 2005: 170-182

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)

Chi-Jen Lu: Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors. J. Cryptology 17(1): 27-42 (2004)

Chi-Jen Lu: Deterministic Hypergraph Coloring and Its Applications. SIAM J. Discrete Math. 18(2): 320-331 (2004)

Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Extractors: optimal up to constant factors. STOC 2003: 602-611

Chi-Jen Lu: Improved Pseudorandom Generators for Combinatorial Rectangles. Combinatorica 22(3): 417-434 (2002)

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

Chi-Jen Lu: Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors. CRYPTO 2002: 257-271

Chi-Jen Lu: Derandomizing Arthur-Merlin games under uniform assumptions. Computational Complexity 10(3): 247-259 (2001)

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)

Chi-Jen Lu, Shi-Chun Tsai: A Note on Iterating an alpha-ary Gray Code. SIAM J. Discrete Math. 14(2): 237-239 (2001)

Chi-Jen Lu: An exact characterization of symmetric functions in qAC⁰[2]. Theor. Comput. Sci. 261(2): 297-303 (2001)

Yan-Cheng Chang, Chi-Jen Lu: Oblivious Polynomial Evaluation and Oblivious Neural Learning. ASIACRYPT 2001: 369-384

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

Chi-Jen Lu: Derandomizing Arthur-Merlin Games under Uniform Assumptions. ISAAC 2000: 302-312

David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: On Monotone Planar Circuits. IEEE Conference on Computational Complexity 1999: 24-

Chi-Jen Lu: A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem. SODA 1999: 663-668

Chi-Jen Lu: An Exact Characterization of Symmetric Functions in qAC⁰[2]. COCOON 1998: 167-173

Chi-Jen Lu: Improved Pseudorandom Generators for Combinatorial Rectangles. ICALP 1998: 223-234

Chi-Jen Lu: Deterministic Hypergraph Coloring and Its Applications. RANDOM 1998: 35-46

David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: Searching Constant Width Mazes Captures the AC⁰ Hierarchy. STACS 1998: 73-83

David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: Searching constant width mazes captures the AC⁰ hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 4(44) (1997)

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)

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