A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. - Takashi Mihara; Shao Chin Sung (ISAAC, 1998)

Parallelizing with Limited Number of Ancillae. - Hideaki Abe; Shao Chin Sung (UMC, 2000)

An exponential gap with the removal of one negation gate. - Shao Chin Sung; Keisuke Tanaka (Inf. Process. Lett., 2002)

Deterministic polynomial-time quantum algorithms for Simon's problem. - Takashi Mihara; Shao Chin Sung (Comput. Complex., 2003)

Scheduling with fuzzy delays and fuzzy precedences. - Kanesan Muthusamy; Shao Chin Sung; Milan Vlach; Hiroaki Ishii (Fuzzy Sets Syst., 2003)

Single machine scheduling to minimize the number of late jobs under uncertainty. - Shao Chin Sung; Milan Vlach (Fuzzy Sets Syst., 2003)

Limiting negations in bounded-depth circuits: An extension of Markov's theorem. - Shao Chin Sung; Keisuke Tanaka (Inf. Process. Lett., 2004)

Competitive envy-free division. - Shao Chin Sung; Milan Vlach (Soc. Choice Welf., 2004)

A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. - Ondrej Cepek; Shao Chin Sung (Comput. Oper. Res., 2005)

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. - Shao Chin Sung; Milan Vlach (J. Sched., 2005)

Top responsiveness and Nash stability in coalition formation games. - Dinko Dimitrov; Shao Chin Sung (Kybernetika, 2006)

Simple Priorities and Core Stability in Hedonic Games. - Dinko Dimitrov; Peter Borm; Ruud Hendrickx; Shao Chin Sung (Soc. Choice Welf., 2006)

Procedural group identification. - Dinko Dimitrov; Shao Chin Sung; Yongsheng Xu (Math. Soc. Sci., 2007)

On core membership testing for hedonic coalition formation games. - Shao Chin Sung; Dinko Dimitrov (Oper. Res. Lett., 2007)

Computational complexity in additive hedonic games. - Shao Chin Sung; Dinko Dimitrov (Eur. J. Oper. Res., 2010)