| 2007 |
|---|
| 11 | EE | Shao Chin Sung,
Dinko Dimitrov:
On core membership testing for hedonic coalition formation games.
Oper. Res. Lett. 35(2): 155-158 (2007) |
| 2005 |
|---|
| 10 | EE | Ondrej Cepek,
Shao Chin Sung:
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines.
Computers & OR 32: 3265-3271 (2005) |
| 9 | EE | Shao Chin Sung,
Milan Vlach:
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines.
J. Scheduling 8(5): 453-460 (2005) |
| 2004 |
|---|
| 8 | EE | Shao Chin Sung,
Keisuke Tanaka:
Limiting negations in bounded-depth circuits: An extension of Markov's theorem.
Inf. Process. Lett. 90(1): 15-20 (2004) |
| 2003 |
|---|
| 7 | EE | Shao Chin Sung,
Keisuke Tanaka:
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem.
ISAAC 2003: 108-116 |
| 6 | EE | Takashi Mihara,
Shao Chin Sung:
Deterministic polynomial-time quantum algorithms for Simon's problem.
Computational Complexity 12(3-4): 162-175 (2003) |
| 5 | EE | Kanesan Muthusamy,
Shao Chin Sung,
Milan Vlach,
Hiroaki Ishii:
Scheduling with fuzzy delays and fuzzy precedences.
Fuzzy Sets and Systems 134(3): 387-395 (2003) |
| 4 | EE | Shao Chin Sung,
Milan Vlach:
Single machine scheduling to minimize the number of late jobs under uncertainty.
Fuzzy Sets and Systems 139(2): 421-430 (2003) |
| 2002 |
|---|
| 3 | EE | Shao Chin Sung,
Keisuke Tanaka:
An exponential gap with the removal of one negation gate.
Inf. Process. Lett. 82(3): 155-157 (2002) |
| 2000 |
|---|
| 2 | | Hideaki Abe,
Shao Chin Sung:
Parallelizing with Limited Number of Ancillae.
UMC 2000: 123-134 |
| 1998 |
|---|
| 1 | EE | Takashi Mihara,
Shao Chin Sung:
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem.
ISAAC 1998: 229-236 |
