The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chi-Jen Lu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Yan-Cheng Chang, Chi-Jen Lu
    Oblivious Polynomial Evaluation and Oblivious Neural Learning. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:369-384 [Conf]
  3. 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]
  4. 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]
  5. Chi-Jen Lu
    An Exact Characterization of Symmetric Functions in qAC0[2]. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:167-173 [Conf]
  6. 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]
  7. Chi-Jen Lu
    Improved Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:223-234 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. Chi-Jen Lu
    Derandomizing Arthur-Merlin Games under Uniform Assumptions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:302-312 [Conf]
  12. Chi-Jen Lu
    Deterministic Hypergraph Coloring and Its Applications. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:35-46 [Conf]
  13. Chi-Jen Lu
    A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:663-668 [Conf]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. Chi-Jen Lu
    Improved Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:417-434 [Journal]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]

  35. Communication Requirements for Stable Marriages. [Citation Graph (, )][DBLP]


  36. Extracting Computational Entropy and Learning Noisy Linear Functions. [Citation Graph (, )][DBLP]


  37. On the Hardness against Constant-Depth Linear-Size Circuits. [Citation Graph (, )][DBLP]


  38. On the Security Loss in Cryptographic Reductions. [Citation Graph (, )][DBLP]


  39. Online Learning with Queries. [Citation Graph (, )][DBLP]


  40. Secure PRNGs from Specialized Polynomial Maps over Any . [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002