Grammar-Oriented Enumeration of Binary Trees. - Limin Xiang; Changjie Tang; Kazuo Ushijima (Comput. J., 1997)

ANSV Problem on BSRs. - Limin Xiang; Kazuo Ushijima (Inf. Process. Lett., 1998)

Discovering Tendency Association between Objects with Relaxed Periodicity and its Application in Seismology. - Changjie Tang; Rynson W. H. Lau; Huabei Yin; Qing Li 001; Lu Yang; Zhonghua Yu; Limin Xiang; Tianqing Zhang (ICSC, 1999)

Rearranging Scattered Information on BSR. - Limin Xiang; Kazuo Ushijima (Inf. Process. Lett., 1999)

A Theorem on the Relation Between BSRk and BSR+. - Limin Xiang; Kazuo Ushijima (Inf. Process. Lett., 1999)

Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its i-p Sequence. - Limin Xiang (Parallel Process. Lett., 1999)

An Efficient Implementation for the BROADCAST Instruction of BSR+. - Limin Xiang; Kazuo Ushijima; Selim G. Akl; Ivan Stojmenovic (IEEE Trans. Parallel Distributed Syst., 1999)

Optimal Parallel Merging Algorithms on BSR. - Limin Xiang; Kazuo Ushijima (ISPAN, 2000)

Generating Regular k-ary Trees Efficiently. - Limin Xiang; Kazuo Ushijima; Selim G. Akl (Comput. J., 2000)

Efficient loopless generation of Gray codes for k-ary trees. - Limin Xiang; Kazuo Ushijima; Changjie Tang (Inf. Process. Lett., 2000)

On O(1) Time Algorithms for Combinatorial Generation. - Limin Xiang; Kazuo Ushijima (Comput. J., 2001)

On generating k-ary trees in computer representation. - Limin Xiang; Kazuo Ushijima; Changjie Tang (Inf. Process. Lett., 2001)

On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR. - Limin Xiang; Kazuo Ushijima (IEEE Trans. Parallel Distributed Syst., 2001)

Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. - Limin Xiang; Kazuo Ushijima; Yuichi Asahiro (ITCC, 2002)

O(1) Time Algorithm on BSR for Computing Convex Hull. - Limin Xiang; Kazuo Ushijima (IASTED PDCS, 2002)

Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR. - Limin Xiang; Kazuo Ushijima; Jianjun Zhao 001 (Parallel Process. Lett., 2002)

O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies. - Limin Xiang; Kazuo Ushijima; Kai Cheng; Jianjun Zhao 001; Cunwei Lu (PDCAT, 2004)

A Web-Based Classroom Environment for Enhanced Residential College Education. - Kai Cheng; Limin Xiang; Toyohiko Hirota; Kazuo Ushijima (ICWL, 2005)

Encoding a Binary Search Tree in Constant Time on BSR. - Limin Xiang; Kai Cheng; Kazuo Ushijima (PDCAT, 2005)

Time-Decaying Bloom Filters for Data Streams with Skewed Distributions. - Kai Cheng; Limin Xiang; Mizuho Iwaihara; Haiyan Xu; Mukesh K. Mohania (RIDE, 2005)

Sequence Analysis in Constant Time on BSR. - Limin Xiang; Kai Cheng; Kazuo Ushijima (PDCAT, 2006)

A formal proof of the four color theorem - Limin Xiang (CoRR, 2009)

Efficient Generation of Gray Codes for Reflectable Languages. - Limin Xiang; Kai Cheng; Kazuo Ushijima (ICCSA (4), 2010)