Search the dblp DataBase
Tat-hung Chan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tat-hung Chan
Reversal Complexity of Counter Machines [Citation Graph (0, 0)][DBLP]
STOC, 1981, pp:146-157 [Conf] - Tat-hung Chan
Deciding Freeness for Program Schemes with a Single Unary Function. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1981, v:13, n:3, pp:98-102 [Journal] - Tat-hung Chan
The Boundedness Problem for Three-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1988, v:26, n:6, pp:287-289 [Journal] - Tat-hung Chan
Pushdown Automata with Reversal-Bounded Counters. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1988, v:37, n:3, pp:269-291 [Journal] - Tat-hung Chan
On Two-Way Weak Counter Machines. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1987, v:20, n:1, pp:31-41 [Journal] - Tat-hung Chan, Oscar H. Ibarra
On the Space and Time Complexity of Functions Computable by Simple Programs. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1983, v:12, n:4, pp:708-716 [Journal] - Tat-hung Chan, Oscar H. Ibarra
On the Finite-Valuedness Problem for Sequential Machines. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1983, v:23, n:, pp:95-101 [Journal] - Tat-hung Chan
Nondecreasing subsequences of t-sequences. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:79, n:2, pp:215-218 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002