Papers of Shi-Chun Tsai

Journal papers:

(作者按英文拼音字母順序排列)
  1. C.-J. Lu, S.-C. Tsai and H.-L. Wu, On the Complexity of Hardness Amplification, accepted and to appear in IEEE Transactions on Information Theory (SCI).
  2. Te-Tsung Lin, S.-C. Tsai, H.-L. Wu, Simple Distance-Preserving Mappings from Ternary Vectors to Permutations, IEEE Transactions on Information Theory (SCI), 54(7), 3251--3256, 2008. ps
  3. M.-Z. Shieh and S.-C. Tsai, Jug measuring: algorithms and complexity, Theoretical Computer Science(SCI), Vol 396, pp. 50--62, 2008. pdf
  4. Ming Yu Hsieh and Shi-Chun Tsai, On the Fairness and Complexity of Generalized k-in-a-row Games, Theoretical Computer Science(SCI), Vol 385, pp. 88--100, 2007. ps
  5. Ying-Jie Liao, Min-Zheng Shieh and Shi-Chun Tsai, Arranging Numbers on Circles to Reach Maximum Total Variations, the Electronic Journal of Combinatorics(SCI), R47: Volume 14(1), 2007.
  6. C.-J. Lu, S.-C. Tsai and H.-L. Wu, Improved hardness amplification within NP, Theoretical Computer Science(SCI), Vol 370, pp.293--298, 2007.
  7. Yen-Ying Huang, Shi-Chun Tsai and Hsin-Lung Wu, On the construction of permutation arrays via mappings from binary vectors to permutations, Designs, Codes and Cryptography(SCI), 40:2, pp. 139-155, August 2006.
  8. S.-C. Tsai, W.-G. Tzeng and H.-L. Wu, On the Jensen-Shannon Divergence and Variational Distance, IEEE Transactions on Information Theory (SCI), 51(9) 3333--3336, 2005.
  9. C.-J. Lee, C.-J. Lu, S.-C. Tsai and W.-G. Tzeng, Extracting Randomness from Multiple Independent Sources, IEEE Transactions on Information Theory (SCI), 51(6) 2224-2227, 2005.
  10. T.-T. Hwang, C.-J. Lee, J.-K.Lee and S.C. Tsai, Compiler Optimization on Instruction Scheduling for Low Power, ACM Transactions on Design Automation of Electronic Systems, TODAES 8(2): 252-268, 2003.
  11. C.-C. Lu and S.-C. Tsai, A note on unscrambling address lines, Information Processing Letters (SCI Expanded,EI), 85(4): 185--189, 2003.
  12. J.-C. Chang, R.-J. Chen, T. Klove and S.-C. Tsai, Distance preserving mappings from Binary vectors to permutations, IEEE Transactions on Information Theory (SCI), 49(4): 1054--1059, 2003.
  13. C.-J. Lu and S.-C. Tsai, A note on iterating an alpha-ary gray code, SIAM Journal on Discrete Mathematics (SCI), Vol 14 (2), pp. 237--239, 2001.
  14. D. Chen, T.-R. Chuang and S.C. Tsai, JGAP: A Java-based Graph Algorithms Platform, Software-- Practice and Experience, pp. 615-635, 2001 (SCI)
  15. S.C. Tsai, A Depth 3 Circuit Lower Bound for the Parity Function, Journal of Information Science and Engineering, Vol 17 (5), pp. 857--860, 2001 (SCI Expanded).
  16. K.N. Chang and S.C. Tsai, Exact Solution of a Minimal Recurrence, Information Processing Letters pp. 61--64, 2000 (EI, SCI Expanded).
  17. J. Simon and S.C. Tsai, On the Bottleneck Counting Method, in the 12th Computational Complexity Conference, Ulm, Germany, pp. 297--301, 1997, final version in Theoretical Computer Science (SCI), pp. 429--437, 2000.
  18. K. Friedl and S.C. Tsai, Two Results on the Bit Extraction Problem, presented in the 8th SIAM Conference in Discrete Mathematics, 1996, Baltimore, USA, final version published in Discrete Applied Mathematics (SCI), Vol 99, pp. 443--454, 2000.
  19. K. Friedl and S.C. Tsai, Recycling Random Bits in Parallel, HICSS-28 Proceedings, Jan. 1995, final version published in J. of Parallel Algorithms and Applications, Vol. 8, pp. 85--94, 1996.
  20. S.C. Tsai, Lower Bounds on Representing Boolean Functions as Polynomials in Z_m, SIAM Journal on Discrete Mathematics (SCI), 9(1), pp. 55--62, 1996.

Conference papers:

  1. Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng, Efficient Encoding and Decoding with Permutation Arrays, 2008 IEEE International Symposium on Information Theory (ISIT 2008), July 6th- 11th, 2008, Toronto, Ontario, Canada.
  2. J.-R. Ou, S.-C. Tsai, W.-G. Tzeng. Efficient large-scale distributed key generation against burst interruption, International Conference on Security and Cryptography (SECRYPT 2007) Barcelona, Spain, 28-31 July, 2007.
  3. Chi-Jen Lu, Shi-Chun Tsai and Hsin-Lung Wu, Impossibility Results on Weakly Black-Box Hardness Amplification, 16th International Symposium on Fundamentals of Computation Theory. Budapest, Hungary August 27-30, 2007.
  4. Chi-Jen Lu, Shi-Chun Tsai and Hsin-Lung Wu, On the Complexity of Hard-Core Set Constructions, 34th International Colloquium on Automata, Languages and Programming (ICALP 2007). Wrocław, Poland, 9-13 July 2007.
  5. C.-J. Lee, C.-J. Lu, S.-C. Tsai Deterministic Extractors for Independent-symbol Sources, 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006) S. Servolo, Venice - Italy , July 9 - 16, 2006.
  6. C.-J. Lu, S.-C. Tsai and H.-L. Wu, On the Complexity of Hardness Amplification, 20th IEEE Computational Complexity Conference (CCC 2005).
  7. Ming Yu-Hsieh, Min-Zheng Shieh, S.-C. Tsai A greedy approach to the coin exchange problem, ICS 2004.
  8. T.-T. Hwang, C.-J. Lee, J.-K.Lee and S.C. Tsai, Compiler Optimization on Instruction Scheduling for Low Power, International Symposium on System Synthesis (IEEE Computer Society Sponsor), Madrid, Spain, Sep. 2000.
  9. C.-J. Lu and S.-C. Tsai, The Periodic Property of Binomial Coefficients Modulo $m$ and Its Applications, 10th SIAM Conference on Discrete Mathematics, 2000, Minneapolis, Minnesota, USA.
  10. J. Simon and S.C. Tsai, On the Bottleneck Counting Method, in the 12th Computational Complexity Conference, Ulm, Germany, pp. 297--301, 1997.
  11. K. Friedl and S.C. Tsai, Two Results on the Bit Extraction Problem, presented in the 8th SIAM Conference in Discrete Mathematics, Baltimore, USA, 1996.
  12. K. Friedl and S.C. Tsai, Recycling Random Bits in Parallel, in HICSS-28 Proceedings, USA, Jan. 1995.
  13. S.C. Tsai, Lower Bounds on Representing Boolean Functions as Polynomials in Z_m, in Structure in Complexity Theory Conference, San Diego, USA, pp. 96--101, 1993.

Others

Back to Shi-Chun Tsai Main Page