| 2009 |
|---|
| 29 | EE | Min-Zheng Shieh,
Shi-Chun Tsai:
Decoding Frequency Permutation Arrays under Infinite norm
CoRR abs/0901.1971: (2009) |
| 2008 |
|---|
| 28 | EE | 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) |
| 27 | EE | Te-Tsung Lin,
Shi-Chun Tsai,
Hsin-Lung Wu:
Simple Distance-Preserving Mappings From Ternary Vectors to Permutations.
IEEE Transactions on Information Theory 54(7): 3251-3256 (2008) |
| 26 | EE | Min-Zheng Shieh,
Shi-Chun Tsai:
Jug measuring: Algorithms and complexity.
Theor. Comput. Sci. 396(1-3): 50-62 (2008) |
| 2007 |
|---|
| 25 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
Impossibility Results on Weakly Black-Box Hardness Amplification.
FCT 2007: 400-411 |
| 24 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Complexity of Hard-Core Set Constructions.
ICALP 2007: 183-194 |
| 23 | EE | Ying-Jie Liao,
Min-Zheng Shieh,
Shi-Chun Tsai:
Arranging Numbers on Circles to Reach Maximum Total Variations.
Electr. J. Comb. 14(1): (2007) |
| 22 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
Improved hardness amplification in NP.
Theor. Comput. Sci. 370(1-3): 293-298 (2007) |
| 21 | EE | Ming Yu Hsieh,
Shi-Chun Tsai:
On the fairness and complexity of generalized k-in-a-row games.
Theor. Comput. Sci. 385(1-3): 88-100 (2007) |
| 2006 |
|---|
| 20 | EE | Chia-Jung Lee,
Chi-Jen Lu,
Shi-Chun Tsai:
Deterministic Extractors for Independent-Symbol Sources.
ICALP (1) 2006: 84-95 |
| 19 | EE | Yen-Ying Huang,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations.
Des. Codes Cryptography 40(2): 139-155 (2006) |
| 2005 |
|---|
| 18 | EE | Chi-Jen Lu,
Shi-Chun Tsai,
Hsin-Lung Wu:
On the Complexity of Hardness Amplification.
IEEE Conference on Computational Complexity 2005: 170-182 |
| 17 | EE | 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) |
| 16 | EE | Shi-Chun Tsai,
Wen-Guey Tzeng,
Hsin-Lung Wu:
On the Jensen-Shannon Divergence and Variational Distance.
IEEE Transactions on Information Theory 51(9): 3333-3336 (2005) |
| 2003 |
|---|
| 15 | EE | Chingren Lee,
Jenq Kuen Lee,
TingTing Hwang,
Shi-Chun Tsai:
Compiler optimization on VLIW instruction scheduling for low power.
ACM Trans. Design Autom. Electr. Syst. 8(2): 252-268 (2003) |
| 14 | | Jen-Chun Chang,
Rong-Jaye Chen,
Torleiv Kløve,
Shi-Chun Tsai:
Distance-preserving mappings from binary vectors to permutations.
IEEE Transactions on Information Theory 49(4): 1054-1059 (2003) |
| 13 | EE | Chang-Chun Lu,
Shi-Chun Tsai:
A note on unscrambling address lines.
Inf. Process. Lett. 85(4): 185-189 (2003) |
| 2001 |
|---|
| 12 | EE | Shi-Chun Tsai:
A Depth 3 Circuit Lower Bound for the Parity Function.
J. Inf. Sci. Eng. 17(5): 857-860 (2001) |
| 11 | EE | Chi-Jen Lu,
Shi-Chun Tsai:
A Note on Iterating an alpha-ary Gray Code.
SIAM J. Discrete Math. 14(2): 237-239 (2001) |
| 10 | | Ding-Yi Chen,
Tyng-Ruey Chuang,
Shi-Chun Tsai:
JGAP: a Java-based graph algorithms platform.
Softw., Pract. Exper. 31(7): 615-635 (2001) |
| 2000 |
|---|
| 9 | EE | Chingren Lee,
Jenq Kuen Lee,
TingTing Hwang,
Shi-Chun Tsai:
Compiler Optimization on Instruction Scheduling for Low Power.
ISSS 2000: 55-61 |
| 8 | EE | Katalin Friedl,
Shi-Chun Tsai:
Two Results on the Bit Extraction Problem.
Discrete Applied Mathematics 99(1-3): 443-454 (2000) |
| 7 | EE | Keh-Ning Chang,
Shi-Chun Tsai:
Exact solution of a minimal recurrence.
Inf. Process. Lett. 75(1-2): 61-64 (2000) |
| 6 | EE | Janos Simon,
Shi-Chun Tsai:
On the bottleneck counting argument.
Theor. Comput. Sci. 237(1-2): 429-437 (2000) |
| 1997 |
|---|
| 5 | EE | Janos Simon,
Shi-Chun Tsai:
A Note on the Bottleneck Counting Argument.
IEEE Conference on Computational Complexity 1997: 297-301 |
| 1996 |
|---|
| 4 | EE | Katalin Friedl,
Shi-Chun Tsai:
Recycling Random Bits in Parallel.
Parallel Algorithms Appl. 8(1): 85-94 (1996) |
| 3 | EE | Shi-Chun Tsai:
Lower Bounds on Representing Boolean Functions as Polynomials in zm.
SIAM J. Discrete Math. 9(1): 55-62 (1996) |
| 1995 |
|---|
| 2 | EE | Katalin Friedl,
Shi-Chun Tsai:
Recycling random bits in parallel.
HICSS (2) 1995: 14-19 |
| 1993 |
|---|
| 1 | | Shi-Chun Tsai:
Lower Bounds on Representing Boolean Functions as Polynomials in Zm.
Structure in Complexity Theory Conference 1993: 96-101 |
