default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLimin Xiang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c10]Limin Xiang, Kai Cheng, Kazuo Ushijima:
Efficient Generation of Gray Codes for Reflectable Languages. ICCSA (4) 2010: 418-426
2000 – 2009
- 2009
- [i1]Limin Xiang:
A formal proof of the four color theorem. CoRR abs/0905.3713 (2009) - 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 Process. Lett. 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 Distributed 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]Limin Xiang, Kazuo Ushijima:
Optimal Parallel Merging Algorithms on BSR. ISPAN 2000: 12-17
1990 – 1999
- 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 Process. Lett. 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 Distributed 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]Limin Xiang, Kazuo Ushijima:
ANSV Problem on BSRs. Inf. Process. Lett. 65(3): 135-138 (1998) - 1997
- [j1]Limin Xiang, Changjie Tang, Kazuo Ushijima:
Grammar-Oriented Enumeration of Binary Trees. Comput. J. 40(5): 278-291 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
