| 2012 | ||
|---|---|---|
| j29 | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Aggregating consistent endgame knowledge in Chinese Chess. Knowl.-Based Syst. 34: 34-42 (2012) | |
| c49 | Chia-Tung Kuo, Da-Wei Wang, Tsan-sheng Hsu: A Simple Efficient Technique to Adjust Time Step Size in a Stochastic Discrete Time Agent-based Simulation. SIMULTECH 2012: 42-48 | |
| c48 | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: A Probabilistic Hybrid Logic for Sanitized Information Systems. SUM 2012: 500-513 | |
| c47 | Tseng-Yi Chen, Tsung Tai Yeh, Hsin-Wen Wei, Yu-Xun Fang, Wei-Kuan Shih, Tsan-sheng Hsu: CacheRAID: An Efficient Adaptive Write Cache Policy to Conserve RAID Disk Array Energy. UCC 2012: 117-124 | |
| e2 | Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee (Eds.): Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, isbn 978-3-642-35260-7 | |
| 2011 | ||
| c46 | Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu: Game Tree Search with Adaptive Resolution. ACG 2011: 306-319 | |
| 2010 | ||
| j28 | Yen-Chiu Chen, Hsin-Wen Wei, Pei-Chi Huang, Wei-Kuan Shih, Tsan-sheng Hsu: The bridge-connectivity augmentation problem with a partition constraint. Theor. Comput. Sci. 411(31-33): 2878-2889 (2010) | |
| j27 | Justin Zhan, Chia-Lung Hsieh, I-Cheng Wang, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: Privacy-Preserving Collaborative Recommender Systems. IEEE Transactions on Systems, Man, and Cybernetics, Part C 40(4): 472-476 (2010) | |
| c45 | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Knowledge Abstraction in Chinese Chess Endgame Databases. Computers and Games 2010: 176-187 | |
| c44 | Meng-Tsung Tsai, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Heterogeneous Subset Sampling. COCOON 2010: 500-509 | |
| 2009 | ||
| j26 | Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu: Smallest Bipartite Bridge-Connectivity Augmentation. Algorithmica 54(3): 353-378 (2009) | |
| j25 | I-Cheng Wang, Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: Toward Empirical Aspects of Secure Scalar Product. IEEE Transactions on Systems, Man, and Cybernetics, Part C 39(4): 440-447 (2009) | |
| c43 | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Conflict Resolution of Chinese Chess Endgame Knowledge Base. ACG 2009: 146-157 | |
| c42 | I-Cheng Wang, Chih-Hao Shen, Kung Chen, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: An Empirical Study on Privacy and Secure Multi-party Computation Using Exponentiation. CSE (3) 2009: 182-188 | |
| c41 | Bo-Nian Chen, Jian-Yu Chen, Jr-Chang Chen, Tsan-sheng Hsu, Pangfeng Liu, Shun-chin Hsu: An Intelligent Tutoring System of Chinese Chess. IEA/AIE 2009: 350-359 | |
| c40 | Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu: Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). ISAAC 2009: 1195-1204 | |
| 2008 | ||
| c39 | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Knowledge Inferencing on Chinese Chess Endgames. Computers and Games 2008: 180-191 | |
| c38 | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: Logical Definability in Social Position Analysis. GrC 2008: 35-38 | |
| c37 | Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: Scalar-product based Secure Two-party Computation. GrC 2008: 556-561 | |
| c36 | Justin Zhan, I-Cheng Wang, Chia-Lung Hsieh, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: Towards Efficient Privacy-preserving Collaborative Recommender Systems. GrC 2008: 778-783 | |
| 2007 | ||
| j24 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: An epistemic framework for privacy protection in database linking. Data Knowl. Eng. 61(1): 176-205 (2007) | |
| j23 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Granulation as a Privacy Protection Mechanism. T. Rough Sets 7: 256-273 (2007) | |
| c35 | Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu: Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract). AAIM 2007: 153-166 | |
| 2006 | ||
| j22 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: The Hamiltonian problem on distance-hereditary graphs. Discrete Applied Mathematics 154(3): 508-524 (2006) | |
| j21 | Cho-chin Lin, Da-Wei Wang, Tsan-sheng Hsu: Bounds on the Client-Server Incremental Computing. IEICE Transactions 89-A(5): 1198-1206 (2006) | |
| j20 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu, Jeremy K.-P. Chen: Value versus damage of information release: A data privacy perspective. Int. J. Approx. Reasoning 43(2): 179-201 (2006) | |
| c34 | Kuang-che Wu, Shun-chin Hsu, Tsan-sheng Hsu: The Graph-History Interaction Problem in Chinese Chess. ACG 2006: 165-179 | |
| c33 | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Abstracting Knowledge from Annotated Chinese-Chess Game Records. Computers and Games 2006: 100-111 | |
| c32 | Da-Wei Wang, Churn-Jung Liau, Yi-Ting Chiang, Tsan-sheng Hsu: Information Theoretical Analysis of Two-Party Secret Computation. DBSec 2006: 310-317 | |
| c31 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Attribute-oriented Granulation for Privacy Protection. GrC 2006: 726-731 | |
| c30 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: A GrC-Based Approach to Social Network Data Protection. RSCTC 2006: 438-447 | |
| e1 | H. Jaap van den Herik, Shun-chin Hsu, Tsan-sheng Hsu, H. H. L. M. Donkers (Eds.): Advances in Computer Games, 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-9, 2005. Revised Papers. Lecture Notes in Computer Science 4250, Springer 2006, isbn 3-540-48887-1 | |
| 2005 | ||
| j19 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005) | |
| j18 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. SIAM J. Discrete Math. 19(2): 345-362 (2005) | |
| c29 | Yi-Ting Chiang, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Secrecy of Two-Party Secure Computation. DBSec 2005: 114-123 | |
| 2004 | ||
| j17 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Medical privacy protection based on granular computing. Artificial Intelligence in Medicine 32(2): 137-149 (2004) | |
| j16 | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Checking Indefinitely in Chinese Chess Endgames. ICGA Journal 27(1): 19-37 (2004) | |
| c28 | Ping-hsun Wu, Ping-Yi Liu, Tsan-sheng Hsu: An External-Memory Retrograde Analysis Algorithm. Computers and Games 2004: 145-160 | |
| c27 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu, Jeremy K.-P. Chen: On The Damage and Compensation of Privacy Leakage. DBSec 2004: 311-324 | |
| c26 | Cho-chin Lin, Tsan-sheng Hsu, Da-Wei Wang: Bounds on the Client-Server Incremental Computing. ISPAN 2004: 86-91 | |
| 2003 | ||
| j15 | Yu-Cheng Chiang, Tsan-sheng Hsu, Sun Kuo, Churn-Jung Liau, Da-Wei Wang: Preserving confidentiality when sharing medical database with the Cellsecu system. I. J. Medical Informatics 71(1): 17-23 (2003) | |
| c25 | Yaw-Ling Lin, Tsan-sheng Hsu: Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. ISAAC 2003: 339-351 | |
| 2002 | ||
| j14 | ||
| j13 | ||
| j12 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discrete Math. 15(4): 488-518 (2002) | |
| c24 | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Indefinite Sequence of Moves in Chinese Chess Endgames. Computers and Games 2002: 264-279 | |
| c23 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 | |
| c22 | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang, Jeremy K.-P. Chen: Quantifying Privacy Leakage through Answering Database Queries. ISC 2002: 162-176 | |
| c21 | Yi-Ting Chiang, Yu-Cheng Chiang, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: How Much Privacy? - A System to Safe Guard Personal Privacy while Releasing Databases. Rough Sets and Current Trends in Computing 2002: 226-233 | |
| 2001 | ||
| c20 | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: A Logical Model for Privacy Protection. ISC 2001: 110-124 | |
| i1 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. CoRR cs.DS/0102009 (2001) | |
| 2000 | ||
| j11 | Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu: Graph Searching on Some Subclasses of Chordal Graphs. Algorithmica 27(3): 395-426 (2000) | |
| j10 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. J. Algorithms 35(1): 50-81 (2000) | |
| j9 | ||
| j8 | Tsan-sheng Hsu, Joseph C. Lee, Dian Rae Lopez, William A. Royce: Task Allocation on a Network of Processors. IEEE Trans. Computers 49(12): 1339-1353 (2000) | |
| j7 | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and node searching problems on trees. Theor. Comput. Sci. 240(2): 429-446 (2000) | |
| j6 | Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan: A multi-tree routing scheme using acyclic orientations. Theor. Comput. Sci. 240(2): 487-494 (2000) | |
| c19 | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Construction of Chinese Chess Endgame Databases by Retrograde Analysis. Computers and Games 2000: 96-114 | |
| c18 | ||
| 1999 | ||
| j5 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Efficient Parallel Algorithms on Distance Hereditary Graphs. Parallel Processing Letters 9(1): 43-52 (1999) | |
| 1998 | ||
| j4 | Tsan-sheng Hsu, Ming-Yang Kao: A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. J. Comb. Optim. 2(3): 237-256 (1998) | |
| c17 | Tsan-sheng Hsu, Dian Rae Lopez: Executing Divisible Jobs on a Network with a Fixed Number of Processors. COCOON 1998: 241-250 | |
| c16 | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. COCOON 1998: 279-288 | |
| c15 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. IRREGULAR 1998: 298-309 | |
| c14 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 | |
| 1997 | ||
| j3 | Lisa Hollermann, Tsan-sheng Hsu, Dian Rae Lopez, Keith Vertanen: Scheduling Problems in a Practical Allocation Model. J. Comb. Optim. 1(2): 129-149 (1997) | |
| c13 | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and Node Searching Problems on Trees. COCOON 1997: 284-293 | |
| c12 | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko: . Efficient Parallel Algorithms on Distance-Hereditary Graphs. ICPP 1997: 20- | |
| c11 | Tsan-sheng Hsu, Ming-Yang Kao: Security Problems for Statistical Databases with General Cell Suppressions. SSDBM 1997: 155-164 | |
| 1996 | ||
| j2 | Tsan-sheng Hsu, Vijaya Ramachandran: Efficient Massively Parallel Implementation of some Combinatorial Algorithms. Theor. Comput. Sci. 162(2): 297-322 (1996) | |
| c10 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30 | |
| c9 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. COCOON 1996: 169-178 | |
| c8 | Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang: Graph Searching on Chordal Graphs. ISAAC 1996: 156-165 | |
| c7 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). ISAAC 1996: 213-222 | |
| c6 | Tsan-sheng Hsu, Dian Rae Lopez: Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract). ISAAC 1996: 397-406 | |
| 1995 | ||
| c5 | Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean: Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995: 106-112 | |
| c4 | Tsan-sheng Hsu: Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation. ISAAC 1995: 274-283 | |
| 1993 | ||
| j1 | Tsan-sheng Hsu, Vijaya Ramachandran: Finding a Smallest Augmentation to Biconnect a Graph. SIAM J. Comput. 22(5): 889-912 (1993) | |
| 1992 | ||
| c3 | ||
| 1991 | ||
| c2 | Tsan-sheng Hsu, Vijaya Ramachandran: A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract). FOCS 1991: 548-559 | |
| c1 | Tsan-sheng Hsu, Vijaya Ramachandran: On Finding a Smallest Augmentation to Biconnect a Graph. ISA 1991: 326-335 | |
Colors in the list of coauthors
Last update Sun May 19 23:14:19 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page