![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Limin Xiang Kai Cheng , Limin Xiang, Toyohiko Hirota , Kazuo Ushijima : A Web-Based Classroom Environment for Enhanced Residential College Education. ICWL 2005 : 56-65 Limin Xiang, Kai Cheng , Kazuo Ushijima : Encoding a Binary Search Tree in Constant Time on BSR. PDCAT 2005 : 740-744 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 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 Limin Xiang, Kazuo Ushijima , Yuichi Asahiro : Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. ITCC 2002 : 396-403 Limin Xiang, Kazuo Ushijima : O(1) Time Algorithm on BSR for Computing Convex Hull. PDCS 2002 : 143-143 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) Limin Xiang, Kazuo Ushijima : On O(1) Time Algorithms for Combinatorial Generation. Comput. J. 44 (4): 292-302 (2001) 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) Limin Xiang, Kazuo Ushijima , Changjie Tang : On generating k-ary trees in computer representation. Inf. Process. Lett. 77 (5-6): 231-238 (2001) Limin Xiang, Kazuo Ushijima : Optimal Parallel Merging Algorithms on BSR. ISPAN 2000 : 12-17 Limin Xiang, Kazuo Ushijima , Selim G. Akl : Generating Regular k-ary Trees Efficiently. Comput. J. 43 (4): 290-300 (2000) 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) 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 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) Limin Xiang, Kazuo Ushijima : Rearranging Scattered Information on BSR. Inf. Process. Lett. 71 (1): 43-47 (1999) Limin Xiang, Kazuo Ushijima : A Theorem on the Relation Between BSR k and BSR + . Inf. Process. Lett. 71 (2): 71-73 (1999) 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) Limin Xiang, Kazuo Ushijima : ANSV Problem on BSRs. Inf. Process. Lett. 65 (3): 135-138 (1998) Limin Xiang, Changjie Tang , Kazuo Ushijima : Grammar-Oriented Enumeration of Binary Trees. Comput. J. 40 (5): 278-291 (1997) 1 [ 6 ] [ 9 ] 2 [ 16 ] 3 [ 17 ] [ 18 ] [ 19 ] [ 20 ] 4 [ 20 ] 5 [ 18 ] 6 [ 7 ] 7 [ 7 ] 8 [ 17 ] 9 [ 18 ] 10 [ 6 ] 11 [ 1 ] [ 7 ] [ 8 ] [ 11 ] 12 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 19 ] [ 20 ] 13 [ 18 ] 14 [ 7 ] 15 [ 7 ] 16 [ 7 ] 17 [ 7 ] 18 [ 14 ] [ 17 ] ![]() ©2006 Association for Computing Machinery |