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