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