Tat-hung Chan

According to our database, Tat-hung Chan authored at least 10 papers between 1980 and 1991.

Collaborative distances:

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

1991

Computing average path lengths of binary search trees.

Tat-hung Chan

ACM SIGCSE Bull., 1991

1990

Nondecreasing subsequences of t-sequences.

Tat-hung Chan

Discret. Math., 1990

1988

Pushdown Automata with Reversal-Bounded Counters.

Tat-hung Chan

J. Comput. Syst. Sci., 1988

The Boundedness Problem for Three-Dimensional Vector Addition Systems with States.

Tat-hung Chan

Inf. Process. Lett., 1988

1987

On Two-Way Weak Counter Machines.

Tat-hung Chan

Math. Syst. Theory, 1987

1983

On the Finite-Valuedness Problem for Sequential Machines.

Tat-hung Chan, Oscar H. Ibarra

Theor. Comput. Sci., 1983

On the Space and Time Complexity of Functions Computable by Simple Programs.

Tat-hung Chan, Oscar H. Ibarra

SIAM J. Comput., 1983

1981

Deciding Freeness for Program Schemes with a Single Unary Function.

Tat-hung Chan

Inf. Process. Lett., 1981

Reversal Complexity of Counter Machines

Tat-hung Chan

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Reversal-Bounded Computations.

Tat-hung Chan

PhD thesis, 1980