Reversal-Bounded Computations. - Tat-hung Chan (1980)

Reversal Complexity of Counter Machines - Tat-hung Chan (STOC, 1981)

Deciding Freeness for Program Schemes with a Single Unary Function. - Tat-hung Chan (Inf. Process. Lett., 1981)

On the Space and Time Complexity of Functions Computable by Simple Programs. - Tat-hung Chan; Oscar H. Ibarra (SIAM J. Comput., 1983)

On the Finite-Valuedness Problem for Sequential Machines. - Tat-hung Chan; Oscar H. Ibarra (Theor. Comput. Sci., 1983)

On Two-Way Weak Counter Machines. - Tat-hung Chan (Math. Syst. Theory, 1987)

The Boundedness Problem for Three-Dimensional Vector Addition Systems with States. - Tat-hung Chan (Inf. Process. Lett., 1988)

Pushdown Automata with Reversal-Bounded Counters. - Tat-hung Chan (J. Comput. Syst. Sci., 1988)

Nondecreasing subsequences of t-sequences. - Tat-hung Chan (Discret. Math., 1990)

Computing average path lengths of binary search trees. - Tat-hung Chan (ACM SIGCSE Bull., 1991)