default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShao Chin Sung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j13]Shao Chin Sung, Dinko Dimitrov:
Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3): 635-639 (2010)
2000 – 2009
- 2007
- [j12]Dinko Dimitrov, Shao Chin Sung, Yongsheng Xu
:
Procedural group identification. Math. Soc. Sci. 54(2): 137-146 (2007) - [j11]Shao Chin Sung, Dinko Dimitrov:
On core membership testing for hedonic coalition formation games. Oper. Res. Lett. 35(2): 155-158 (2007) - 2006
- [j10]Dinko Dimitrov, Shao Chin Sung:
Top responsiveness and Nash stability in coalition formation games. Kybernetika 42(4): 453-460 (2006) - [j9]Dinko Dimitrov, Peter Borm, Ruud Hendrickx, Shao Chin Sung:
Simple Priorities and Core Stability in Hedonic Games. Soc. Choice Welf. 26(2): 421-433 (2006) - 2005
- [j8]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: 3265-3271 (2005) - [j7]Shao Chin Sung, Milan Vlach:
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J. Sched. 8(5): 453-460 (2005) - 2004
- [j6]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) - [j5]Shao Chin Sung, Milan Vlach:
Competitive envy-free division. Soc. Choice Welf. 23(1): 103-111 (2004) - 2003
- [j4]Takashi Mihara, Shao Chin Sung:
Deterministic polynomial-time quantum algorithms for Simon's problem. Comput. Complex. 12(3-4): 162-175 (2003) - [j3]Kanesan Muthusamy, Shao Chin Sung, Milan Vlach, Hiroaki Ishii:
Scheduling with fuzzy delays and fuzzy precedences. Fuzzy Sets Syst. 134(3): 387-395 (2003) - [j2]Shao Chin Sung, Milan Vlach:
Single machine scheduling to minimize the number of late jobs under uncertainty. Fuzzy Sets Syst. 139(2): 421-430 (2003) - [c3]Shao Chin Sung, Keisuke Tanaka:
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. ISAAC 2003: 108-116 - 2002
- [j1]Shao Chin Sung, Keisuke Tanaka:
An exponential gap with the removal of one negation gate. Inf. Process. Lett. 82(3): 155-157 (2002) - 2000
- [c2]Hideaki Abe, Shao Chin Sung:
Parallelizing with Limited Number of Ancillae. UMC 2000: 123-134
1990 – 1999
- 1998
- [c1]Takashi Mihara, Shao Chin Sung:
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. ISAAC 1998: 229-236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
