Shi-Chun Tsai

Inf. Process. Lett., 2025

2023

Dependent k-Set Packing on Polynomoids.

[BibT_eX]

[DOI]

Meng-Tsung Tsai

Tsung-Ta Wu

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

On Min-Max Graph Balancing with Strict Negative Correlation Constraints.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

The complexity of comparing optimal solutions.

[BibT_eX]

[DOI]

Da-Ren Chen

Inf. Process. Lett., 2022

Solving hard-exploration problems with counting and replay approach.

[BibT_eX]

[DOI]

Bo-Ying Huang

Eng. Appl. Artif. Intell., 2022

2021

REST API Fuzzing by Coverage Level Guided Blackbox Testing.

[BibT_eX]

[DOI]

Chung-Hsuan Tsai

Shih-Kun Huang

Proceedings of the 21st IEEE International Conference on Software Quality, 2021

2020

RL-Routing: An SDN Routing Algorithm Based on Deep Reinforcement Learning.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2020

Efficient Exploration in Side-Scrolling Video Games with Trajectory Replay.

[BibT_eX]

[DOI]

Comput. Games J., 2020

Dual-Stack Network Management Through One-Time Authentication Mechanism.

[BibT_eX]

[DOI]

IEEE Access, 2020

OAuth-Based Access Control Framework for IoT Systems.

[BibT_eX]

[DOI]

Proceedings of the Smart Grid and Internet of Things - 4th EAI International Conference, 2020

2019

SDN Soft Computing Application for Detecting Heavy Hitters.

[BibT_eX]

[DOI]

Yi-Bing Lin

Ching-Chun Huang

IEEE Trans. Ind. Informatics, 2019

A Dual-Stack Authentication Mechanism Through SNMP.

[BibT_eX]

[DOI]

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2019

Automatic Blocking Mechanism for Information Security with SDN.

[BibT_eX]

[DOI]

J. Internet Serv. Inf. Secur., 2019

Enhancing 5G/IoT Transport Security Through Content Permutation.

[BibT_eX]

[DOI]

Yi-Bing Lin

Tse-Jui Huang

IEEE Access, 2019

2018

Detecting P2P Botnet in Software Defined Networks.

[BibT_eX]

[DOI]

Secur. Commun. Networks, 2018

Representing Symmetric Boolean Functions with Polynomial over Composite Moduli.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2018

A Dichotomy Result for Cyclic-Order Traversing Games.

[BibT_eX]

[DOI]

Yen-Ting Chen

Meng-Tsung Tsai

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Fast Failover with Hierarchical Disjoint Paths in SDN.

[BibT_eX]

[DOI]

Young-Zhe Liao

Proceedings of the IEEE Global Communications Conference, 2018

2017

Deploying WLAN service with OpenFlow technology.

[BibT_eX]

[DOI]

Int. J. Netw. Manag., 2017

An autoblocking mechanism for firewall service.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Implementing NFV system with OpenStack.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Detecting amplification attacks with Software Defined Networking.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Dependable and Secure Computing, 2017

Forwarding path discovery with software defined networking.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2015

Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings.

[BibT_eX]

[DOI]

Satyanarayana V. Lokam

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Network security management with traffic pattern clustering.

[BibT_eX]

[DOI]

Tao-Wei Chiou

Yi-Bing Lin

Soft Comput., 2014

More on the one-dimensional sliding-coin puzzle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Online Prediction Problems with Variation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2012

Inapproximability Results for the Weight Problems of Subgroup Permutation Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the inapproximability of maximum intersection problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

2011

Extracting Computational Entropy and Learning Noisy Linear Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

An Optimal Data Hiding Scheme With Tree-Based Parity Check.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2011

More on the Magnus-Derek game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Improved Bound on Approximating Jug Measuring Problem.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2011

Alternating Runs of Geometrically Distributed Random Variables.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2011

Decoding permutation arrays with ternary vectors.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

Complexity of Hard-Core Set Proofs.

[BibT_eX]

[DOI]

Comput. Complex., 2011

Computing the ball size of frequency permutations under chebyshev distance.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Computational Randomness from Generalized Hardcore Sets.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Decoding Frequency Permutation Arrays Under Chebyshev Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Deterministic Extractors for Independent-Symbol Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Permutation arrays under the Chebyshev distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On the minimum weight problem of permutation codes under Chebyshev distance.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Key establishment schemes against storage-bounded adversaries in wireless sensor networks.

[BibT_eX]

[DOI]

Kun-Yi Zhou

IEEE Trans. Wirel. Commun., 2009

Decoding frequency permutation arrays under infinite norm.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On the Complexity of Hardness Amplification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Simple Distance-Preserving Mappings From Ternary Vectors to Permutations.

[BibT_eX]

[DOI]

Te-Tsung Lin

IEEE Trans. Inf. Theory, 2008

Jug measuring: Algorithms and complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Efficient encoding and decoding with permutation arrays.

[BibT_eX]

[DOI]

Te-Tsung Lin

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A Monte Carlo Method for Estimating the Extended All-Terminal Reliability.

[BibT_eX]

[DOI]

Shiang-Ming Huang

Quincy Wu

Proceedings of the Fourth International Conference on Networking and Services, 2008

2007

Improved hardness amplification in NP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the fairness and complexity of generalized k-in-a-row games.

[BibT_eX]

[DOI]

Ming Yu Hsieh

Theor. Comput. Sci., 2007

Arranging Numbers on Circles to Reach Maximum Total Variations.

[BibT_eX]

[DOI]

Ying-Jie Liao

Electron. J. Comb., 2007

Efficient Large-Scale Distributed Key Generation against Burst Interruption.

[BibT_eX]

Jheng-Ru Ou

Proceedings of the SECRYPT 2007, 2007

On the Complexity of Hard-Core Set Constructions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Impossibility Results on Weakly Black-Box Hardness Amplification.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yen-Ying Huang

Des. Codes Cryptogr., 2006

2005

On the Jensen-Shannon Divergence and Variational Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Extracting randomness from multiple independent sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

2003

Compiler optimization on VLIW instruction scheduling for low power.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2003

Distance-preserving mappings from binary vectors to permutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

A note on unscrambling address lines.

[BibT_eX]

[DOI]

Chang-Chun Lu

Inf. Process. Lett., 2003

2001

JGAP: a Java-based graph algorithms platform.

[BibT_eX]

[DOI]

Ding-Yi Chen

Tyng-Ruey Chuang

Softw. Pract. Exp., 2001

A Note on Iterating an alpha-ary Gray Code.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

A Depth 3 Circuit Lower Bound for the Parity Function.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2001

2000

On the bottleneck counting argument.

[BibT_eX]

[DOI]

Janos Simon

Theor. Comput. Sci., 2000

Exact solution of a minimal recurrence.

[BibT_eX]

[DOI]

Keh-Ning Chang

Inf. Process. Lett., 2000

Two Results on the Bit Extraction Problem.

[BibT_eX]

[DOI]

Katalin Friedl

Discret. Appl. Math., 2000

Compiler Optimization on Instruction Scheduling for Low Power.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on System Synthesis, 2000

1997

A Note on the Bottleneck Counting Argument.

[BibT_eX]

[DOI]

Janos Simon

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Lower Bounds on Representing Boolean Functions as Polynomials in Zm.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Recycling Random Bits in Parallel.

[BibT_eX]

[DOI]

Katalin Friedl

Parallel Algorithms Appl., 1996

1993

Lower Bounds on Representing Boolean Functions as Polynomials in Zm.

[BibT_eX]

[DOI]