Limin Xiang

According to our database, Limin Xiang authored at least 23 papers between 1997 and 2010.

Collaborative distances:

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

2010

Efficient Generation of Gray Codes for Reflectable Languages.

Limin Xiang, Kai Cheng, Kazuo Ushijima

Proceedings of the Computational Science and Its Applications, 2010

2009

A formal proof of the four color theorem

Limin Xiang

CoRR, 2009

2006

Sequence Analysis in Constant Time on BSR.

Limin Xiang, Kai Cheng, Kazuo Ushijima

Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

2005

Time-Decaying Bloom Filters for Data Streams with Skewed Distributions.

Kai Cheng, Limin Xiang, Mizuho Iwaihara, Haiyan Xu, Mukesh K. Mohania

Proceedings of the 15th International Workshop on Research Issues in Data Engineering (RIDE-SDMA 2005), 2005

Encoding a Binary Search Tree in Constant Time on BSR.

Limin Xiang, Kai Cheng, Kazuo Ushijima

Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

A Web-Based Classroom Environment for Enhanced Residential College Education.

Kai Cheng, Limin Xiang, Toyohiko Hirota, Kazuo Ushijima

Proceedings of the Advances in Web-Based Learning - ICWL 2005, 4th International Conference, Hong Kong, China, July 31, 2005

2004

O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies.

Limin Xiang, Kazuo Ushijima, Kai Cheng, Jianjun Zhao, Cunwei Lu

Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

2002

Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR.

Limin Xiang, Kazuo Ushijima, Jianjun Zhao

Parallel Process. Lett., 2002

O(1) Time Algorithm on BSR for Computing Convex Hull.

Limin Xiang, Kazuo Ushijima

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.

Limin Xiang, Kazuo Ushijima, Yuichi Asahiro

Proceedings of the 2002 International Symposium on Information Technology (ITCC 2002), 2002

2001

On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR.

Limin Xiang, Kazuo Ushijima

IEEE Trans. Parallel Distributed Syst., 2001

On generating k-ary trees in computer representation.

Limin Xiang, Kazuo Ushijima, Changjie Tang

Inf. Process. Lett., 2001

On O(1) Time Algorithms for Combinatorial Generation.

Limin Xiang, Kazuo Ushijima

Comput. J., 2001

2000

Efficient loopless generation of Gray codes for k-ary trees.

Limin Xiang, Kazuo Ushijima, Changjie Tang

Inf. Process. Lett., 2000

Generating Regular k-ary Trees Efficiently.

Limin Xiang, Kazuo Ushijima, Selim G. Akl

Comput. J., 2000

Optimal Parallel Merging Algorithms on BSR.

Limin Xiang, Kazuo Ushijima

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

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

Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its <i>i-p</i> Sequence.

Limin Xiang

Parallel Process. Lett., 1999

A Theorem on the Relation Between BSR_k and BSR⁺.

Limin Xiang, Kazuo Ushijima

Inf. Process. Lett., 1999

Rearranging Scattered Information on BSR.

Limin Xiang, Kazuo Ushijima

Inf. Process. Lett., 1999

Discovering Tendency Association between Objects with Relaxed Periodicity and its Application in Seismology.

Changjie Tang, Rynson W. H. Lau, Huabei Yin, Qing Li, Lu Yang, Zhonghua Yu, Limin Xiang, Tianqing Zhang

Proceedings of the Internet Applications, 5th International Computer Science Conference, 1999

1998

ANSV Problem on BSRs.

Limin Xiang, Kazuo Ushijima

Inf. Process. Lett., 1998

1997

Grammar-Oriented Enumeration of Binary Trees.

Limin Xiang, Changjie Tang, Kazuo Ushijima

Comput. J., 1997