Published Papers

Journal papers:

  1. H.-W. Hsu, K.-L. Huang, Y.-C. Kao, S.-C. Tsai, Y.-B. Lin, Deploying WLAN Service with OpenFlow Technologies,
    International Journal of Network Management, 2017, Vol. 27 issue 3.
  2. S.-C. Su, Y.-R. Chen, S.-C. Tsai and Y.-B. Lin, Detecting P2P Botnet in Software Defined Networks,
    in Security and Communication Networks, accepted and to appear.
  3. S.-C. Tsai and M.-C. Yang, Representing Symmetric Boolean Functions with Polynomial over Composite Moduli,
    in Journal of Information Science and Engineering, accepted and to appear.
  4. T.-Y. Lin, S.-C. Tsai, W.-N. Tsai, J.-C. Tsay, More on the One-dimensional Sliding-Coin Puzzle, in
    Discrete Applied Mathematics (SCI), (162) pp. 32--41, 2014.
  5. T.W. Chiou, S.-C. Tsai and Y.-B. Lin, Network Security Management with Traffic Pattern Clustering, in
    Soft Computing, Volume 18, Issue 9 (2014), Pp. 1757-1770.
  6. M.-Z. Shieh, S.-C. Tsai, Inapproximable results for the weight problems of subgroup permutation codes,
    IEEE Transactions on Information Theory (SCI), Vol. 58(11) pp. 6907- 6915, 2012.
  7. M.-Z. Shieh, S.-C. Tsai, Computing the Ball Size of Frequency Permutations under Chebyshev Distance,
    Linear Algebra and its Applications (SCI), Volume 437, Issue 1, pp. 324--332, 2012.
  8. M.-Z. Shieh, S.-C. Tsai, M.-C. Yang, On the Inapproximability of Maximum Intersection Problems,
    Information Processing Letters (SCI), Vol. 112 (19), pp.723--727, 2012.
  9. Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai, Extracting Computational Entropy and Learning Noisy Linear Functions,
    IEEE Transactions on Information Theory (SCI), Vol. 57(8) pp. 5485-5496, 2011.
  10. C.-J. Lee, T.-T. Lin, M.-Z. Shieh, S.-C. Tsai, H.-L. Wu, Decoding Permutation Arrays with Ternary Vectors,
    Designs, Codes and Cryptography (SCI), Volume 61, Number 1, pp. 1-9, 2011. pdf
  11. Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu, Complexity of Hard-Core Set Proofs,
    Computational Complexity (SCI), 20(1), pp. 145--171, 2011.
  12. C.-J. Lee, S.-C. Tsai, Alternating Runs of Geometrically Distributed Random Variables,
    Journal of Information Science and Engineering, Vol. 27, No. 3, pp. 1029--1044, 2011.
  13. M.-Z. Shieh, S.-C. Tsai, Improved Bound on Approximating Jug Measuring Problem,
    Journal of Information Science and Engineering, Vol. 27, No. 3, pp. 1159--1163, 2011.
  14. Chung-Li Hou, C.-C. Lu, S.-C. Tsai and W,-G. Tzeng, An optimal data hiding scheme with tree-based parity check,
    IEEE Transactions on Image Processing (SCI), Vol 20 (3), pp. 880--886, 2011. pdf
  15. Li-Jui Chen, Jinn-Jy Lin, Min-Zheng Shieh, Shi-Chun Tsai, More on the Magnus-Derek Game,
    Theoretical Computer Science (SCI), Vol 412(4-5), pp. 339-344, 2011. pdf
  16. Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai, Deterministic Extractors for Independent-Symbol Sources,
    IEEE Transactions on Information Theory, (SCI), Vol. 56(12), 6501--6512, 2010.
  17. Min-Zheng Shieh, Shi-Chun Tsai, Decoding Frequency Permutation Arrays under Chebyshev distance,
    IEEE Transactions on Information Theory (SCI), Vol. 56(11), 5730--5737, 2010. pdf
  18. T. Klove, T.-T. Lin, S.-C. Tsai and W,-G. Tzeng, Permutation arrays under the Chebyshev distance,
    IEEE Transactions on Information Theory (SCI), Vol. 56(6), 2611--2617, 2010. pdf
  19. S.-C. Tsai, W.-G. Tzeng, Kun-Yi Zhou, Key Establishment Schemes Against Storage-Bounded Adversaries in Wireless Sensor Networks,
    IEEE Transactions on Wireless Communications, Vol. 8, no. 3, 1218--1222, 2009.
  20. C.-J. Lu, S.-C. Tsai and H.-L. Wu, On the Complexity of Hardness Amplification,
    IEEE Transactions on Information Theory (SCI), 54(10), 4575--4586, 2008.
  21. 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
  22. M.-Z. Shieh and S.-C. Tsai, Jug measuring: algorithms and complexity,
    Theoretical Computer Science(SCI), Vol 396, pp. 50--62, 2008. pdf
  23. 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
  24. 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.
  25. 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.
  26. 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 Designs (SCI), 40:2, pp. 139-155, August 2006.
  27. 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.
  28. 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.
  29. 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.
  30. C.-C. Lu and S.-C. Tsai, A note on unscrambling address lines,
    Information Processing Letters (SCI Expanded,EI), 85(4): 185--189, 2003.
  31. 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.
  32. 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.
  33. 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)
  34. 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).
  35. K.N. Chang and S.C. Tsai, Exact Solution of a Minimal Recurrence,
    Information Processing Letters pp. 61--64, 2000 (EI, SCI Expanded).
  36. 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.
  37. 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.
  38. 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.
  39. 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. Jinlin Chen, Yiren Chen, Shi-Chun Tsai, and Yi-Bing Lin, Implementing NFV System with OpenStack,
    2017 IEEE Conference on Dependable and Secure Computing, Taipei, Taiwan, August 7-10, 2017.
  2. Chih-Chieh Chen, Yi-Ren Chen, Shi-Chun Tsai, and Ming-Chuan Yang, Forwarding Path Discovery with Software Defined Networking,
    19th Asia-Pacific Network Operations and Management Symposium (APNOMS 2017), Seoul, Korea, Sep. 27-29, 2017.
  3. Chih-Chieh Chen, Yi-Ren Chen, Wei-Chih Lu, Shi-Chun Tsai, and Ming-Chuan Yang, Detecting Amplfication Attacks with Software Defined Networking,
    2017 IEEE Conference on Dependable and Secure Computing, Taipei, Taiwan, August 7-10, 2017.
  4. Shan-Jung Fu, Huai-Wen Hsu, Yichih Kao, Shi-Chun Tsai, and Chien-Chao Tseng, An Autoblocking Mechanism for Firewall Service,
    2017 IEEE Conference on Dependable and Secure Computing, Taipei, Taiwan, August 7-10, 2017.
  5. Chia-Jung Lee, Satya V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang, On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method,
    2015 IEEE International Symposium on Information Theory (ISIT 2015), June 14-19, 2015 in Hong Kong.
  6. Chia-Jung Lee, Shi-Chun Tsai and Ming-Chuan Yang, Online Prediction Problems with Variation,
    20th International Computing and Combinatorics Conference (COCOON 2014), Atlanta, Georgia, USA, August 4-6, 2014.
  7. Chia-Jung Lee, Chi-Jen Lu and Shi-Chun Tsai. Computational Randomness from Generalized Hardcore Sets,
    18th International Symposium on Fundamentals of Computation Theory, Oslo, NORWAY, August 22-25, 2011.
  8. Min-Zheng Shieh, Shi-Chun Tsai, Computing the Ball Size of Frequency Permutations under Chebyshev Distance,
    2011 IEEE International Symposium on Information Theory (ISIT 2011), July, 31 - August, 5, 2011, in Saint-Petersburg, Russia.
  9. Min-Zheng Shieh, Shi-Chun Tsai, On the minimum weight problem of permutation codes under Chebyshev distance,
    2010 IEEE International Symposium on Information Theory (ISIT 2010), June 13-18, 2010, in Austin, Texas, USA.
  10. Min-Zheng Shieh, Shi-Chun Tsai, Decoding Frequency Permutation Arrays under Infinite norm,
    2009 IEEE International Symposium on Information Theory (ISIT 2009), June 28- July 3, 2009, Seoul, Korea.
  11. C.-J. Lee, C.-J. Lu, S.-C. Tsai, Extracting Computational Entropy and Learning Noisy Linear Functions,
    The 15th International Computing and Combinatorics Conference (COCOON'2009) Niagara Falls, New York, U.S.A., July 13--15, 2009.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. C.-J. Lu, S.-C. Tsai and H.-L. Wu, On the Complexity of Hardness Amplification,
    20th IEEE Computational Complexity Conference (CCC 2005).
  18. Ming Yu-Hsieh, Min-Zheng Shieh, S.-C. Tsai A greedy approach to the coin exchange problem, ICS 2004.
  19. 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.
  20. 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.
  21. J. Simon and S.C. Tsai, On the Bottleneck Counting Method, in
    the 12th Computational Complexity Conference, Ulm, Germany, pp. 297--301, 1997.
  22. 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.
  23. K. Friedl and S.C. Tsai, Recycling Random Bits in Parallel, in
    HICSS-28 Proceedings, USA, Jan. 1995.
  24. 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.

Back to Shi-Chun Tsai Main Page