| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2011 | Complexity of hard-core set proofs | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | Computational Complexity 20, 145 – 171 | | | |
| 2007 | Impossibility results on weakly black-box hardness amplification | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | | | | |
| 2007 | Improved hardness amplification in NP | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | Theoretical Computer Science 370 | | | |
| 2007 | On the complexity of hard-core set constructions | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | | | | |
| 2005 | On the Complexity of Hardness Amplification | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | | | | |
| 2008 | On the complexity of hardness amplification | Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung | IEEE Transactions on Information Theory 54, 4575-4586 | | | |
| 2010 | On the hardness against constant-depth linear-size circuits | Lu, Chi-Jen; Wu, Hsin-Lung | Discrete Mathematics, Algorithms and Applications 2, 515 – 526 | | | |
