- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| c10 |      | Limin Xiang, Kai Cheng, Kazuo Ushijima: Efficient Generation of Gray Codes for Reflectable Languages. ICCSA (4) 2010: 418-426 |
| 2009 | ||
| i1 | | |
| 2006 | ||
| c9 | | Limin Xiang, Kai Cheng, Kazuo Ushijima: Sequence Analysis in Constant Time on BSR. PDCAT 2006: 431-436 |
| 2005 | ||
| c8 | | Kai Cheng, Limin Xiang, Toyohiko Hirota, Kazuo Ushijima: A Web-Based Classroom Environment for Enhanced Residential College Education. ICWL 2005: 56-65 |
| c7 | | Limin Xiang, Kai Cheng, Kazuo Ushijima: Encoding a Binary Search Tree in Constant Time on BSR. PDCAT 2005: 740-744 |
| c6 | | Kai Cheng, Limin Xiang, Mizuho Iwaihara, Haiyan Xu, Mukesh K. Mohania: Time-Decaying Bloom Filters for Data Streams with Skewed Distributions. RIDE 2005: 63-69 |
| 2004 | ||
| c5 | | Limin Xiang, Kazuo Ushijima, Kai Cheng, Jianjun Zhao, Cunwei Lu: O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies. PDCAT 2004: 218-225 |
| 2002 | ||
| j12 | | Limin Xiang, Kazuo Ushijima, Jianjun Zhao: Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR. Parallel Processing Letters 12(3-4): 365-374 (2002) |
| c4 | | Limin Xiang, Kazuo Ushijima, Yuichi Asahiro: Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. ITCC 2002: 396-403 |
| c3 |  | Limin Xiang, Kazuo Ushijima: O(1) Time Algorithm on BSR for Computing Convex Hull. IASTED PDCS 2002: 143-143 |
| 2001 | ||
| j11 | | Limin Xiang, Kazuo Ushijima: On O(1) Time Algorithms for Combinatorial Generation. Comput. J. 44(4): 292-302 (2001) |
| j10 | | Limin Xiang, Kazuo Ushijima, Changjie Tang: On generating k-ary trees in computer representation. Inf. Process. Lett. 77(5-6): 231-238 (2001) |
| j9 | | Limin Xiang, Kazuo Ushijima: On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR. IEEE Trans. Parallel Distrib. Syst. 12(9): 912-921 (2001) |
| 2000 | ||
| j8 | | Limin Xiang, Kazuo Ushijima, Selim G. Akl: Generating Regular k-ary Trees Efficiently. Comput. J. 43(4): 290-300 (2000) |
| j7 | | Limin Xiang, Kazuo Ushijima, Changjie Tang: Efficient loopless generation of Gray codes for k-ary trees. Inf. Process. Lett. 76(4-6): 169-174 (2000) |
| c2 | | |
| 1999 | ||
| j6 | | Limin Xiang, Kazuo Ushijima: Rearranging Scattered Information on BSR. Inf. Process. Lett. 71(1): 43-47 (1999) |
| j5 | | Limin Xiang, Kazuo Ushijima: A Theorem on the Relation Between BSRk and BSR+. Inf. Process. Lett. 71(2): 71-73 (1999) |
| j4 | | Limin Xiang: Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its i-p Sequence. Parallel Processing Letters 9(1): 103-110 (1999) |
| j3 | | Limin Xiang, Kazuo Ushijima, Selim G. Akl, Ivan Stojmenovic: An Efficient Implementation for the BROADCAST Instruction of BSR+. IEEE Trans. Parallel Distrib. Syst. 10(8): 852-863 (1999) |
| c1 | | Changjie Tang, Rynson W. H. Lau, Huabei Yin, Qing Li, Lu Yang, Zhonghua Yu, Limin Xiang, Tianqing Zhang: Discovering Tendency Association between Objects with Relaxed Periodicity and its Application in Seismology. ICSC 1999: 51-62 |
| 1998 | ||
| j2 | | |
| 1997 | ||
| j1 | | Limin Xiang, Changjie Tang, Kazuo Ushijima: Grammar-Oriented Enumeration of Binary Trees. Comput. J. 40(5): 278-291 (1997) |
Data released under the ODC-BY 1.0 license — See also our legal information page