Shao Chin Sung

Publication Activity (10 Years)

Years Active: 1998-2010
Publications (10 Years): 0

Publications

Shao Chin Sung, Dinko Dimitrov
Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203 (3) (2010)
Shao Chin Sung, Dinko Dimitrov
On core membership testing for hedonic coalition formation games. Oper. Res. Lett. 35 (2) (2007)
Dinko Dimitrov, Shao Chin Sung, Yongsheng Xu
Procedural group identification. Math. Soc. Sci. 54 (2) (2007)
Dinko Dimitrov, Peter Borm, Ruud Hendrickx, Shao Chin Sung
Simple Priorities and Core Stability in Hedonic Games. Soc. Choice Welf. 26 (2) (2006)
Dinko Dimitrov, Shao Chin Sung
Top responsiveness and Nash stability in coalition formation games. Kybernetika 42 (4) (2006)
Shao Chin Sung, Milan Vlach
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J. Sched. 8 (5) (2005)
Ondrej Cepek, Shao Chin Sung
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. 32 (2005)
Shao Chin Sung, Milan Vlach
Competitive envy-free division. Soc. Choice Welf. 23 (1) (2004)
Shao Chin Sung, Keisuke Tanaka
Limiting negations in bounded-depth circuits: An extension of Markov's theorem. Inf. Process. Lett. 90 (1) (2004)
Takashi Mihara, Shao Chin Sung
Deterministic polynomial-time quantum algorithms for Simon's problem. Comput. Complex. 12 (3-4) (2003)
Shao Chin Sung, Keisuke Tanaka
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. ISAAC (2003)
Shao Chin Sung, Milan Vlach
Single machine scheduling to minimize the number of late jobs under uncertainty. Fuzzy Sets Syst. 139 (2) (2003)
Kanesan Muthusamy, Shao Chin Sung, Milan Vlach, Hiroaki Ishii
Scheduling with fuzzy delays and fuzzy precedences. Fuzzy Sets Syst. 134 (3) (2003)
Shao Chin Sung, Keisuke Tanaka
An exponential gap with the removal of one negation gate. Inf. Process. Lett. 82 (3) (2002)
Hideaki Abe, Shao Chin Sung
Parallelizing with Limited Number of Ancillae. UMC (2000)
Takashi Mihara, Shao Chin Sung
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. ISAAC (1998)