default search action
Mee Yee Chan
2020 – today
- 2022
- [c7]Wu Zhang, Tung Yeung Lam, Mee Yee Chan:
Using Translation Memory to Improve Neural Machine Translations. ICDLT 2022: 49-54
2010 – 2019
- 2016
- [r1]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Haplotype Inference on Pedigrees Without Recombinations. Encyclopedia of Algorithms 2016: 894-897
2000 – 2009
- 2009
- [j17]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput. 38(6): 2179-2197 (2009) - 2006
- [j16]Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang:
Construction of the nearest neighbor embracing graph of a point set. J. Comb. Optim. 11(4): 435-443 (2006) - 2004
- [c6]Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang:
Construction of the Nearest Neighbor Embracing Graph of a Point Set. SWAT 2004: 150-160 - 2003
- [c5]Francis Y. L. Chin, Ngai Lam Ho, Tak Wah Lam, Prudence W. H. Wong, Mee Yee Chan:
Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. CSB 2003: 337-346
1990 – 1999
- 1996
- [j15]Mee Yee Chan, Francis Y. L. Chin, Chris Chu, Wei-Kei Mak:
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. J. Parallel Distributed Comput. 33(1): 98-106 (1996) - 1993
- [j14]Mee Yee Chan, Francis Y. L. Chin:
Schedulers for Larger Classes of Pinwheel Instances. Algorithmica 9(5): 425-462 (1993) - [j13]Mee Yee Chan, Shiang-Jen Lee:
Fault-Tolerant Permutation Routing in Hypercubes. J. Parallel Distributed Comput. 17(4): 277-281 (1993) - [j12]Mee Yee Chan, Shiang-Jen Lee:
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes. IEEE Trans. Parallel Distributed Syst. 4(3): 277-288 (1993) - [j11]Mee Yee Chan, Francis Y. L. Chin:
Optimal Resilient Distributed Algorithms for Ring Election. IEEE Trans. Parallel Distributed Syst. 4(4): 475-480 (1993) - [j10]Mee Yee Chan, Francis Y. L. Chin:
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. IEEE Trans. Parallel Distributed Syst. 4(8): 933-946 (1993) - [c4]Mee Yee Chan, Francis Y. L. Chin, Chris Chu, Wai-Kei Mak:
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. SPDP 1993: 285-289 - 1992
- [j9]Mee Yee Chan, Francis Y. L. Chin:
General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction. IEEE Trans. Computers 41(6): 755-768 (1992) - 1991
- [j8]Mee Yee Chan, Shiang-Jen Lee:
Distributed Fault-Tolerant Embeddings of Rings in Hypercubes. J. Parallel Distributed Comput. 11(1): 63-71 (1991) - [j7]Mee Yee Chan:
Embedding of Grids into Optimal Hypercubes. SIAM J. Comput. 20(5): 834-864 (1991) - [j6]Mee Yee Chan, Shiang-Jen Lee:
On the Existence of Hamiltonian Circuits in Faulty Hypercubes. SIAM J. Discret. Math. 4(4): 511-527 (1991) - [c3]Mee Yee Chan, Francis Y. L. Chin, Chung Keung Poon:
Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. ISA 1991: 241-250 - 1990
- [c2]Mee Yee Chan, Shiang-Jen Lee:
Subcube Recognition, Allocation/Deallocation and Relocation in Hypercubes. SPDP 1990: 87-93
1980 – 1989
- 1988
- [j5]Mee Yee Chan, Francis Y. L. Chin:
Distributed Election in Complete Networks. Distributed Comput. 3(1): 19-22 (1988) - [j4]Mee Yee Chan, Francis Y. L. Chin:
On Embedding Rectangular Grids in Hypercubes. IEEE Trans. Computers 37(10): 1285-1288 (1988) - 1987
- [b1]Mee Yee Chan:
Efficient and resilient distributed algorithms for comparisonproblems. University of Hong Kong, 1987 - [c1]Mee Yee Chan, Francis Y. L. Chin:
Optimal Resilient Ring Election Algorithms. WDAG 1987: 345-354 - 1985
- [j3]Mee Yee Chan:
A Note on Redundant Disk Modulo Allocation. Inf. Process. Lett. 20(3): 121-123 (1985) - 1984
- [j2]Mee Yee Chan:
Multidisk File Design: An Analysis of Folding Buckets to Disks. BIT 24(3): 261-268 (1984) - [j1]Mee Yee Chan, Siu-Yuen Yam:
A program testing assistant for BASIC-PLUS. ACM SIGSOFT Softw. Eng. Notes 9(2): 89-103 (1984)
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.
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.
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.
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 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint