default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHo-Leung Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j22]Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam
:
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. Theory Comput. Syst. 56(1): 82-95 (2015)- 2013
- [j21]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with an Arbitrary Power Function. ACM Trans. Algorithms 9(2): 18:1-18:14 (2013) - [c31]Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Rongbin Li, Chi-Man Liu:
Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time. CATS 2013: 11-20 - [c30]Ho-Leung Chan:
Aspectual Coercion in Non-native Speakers of English. CogSci 2013 - 2012
- [j20]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. Algorithmica 62(3-4): 1088-1111 (2012) - [j19]Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and complexity for periodic real-time scheduling. ACM Trans. Algorithms 9(1): 6:1-6:19 (2012) - [j18]Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee:
A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) - [j17]Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory Comput. 8(1): 209-229 (2012) - [c29]Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Online Flow Time Scheduling in the Presence of Preemption Overhead. APPROX-RANDOM 2012: 85-97 - [c28]Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu:
Non-clairvoyant weighted flow time scheduling with rejection penalty. SPAA 2012: 246-254 - 2011
- [j16]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011) - [j15]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011) - [j14]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011) - [j13]Hing-Fung Ting, Lap-Kei Lee, Ho-Leung Chan, Tak Wah Lam:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. Algorithms 4(3): 200-222 (2011) - [j12]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
A linear size index for approximate pattern matching. J. Discrete Algorithms 9(4): 358-364 (2011) - [j11]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011) - [j10]Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Tradeoff between energy and throughput for online deadline scheduling. Sustain. Comput. Informatics Syst. 1(3): 189-195 (2011) - [c27]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. ISAAC 2011: 564-573 - [c26]Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Energy-Efficient Due Date Scheduling. TAPAS 2011: 69-80 - [c25]Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam:
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. WAOA 2011: 137-149 - [i4]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. CoRR abs/1111.5386 (2011) - 2010
- [j9]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
Compressed Indexes for Approximate String Matching. Algorithmica 58(2): 263-281 (2010) - [c24]Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359 - [c23]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. STACS 2010: 179-190 - [c22]Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Tradeoff between Energy and Throughput for Online Deadline Scheduling. WAOA 2010: 59-70 - [i3]Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters:
The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010)
2000 – 2009
- 2009
- [j8]Ho-Leung Chan, Joseph Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong:
Optimizing throughput and energy in online deadline scheduling. ACM Trans. Algorithms 6(1): 10:1-10:22 (2009) - [j7]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009) - [c21]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. ICALP (1) 2009: 144-155 - [c20]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with an arbitrary power function. SODA 2009: 693-701 - [c19]Nikhil Bansal, Ho-Leung Chan:
Weighted flow time does not admit O(1)-competitive algorithms. SODA 2009: 1238-1244 - [c18]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10 - [c17]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. STACS 2009: 255-264 - [c16]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. WAOA 2009: 49-61 - [i2]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. CoRR abs/0902.1260 (2009) - [i1]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. CoRR abs/0912.4569 (2009) - 2008
- [j6]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Prudence W. H. Wong, Siu-Ming Yiu:
Non-overlapping Common Substrings Allowing Mutations. Math. Comput. Sci. 1(4): 543-555 (2008) - [j5]Ho-Leung Chan, Tak Wah Lam, Kin-Shing Liu:
Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling. SIAM J. Comput. 37(5): 1595-1612 (2008) - [c15]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with a Solar Cell. AAIM 2008: 15-26 - [c14]Nikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee:
Scheduling for Speed Bounded Processors. ICALP (1) 2008: 409-420 - [c13]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. LATIN 2008: 240-251 - 2007
- [b1]Ho-Leung Chan:
New algorithms for on-line scheduling. University of Hong Kong, 2007 - [j4]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane:
Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3(2): 21 (2007) - [c12]Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong:
Efficiency of Data Distribution in BitTorrent-Like Systems. AAIM 2007: 378-388 - [c11]Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 - [c10]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39 - [c9]Ho-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong:
Energy efficient online deadline scheduling. SODA 2007: 795-804 - 2006
- [j3]Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. J. Bioinform. Comput. Biol. 4(4): 807-832 (2006) - [c8]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
A Linear Size Index for Approximate Pattern Matching. CPM 2006: 49-59 - [c7]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
Compressed Indexes for Approximate String Matching. ESA 2006: 208-219 - [c6]Ho-Leung Chan, Tak Wah Lam, Kin-Shing Liu:
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. SODA 2006: 334-343 - 2005
- [j2]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Prudence W. H. Wong, Siu-Ming Yiu, X. Fan:
The mutated subsequence problem and locating conserved genes. Bioinform. 21(10): 2271-2278 (2005) - [j1]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To:
Nonmigratory Online Deadline Scheduling on Multiprocessors. SIAM J. Comput. 34(3): 669-682 (2005) - [c5]Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS 2005: 224-235 - [c4]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane:
Dynamic dictionary matching and compressed suffix trees. SODA 2005: 13-22 - 2004
- [c3]Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Prudence W. H. Wong, Siu-Ming Yiu:
A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species. BIBE 2004: 545-552 - [c2]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam:
Compressed Index for a Dynamic Collection of Texts. CPM 2004: 445-456 - [c1]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To:
Non-migratory online deadline scheduling on multiprocessors. SODA 2004: 970-979
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-08-05 20:24 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:
