Limin Xiang

发表

An Efficient Implementation for the BROADCAST Instruction of BSR+

Ivan Stojmenovic, Selim G. Akl, Kazuo Ushijima, 1999, IEEE Trans. Parallel Distributed Syst..

Rearranging Scattered Information on BSR

Kazuo Ushijima, Limin Xiang, 1999, Inf. Process. Lett..

Optimal parallel merging algorithms on BSR

Kazuo Ushijima, Limin Xiang, 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

Generating Regular k-ary Trees Efficiently

Selim G. Akl, Kazuo Ushijima, Limin Xiang, 2000, Comput. J..

A formal proof of the four color theorem pdf

Limin Xiang, 2009, ArXiv.

A Web-Based Classroom Environment for Enhanced Residential College Education

Kai Cheng, Toyohiko Hirota, Kazuo Ushijima, 2005, ICWL.

O(1) time algorithm on BSR for constructing a random binary search tree

Changjie Tang, Jianjun Zhao, Tianqing Zhang, 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

Encoding a Binary Search Tree in Constant Time on BSR

Kai Cheng, Kazuo Ushijima, Limin Xiang, 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

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

Rynson W. H. Lau, Changjie Tang, Qing Li, 1999, ICSC.

Sequence Analysis in Constant Time on BSR

Kai Cheng, Kazuo Ushijima, Limin Xiang, 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

Efficient loopless generation of Gray codes for k-ary trees

Changjie Tang, Kazuo Ushijima, Limin Xiang, 2000, Inf. Process. Lett..

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

Limin Xiang, 1999, Parallel Process. Lett..

Efficient Web Profiling by Time-Decaying Bloom Filters

Kai Cheng, Limin Xiang, Mizuho Iwahara, 2005 .

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

Kazuo Ushijima, Limin Xiang, 2001, IEEE Trans. Parallel Distributed Syst..

Grammar-Oriented Enumeration of Binary Trees

Changjie Tang, Kazuo Ushijima, Limin Xiang, 1997, Comput. J..

A Theorem on the Relation Between BSRk and BSR+

Kazuo Ushijima, Limin Xiang, 1999, Inf. Process. Lett..

Coding k-ary trees for efficient loopless generation in lexicographic order

Yuichi Asahiro, Kazuo Ushijima, Limin Xiang, 2002, Proceedings. International Conference on Information Technology: Coding and Computing.

Time-decaying Bloom Filters for data streams with skewed distributions

Mukesh K. Mohania, Mizuho Iwaihara, Kai Cheng, 2005, 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA'05).

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

Cunwei Lu, Jianjun Zhao, Kai Cheng, 2004, PDCAT.

On generating k-ary trees in computer representation

Changjie Tang, Kazuo Ushijima, Limin Xiang, 2001, Inf. Process. Lett..

Grammar-Orientad Enumeration of Arbitrary Trees and Arbitrary k-ary Trees

Kazuo Ushijima, Limin Xiang, 1999 .

Optimal Parallel Merging Algorithms on BSR

Kazuo Ushijima, Limin Xiang, 2000, ISPAN.

Architectural Slicing to Support System Evolution

Jianjun Zhao, Limin Xiang, 2005 .

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

Jianjun Zhao, Kazuo Ushijima, Limin Xiang, 2002, Parallel Process. Lett..