#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1977

2017

- This year (10)
- Last 5 years (46)
- Last 10 years (74)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
- Parallel Algorithms
- 1994

- Tsan-sheng Hsu, Vijaya Ramachandran
- ISA
- 1991

We consider the problem of nding a minimum number of edges whose addition biconnects an undirected graph. This problem has been studied by several other researchers, two of whom presented a linearâ€¦ (More)

- Justin Zhijun Zhan, Chia-Lung Hsieh, I-Cheng Wang, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang
- IEEE Transactions on Systems, Man, andâ€¦
- 2010

Collaborative recommender systems use various types of information to help customers find products of personalized interest. To increase the usefulness of collaborative recommender systems in certainâ€¦ (More)

- Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
- Theor. Comput. Sci.
- 2000

We propose a mathematical model for fault-tolerant routing based on acyclic orientations, or acorns, of the underlying network G = (V; E). The acorn routing model applies routing tables that storeâ€¦ (More)

- Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko
- ICPP
- 1997

In this papel; we present eficient parallel algorithms forjinding a minimum weighted connected dominating set, a minimum weighted Steiner tree for a distance-hereditary graph which take O(1og n) timeâ€¦ (More)

- Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang
- ISC
- 2001

- Tsan-sheng Hsu
- J. Algorithms
- 2000

We consider the problem of finding a smallest set of edges whose addition four-connects a triconnected graph. This is a fundamental graph-theoretic problem that has applications in designing reliableâ€¦ (More)

- Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang
- COCOON
- 1997

In this paper we consider the edge searching and node searching problems on trees Given a tree we show a transformation from an optimal node search strategy to an optimal edge search strategy Usingâ€¦ (More)

We consider the problem of nding a smallest set of edges whose addition triconnects an undirected graph. This is a fundamental graph-theoretic problem that has applications in designing reliableâ€¦ (More)

- I-Cheng Wang, Chih-Hao Shen, Justin Zhijun Zhan, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang
- IEEE Transactions on Systems, Man, andâ€¦
- 2008

There is a fair amount of research about privacy, but few empirical studies about its cost have been conducted. In the area of secure multiparty computation, the scalar product has long been reckonedâ€¦ (More)