Shi-Chun Tsai

According to our database1, Shi-Chun Tsai authored at least 63 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
SDN Soft Computing Application for Detecting Heavy Hitters.
IEEE Trans. Industrial Informatics, 2019

A Dual-Stack Authentication Mechanism Through SNMP.
JoWUA, 2019

Automatic Blocking Mechanism for Information Security with SDN.
J. Internet Serv. Inf. Secur., 2019

Enhancing 5G/IoT Transport Security Through Content Permutation.
IEEE Access, 2019

2018
Detecting P2P Botnet in Software Defined Networks.
Security and Communication Networks, 2018

Representing Symmetric Boolean Functions with Polynomial over Composite Moduli.
J. Inf. Sci. Eng., 2018

A Dichotomy Result for Cyclic-Order Traversing Games.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Fast Failover with Hierarchical Disjoint Paths in SDN.
Proceedings of the IEEE Global Communications Conference, 2018

2017
Deploying WLAN service with OpenFlow technology.
Int. Journal of Network Management, 2017

An autoblocking mechanism for firewall service.
Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Implementing NFV system with OpenStack.
Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Detecting amplification attacks with Software Defined Networking.
Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Forwarding path discovery with software defined networking.
Proceedings of the 19th Asia-Pacific Network Operations and Management Symposium, 2017

2015
On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method.
CoRR, 2015

Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Network security management with traffic pattern clustering.
Soft Comput., 2014

More on the one-dimensional sliding-coin puzzle.
Discret. Appl. Math., 2014

Online Prediction Problems with Variation.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2012
Inapproximability Results for the Weight Problems of Subgroup Permutation Codes.
IEEE Trans. Information Theory, 2012

On the inapproximability of maximum intersection problems.
Inf. Process. Lett., 2012

2011
Extracting Computational Entropy and Learning Noisy Linear Functions.
IEEE Trans. Information Theory, 2011

An Optimal Data Hiding Scheme With Tree-Based Parity Check.
IEEE Trans. Image Processing, 2011

More on the Magnus-Derek game.
Theor. Comput. Sci., 2011

Improved Bound on Approximating Jug Measuring Problem.
J. Inf. Sci. Eng., 2011

Alternating Runs of Geometrically Distributed Random Variables.
J. Inf. Sci. Eng., 2011

Decoding permutation arrays with ternary vectors.
Des. Codes Cryptogr., 2011

Complexity of Hard-Core Set Proofs.
Computational Complexity, 2011

Computing the ball size of frequency permutations under chebyshev distance.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Computational Randomness from Generalized Hardcore Sets.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Decoding Frequency Permutation Arrays Under Chebyshev Distance.
IEEE Trans. Information Theory, 2010

Deterministic Extractors for Independent-Symbol Sources.
IEEE Trans. Information Theory, 2010

Permutation arrays under the Chebyshev distance.
IEEE Trans. Information Theory, 2010

On the minimum weight problem of permutation codes under Chebyshev distance.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Key establishment schemes against storage-bounded adversaries in wireless sensor networks.
IEEE Trans. Wireless Communications, 2009

Decoding frequency permutation arrays under infinite norm.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On the Complexity of Hardness Amplification.
IEEE Trans. Information Theory, 2008

Simple Distance-Preserving Mappings From Ternary Vectors to Permutations.
IEEE Trans. Information Theory, 2008

Jug measuring: Algorithms and complexity.
Theor. Comput. Sci., 2008

Efficient encoding and decoding with permutation arrays.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A Monte Carlo Method for Estimating the Extended All-Terminal Reliability.
Proceedings of the Fourth International Conference on Networking and Services, 2008

2007
Improved hardness amplification in NP.
Theor. Comput. Sci., 2007

On the fairness and complexity of generalized k-in-a-row games.
Theor. Comput. Sci., 2007

Arranging Numbers on Circles to Reach Maximum Total Variations.
Electr. J. Comb., 2007

Efficient Large-Scale Distributed Key Generation against Burst Interruption.
Proceedings of the SECRYPT 2007, 2007

On the Complexity of Hard-Core Set Constructions.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Impossibility Results on Weakly Black-Box Hardness Amplification.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations.
Des. Codes Cryptogr., 2006

2005
On the Jensen-Shannon Divergence and Variational Distance.
IEEE Trans. Information Theory, 2005

Extracting randomness from multiple independent sources.
IEEE Trans. Information Theory, 2005

2003
Compiler optimization on VLIW instruction scheduling for low power.
ACM Trans. Design Autom. Electr. Syst., 2003

Distance-preserving mappings from binary vectors to permutations.
IEEE Trans. Information Theory, 2003

A note on unscrambling address lines.
Inf. Process. Lett., 2003

2001
JGAP: a Java-based graph algorithms platform.
Softw., Pract. Exper., 2001

A Note on Iterating an alpha-ary Gray Code.
SIAM J. Discrete Math., 2001

A Depth 3 Circuit Lower Bound for the Parity Function.
J. Inf. Sci. Eng., 2001

2000
On the bottleneck counting argument.
Theor. Comput. Sci., 2000

Exact solution of a minimal recurrence.
Inf. Process. Lett., 2000

Two Results on the Bit Extraction Problem.
Discret. Appl. Math., 2000

Compiler Optimization on Instruction Scheduling for Low Power.
Proceedings of the 13th International Symposium on System Synthesis, 2000

1997
A Note on the Bottleneck Counting Argument.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Lower Bounds on Representing Boolean Functions as Polynomials in Zm.
SIAM J. Discrete Math., 1996

Recycling Random Bits in Parallel.
Parallel Algorithms Appl., 1996

1993
Lower Bounds on Representing Boolean Functions as Polynomials in Zm.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, 1993


  Loading...