Tony T. Lee

Paths and cycles of hypergraphs

Jianfang Wang, Jian-fang Wang, Tony T. Lee, 1999 .

An information-theoretic characterization of Markov random fields and its applications

Raymond W. Yeung, Zhongxing Ye, Tony T. Lee, 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

A DFS Algorithm for Maximum Matchings in General Graphs

Tony T. Lee, Bojun Lu, Hanli Chu, 2022, Natural Language Processing, Information Retrieval and AI.

Randomized $\Delta$-Edge-Coloring via Quaternion of Complex Colors

Tony T. Lee, Hao Guan, Yujie Wan, 2011, ArXiv.

A state space approach to the finite automata

Tony T. Lee, Tony T. Lee, 1983, International Journal of Computer & Information Sciences.

M/G/1/N Queue with Vacation Time and Limited Service Discipline

Tony T. Lee, Tony T. Lee, 1989, Perform. Evaluation.

Information-theoretic characterizations of conditional mutual independence and Markov random fields

Raymond W. Yeung, Zhongxing Ye, Tony T. Lee, 2002, IEEE Trans. Inf. Theory.

Solvability of Cubic Graphs - From Four Color Theorem to NP-Complete

Qingqi Shi, Tony T. Lee, Tony T. Lee, 2013, 1306.2725.

Randomized Δ-edge colouring via exchanges of complex colours

Hao Guan, Tony T. Lee, Yujie Wan, 2013, Int. J. Comput. Math..

A pr 2 01 1 Randomized ∆-Edge-Coloring via Quaternion of Complex Colors ( Extended Abstract ) pdf

Hao Guan, Tony T. Lee, Yujie Wan, 2011 .

M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline

Tony T. Lee, Tony T. Lee, 1984, Oper. Res..