Ying Teh Tsai

According to our database, Ying Teh Tsai authored at least 3 papers between 1993 and 1998.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1998

An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems.

Ying Teh Tsai, Chuan Yi Tang

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1995

Randomized algorithms for the on-line minimum matching problem on euclidean space.

Ying Teh Tsai, Chuan Yi Tang, Yunn Yen Chen

Int. J. Comput. Math., 1995

1993

The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems.

Ying Teh Tsai, Chuan Yi Tang

Inf. Process. Lett., 1993