The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shan-Tai Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Li-Te Huang, Shan-Tai Chen, Shun-Shii Lin
    Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie. [Citation Graph (0, 0)][DBLP]
    ACG, 2006, pp:195-209 [Conf]
  2. Pi-Rong Sheu, Shan-Tai Chen
    A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation Bound Multicast Tree Problem. [Citation Graph (0, 0)][DBLP]
    ICOIN, 2001, pp:611-618 [Conf]
  3. Shan-Tai Chen, Shun-Shii Lin
    Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:5, pp:602-611 [Journal]
  4. Shun-Shii Lin, Shan-Tai Chen
    On Detecting Multiple Faults in Baseline Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1998, v:41, n:4, pp:254-269 [Journal]
  5. Pi-Rong Sheu, Shan-Tai Chen
    A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2002, v:25, n:8, pp:825-833 [Journal]
  6. Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang, Chun-Jen Wei
    Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:3, pp:337-355 [Journal]
  7. Shan-Tai Chen, Shun-Shii Lin
    Optimal Algorithms for 2xn AB Games - A Graph-Partition Approach. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2004, v:20, n:1, pp:105-126 [Journal]
  8. Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang
    A Two-Phase Optimization Algorithm For Mastermind. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:4, pp:435-443 [Journal]
  9. Pi-Rong Sheu, Shan-Tai Chen
    On the Hardness of Approximating the Multicast Delay Variation Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:11, pp:1575-1577 [Journal]

  10. A Novel Algorithm for Completely Hiding Sensitive Association Rules. [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002