2024
2023
GOSPA-Driven Gaussian Bernoulli Sensor Management (Conference Paper)
Jones, G., García-Fernández, Á. F., & Wong, P. W. H. (2023). GOSPA-Driven Gaussian Bernoulli Sensor Management. In 2023 26th International Conference on Information Fusion (FUSION). IEEE. doi:10.23919/fusion52260.2023.10224220DOI: 10.23919/fusion52260.2023.10224220
Hong, X., Guan, S. -U., Xue, N., Li, Z., Man, K. L., Wong, P. W. H., & Liu, D. (2023). Dual-Track Lifelong Machine Learning-Based Fine-Grained Product Quality Analysis. APPLIED SCIENCES-BASEL, 13(3). doi:10.3390/app13031241DOI: 10.3390/app13031241
Onokpasa, E., Wild, S., & Wong, P. W. H. (2023). RNA secondary structures: from ab initio prediction to better compression, and back. In 2023 DATA COMPRESSION CONFERENCE, DCC (pp. 278-287). doi:10.1109/DCC55655.2023.00036DOI: 10.1109/DCC55655.2023.00036
Liu, A. H. -H., Liu, F. -H., Wong, P. W. H., & Zhang, X. -O. (2023). The Power of Amortization on Scheduling with Explorable Uncertainty. In Unknown Conference (pp. 90-103). Springer Nature Switzerland. doi:10.1007/978-3-031-49815-2_7DOI: 10.1007/978-3-031-49815-2_7
2021
Liu, F. -H., Liu, H. -H., & Wong, P. W. H. (n.d.). Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. Theory of Computing Systems. doi:10.1007/s00224-021-10037-wDOI: 10.1007/s00224-021-10037-w
2020
Carroll, T. C., Ojiaku, J. -T., & Wong, P. W. H. (2020). Semiglobal Sequence Alignment with Gaps Using GPU. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 17(6), 2086-2097. doi:10.1109/TCBB.2019.2914105DOI: 10.1109/TCBB.2019.2914105
Arribas, E., Anta, A. F., Kowalski, D. R., Mancuso, V., Mosteiro, M. A., Widmer, J., & Wong, P. W. H. (2020). Optimizing mmWave Wireless Backhaul Scheduling. IEEE TRANSACTIONS ON MOBILE COMPUTING, 19(10), 2409-2428. doi:10.1109/TMC.2019.2924884DOI: 10.1109/TMC.2019.2924884
Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning (Journal article)
Li, Y., Masiliune, A., Winstone, D., Gasieniec, L., Wong, P., Lin, H., . . . Hadley, A. (n.d.). Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning. Biology of Blood and Marrow Transplantation. doi:10.1016/j.bbmt.2020.03.026DOI: 10.1016/j.bbmt.2020.03.026
Hong, X., Guan, S. -U., Man, K. L., & Wong, P. W. H. (2020). Lifelong Machine Learning Architecture for Classification. SYMMETRY-BASEL, 12(5). doi:10.3390/sym12050852DOI: 10.3390/sym12050852
Liu, F. -H., Liu, H. -H., & Wong, P. W. (2020). Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. In Proceedings of the Workshop on Approximation and Online Algorithms (WAOA 2019).
2019
Erlebach, T., Liu, F. -H., Liu, H. -H., Shalom, M., Wong, P. W. H., & Zaks, S. (2019). Complexity and online algorithms for minimum skyline coloring of intervals. Theoretical Computer Science, 788, 66-78. doi:10.1016/j.tcs.2019.05.007DOI: 10.1016/j.tcs.2019.05.007
Klonowski, M., Kowalski, D. R., Mirek, J., & Wong, P. W. H. (2019). Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. In 2019 IEEE 18TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA) (pp. 295-298). doi:10.1109/nca.2019.8935017DOI: 10.1109/nca.2019.8935017
Shalom, M., Wong, P. W., & Zaks, S. (2019). Profit Maximization in Flex-Grid All-Optical Networks. Theory of Computing Systems.
Kowalski, D. R., Mirek, J. D., & Wong, P. W. H. (2019). Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel. Lecture Notes in Computer Science. Retrieved from http://arxiv.org/abs/1710.07380v3
Hong, X., Pal, G., Guan, S. -U., Wong, P., Liu, D., Man, K. L., & Huang, X. (2019). Semi-Unsupervised Lifelong Learning for Sentiment Classification: Less Manual Data Annotation and More Self-Studying. Proceedings of the 2019 3rd High Performance Computing and Cluster Technologies Conference. Retrieved from http://arxiv.org/abs/1905.01988v2
Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (2019). Testing Methods to Minimise Range-shifting Time with Conservation Actions. In ICBBT 2019: 2019 11TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL TECHNOLOGY (pp. 32-39). doi:10.1145/3340074.3340076DOI: 10.1145/3340074.3340076
Halper, A., Mosteiro, M. A., Rossikova, Y., & Wong, P. W. (2019). Station Assignment with Reallocation. Algorithmica: an international journal in computer science, 81(3), 1096-1125. doi:10.1007/s00453-018-0459-9DOI: 10.1007/s00453-018-0459-9
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. (Conference Paper)
Klonowski, M., Kowalski, D. R., Mirek, J., & Wong, P. W. H. (2019). Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel.. In L. A. Gasieniec, J. Jansson, & C. Levcopoulos (Eds.), FCT Vol. 11651 (pp. 306-321). Springer. Retrieved from https://doi.org/10.1007/978-3-030-25027-0
2018
Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (2018). Estimating Invasion Time in Real Landscapes. In ICCBB 2018: PROCEEDINGS OF THE 2018 2ND INTERNATIONAL CONFERENCE ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS (pp. 55-62). doi:10.1145/3290818.3290825DOI: 10.1145/3290818.3290825
Fernandez Anta, A., Kowalski, D. R., Mosteiro, M. A., & Wong, P. W. H. (2018). Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees. ACM TRANSACTIONS ON PARALLEL COMPUTING, 5(2). doi:10.1145/3291529DOI: 10.1145/3291529
Dynamic Programming Optimization in Line of Sight Networks (Journal article)
Sangha, P., Wong, P., & Zito, M. (2020). Dynamic Programming Optimization in Line of Sight Networks. Information and Computation, 270. doi:10.1016/j.ic.2019.104460
Sangha, P., Wong, P. W. H., & Zito, M. (n.d.). Dynamic Programming Optimization in Line of Sight Networks. Retrieved from http://arxiv.org/abs/1806.01581v1
Li, C. Y., Popa, A., Wong, P. W. H., & Yung, F. C. C. (2018). Hardness and approximation of the asynchronous border minimization problem. Discrete Applied Mathematics, 235, 101-117. doi:10.1016/j.dam.2017.08.025DOI: 10.1016/j.dam.2017.08.025
2017
Sangha, P., Wong, P. W., & Zito, M. (2017). Independent Sets in Restricted Line of Sight Networks. In The 13th International Symposium on Algorithms and Experiments for Wireless Networks Vol. 10718 (pp. 211-222). doi:10.1007/978-3-319-72751-6_16DOI: 10.1007/978-3-319-72751-6_16
Kowalski., Wong, P. W., & Zavou, E. (2017). Fault Tolerant Scheduling of Tasks of Two Sizes under Resource Augmentation. Journal of Scheduling, 20(6), 695-711. doi:10.1007/s10951-017-0541-1DOI: 10.1007/s10951-017-0541-1
Wong, P. W., & Liu, H. (2017). Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. In The 11th International Conference of Combinatorial Optimization and Applications (COCOA).
Mertzios, G. B., Shalom, M., Wong, P. W. H., & Zaks, S. (2017). Online Regenerator Placement. Theory of Computing Systems, 61(3), 739-754. doi:10.1007/s00224-016-9711-3DOI: 10.1007/s00224-016-9711-3
Abdulazeez, M., Garncarek, P., & Wong, P. W. H. (2017). Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds. In 2017 26th International Conference on Computer Communication and Networks (ICCCN). IEEE. doi:10.1109/icccn.2017.8038506DOI: 10.1109/icccn.2017.8038506
Wong, P. W., & Carroll, T. (2017). An Improved Abstract GPU Model with Data Transfer. In Workshop on Heterogeneous and Unconventional Cluster Architectures and Applications (HUCAA). doi:10.1109/ICPPW.2017.28DOI: 10.1109/ICPPW.2017.28
Aloqalaa, D. A., Hodgson, J. A., & Wong, P. W. H. (2017). The impact of landscape sparsification on modelling and analysis of the invasion process. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 75. doi:10.4230/LIPIcs.SEA.2017.32DOI: 10.4230/LIPIcs.SEA.2017.32
Wong, P. W., & Liu, H. (2017). Complexity and Online Algorithms for a Coloring Problem on a Line. In The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP).
Abdulazeez, M., Garncarek, P., Kowalski, D. R., & Wong, P. W. H. (2017). Lightweight Robust Framework for Workload Scheduling in Clouds. In 2017 IEEE 1ST INTERNATIONAL CONFERENCE ON EDGE COMPUTING (IEEE EDGE) (pp. 206-209). doi:10.1109/IEEE.EDGE.2017.36DOI: 10.1109/IEEE.EDGE.2017.36
2016
Optimal nonpreemptive scheduling in a smart grid model (Conference Paper)
Liu, F. H., Liu, H. H., & Wong, P. W. H. (2016). Optimal nonpreemptive scheduling in a smart grid model. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 64 (pp. 53.1-53.13). doi:10.4230/LIPIcs.ISAAC.2016.53DOI: 10.4230/LIPIcs.ISAAC.2016.53
Burcea, M., Hon, W. -K., Liu, H. -H., Wong, P. W. H., & Yau, D. K. Y. (2016). Scheduling for electricity cost in a smart grid. Journal of Scheduling, 19(6), 687-699. doi:10.1007/s10951-015-0447-8DOI: 10.1007/s10951-015-0447-8
Novel numerical and computational techniques for remote sensor based monitoring of freshwater quality (Conference Paper)
Zhu, X., Yue, Y., Wong, P., Zhang, Y., & Meng, J. (2016). Novel numerical and computational techniques for remote sensor based monitoring of freshwater quality. In 2016 IEEE INTERNATIONAL CONFERENCE OF ONLINE ANALYSIS AND COMPUTING SCIENCE (ICOACS) (pp. 91-95). Retrieved from https://www.webofscience.com/
Liu, F. -H., Liu, H. -H., & Wong, P. W. H. (2016). Non-preemptive Scheduling in a Smart Grid Model and its Implications on Machine Minimization. Retrieved from http://arxiv.org/abs/1602.06659v3
On-line maximum matching in complete multi-partite graphs with an application to optical networks (Journal article)
Shalom, M., Wong, P. W. H., & Zaks, S. (2016). On-line maximum matching in complete multi-partite graphs with an application to optical networks. DISCRETE APPLIED MATHEMATICS, 199, 123-136. doi:10.1016/j.dam.2014.10.040DOI: 10.1016/j.dam.2014.10.040
Routing in Geometric Networks (Chapter)
Durocher, S., Gasieniec, L., & Wong, P. W. H. (2016). Routing in Geometric Networks. In Encyclopedia of Algorithms (pp. 1871-1875). Springer New York. doi:10.1007/978-1-4939-2864-4_352DOI: 10.1007/978-1-4939-2864-4_352
2015
Pairwise Sequence Alignment with Gaps with GPU (Conference Paper)
Carroll, T. C., Ojiaku, J. -T., & Wong, P. W. H. (2015). Pairwise Sequence Alignment with Gaps with GPU. In 2015 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING - CLUSTER 2015 (pp. 603-610). doi:10.1109/CLUSTER.2015.109DOI: 10.1109/CLUSTER.2015.109
Fundamentals of Computation Theory Preface (Journal article)
Gasieniec, L., Martin, R., Wolter, F., & Wong, P. W. H. (2015). Fundamentals of Computation Theory Preface. THEORETICAL COMPUTER SCIENCE, 590, 1. doi:10.1016/j.tcs.2015.05.040DOI: 10.1016/j.tcs.2015.05.040
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines (Journal article)
Bell, P. C., & Wong, P. W. H. (2015). Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. JOURNAL OF COMBINATORIAL OPTIMIZATION, 29(4), 739-749. doi:10.1007/s10878-013-9618-8DOI: 10.1007/s10878-013-9618-8
Optimizing Busy Time on Parallel Machines (Journal article)
Mertzios, G. B., Shalom, M., Voloshin, A., Wong, P. W. H., & Zaks, S. (2015). Optimizing Busy Time on Parallel Machines. Theoretical Computer Science, 562, 524-541. doi:10.1016/j.tcs.2014.10.033DOI: 10.1016/j.tcs.2014.10.033
Fault Tolerant Scheduling of Non-uniform Tasks under Resource Augmentation (Conference Paper)
Kowalski, D., Wong, P., & Zavou, E. (2015). Fault Tolerant Scheduling of Non-uniform Tasks under Resource Augmentation. In The 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP).
Online Nonpreemptive Scheduling for Electricity Cost in Smart Grid (Conference Paper)
Hon, W. -K., Liu, H. -H., & Wong, P. (2015). Online Nonpreemptive Scheduling for Electricity Cost in Smart Grid. In The 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP).
Halper, A., Mosteiro, M. A., Rossikova, Y., & Wong, P. W. H. (n.d.). Station Assignment with Reallocation. Retrieved from http://arxiv.org/abs/1803.01276v1
2014
Online Optimization of Busy Time on Parallel Machines (Journal article)
Shalom, M., Voloshin, A., Wong, P., Yung, F. C. C., & Zaks, S. (2014). Online Optimization of Busy Time on Parallel Machines. Theoretical Computer Science, 560(Part 2), 190-206. doi:10.1016/j.tcs.2014.07.017DOI: 10.1016/j.tcs.2014.07.017
Alshukri, A., Coenen, F., Li, Y., Redfern, A., & Wong, P. W. H. (2014). A Framework for Brand Reputation Mining and Visualisation. In AI 2014 (pp. 12 pages). Cambridge, UK: Springer.
2013
Sibthorp, C., Wu, H., Cowley, G., Wong, P. W. H., Palaima, P., Morozov, I. Y., . . . Caddick, M. X. (2013). Transcriptome analysis of the filamentous fungus Aspergillus nidulans directed to the global identification of promoters.. BMC genomics, 14, 847. doi:10.1186/1471-2164-14-847DOI: 10.1186/1471-2164-14-847
Profit Maximization in Flex-Grid All-Optical Networks (Conference Paper)
Shalom, M., Wong, P. W. H., & Zaks, S. (2013). Profit Maximization in Flex-Grid All-Optical Networks. In Unknown Conference (pp. 249-260). Springer International Publishing. doi:10.1007/978-3-319-03578-9_21DOI: 10.1007/978-3-319-03578-9_21
Scheduling for Electricity Cost in Smart Grid (Conference Paper)
Burcea, M., Hon, W. -K., Liu, H. -H., Wong, P. W. H., & Yau, D. K. Y. (2013). Scheduling for Electricity Cost in Smart Grid. In Unknown Conference (pp. 306-317). Springer International Publishing. doi:10.1007/978-3-319-03780-6_27DOI: 10.1007/978-3-319-03780-6_27
Improving Power-Conversion Efficiency via a Hybrid MPPT Approach for Photovoltaic Systems (Journal article)
Ma, J., Man, K. L., Ting, T. O., Zhang, N., Guan, S. U., Wong, P. W. H., . . . Lei, C. U. (2013). Improving Power-Conversion Efficiency via a Hybrid MPPT Approach for Photovoltaic Systems. ELEKTRONIKA IR ELEKTROTECHNIKA, 19(7), 57-60. doi:10.5755/j01.eee.19.7.5163DOI: 10.5755/j01.eee.19.7.5163
Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items (Conference Paper)
Burcea, M., Wong, P. W. H., & Yung, F. C. C. (2013). Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items. In Unknown Conference (pp. 85-96). Springer Berlin Heidelberg. doi:10.1007/978-3-642-38233-8_8DOI: 10.1007/978-3-642-38233-8_8
Parameter Estimation of Photovoltaic Models via Cuckoo Search (Journal article)
Ma, J., Ting, T. O., Man, K. L., Zhang, N., Guan, S. -U., & Wong, P. W. H. (2013). Parameter Estimation of Photovoltaic Models via Cuckoo Search. Journal of Applied Mathematics, 2013, 1-8. doi:10.1155/2013/362619DOI: 10.1155/2013/362619
Online Regenerator Placement (Conference Paper)
Mertzios, G. B., Shalom, M., Wong, P. W. H., & Zaks, S. (2011). Online Regenerator Placement. In PRINCIPLES OF DISTRIBUTED SYSTEMS Vol. 7109 (pp. 4-+). Retrieved from https://www.webofscience.com/
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Journal article)
Yu, S., & Wong, P. W. H. (2013). Online scheduling of simple linear deteriorating jobs to minimize the total general completion time. THEORETICAL COMPUTER SCIENCE, 487, 95-102. doi:10.1016/j.tcs.2013.02.024DOI: 10.1016/j.tcs.2013.02.024
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy (Journal article)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2013). Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. ALGORITHMICA, 65(3), 605-633. doi:10.1007/s00453-012-9613-yDOI: 10.1007/s00453-012-9613-y
Finding DNA Regulatory Motifs with Position-dependent Models (Journal article)
Wu, H., Wong, P. W. H., Caddick, M. X., & Sibthorp, C. (2013). Finding DNA Regulatory Motifs with Position-dependent Models. Journal of Medical and Bioengineering, 2(2), 103-109. doi:10.12720/jomb.2.2.103-109DOI: 10.12720/jomb.2.2.103-109
Improved Results on Online Dynamic Bin Packing (Conference Paper)
Burcea, M., Wong, P. W. H., & Yung, F. C. C. (2013). Improved Results on Online Dynamic Bin Packing. In The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP). Pont à Mousson.
Station Assignment with Applications to Sensing (Conference Paper)
Fernández Anta, A., Kowalski, D. R., Mosteiro, M. A., & Wong, P. W. H. (2014). Station Assignment with Applications to Sensing. In Unknown Conference (pp. 155-169). Springer Berlin Heidelberg. doi:10.1007/978-3-642-45346-5_12DOI: 10.1007/978-3-642-45346-5_12
2012
Insight of Direct Search Methods and Module-Integrated Algorithms for Maximum Power Point Tracking (MPPT) of Stand-Alone Photovoltaic Systems (Conference Paper)
Ma, J., Man, K. L., Ting, T. O., Lee, H., Jeong, T., Sean, J. -K., . . . Wong, P. W. H. (2012). Insight of Direct Search Methods and Module-Integrated Algorithms for Maximum Power Point Tracking (MPPT) of Stand-Alone Photovoltaic Systems. In Unknown Conference (pp. 463-471). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35606-3_55DOI: 10.1007/978-3-642-35606-3_55
Maximum Power Point Tracking (MPPT) via Weightless Swarm Algorithm (WSA) on cloudy days (Conference Paper)
Ting, T. O., Man, K. L., Guan, S. -U., Seon, J. K., Jeong, T. T., & Wong, P. W. H. (2012). Maximum Power Point Tracking (MPPT) via Weightless Swarm Algorithm (WSA) on cloudy days. In 2012 IEEE Asia Pacific Conference on Circuits and Systems. IEEE. doi:10.1109/apccas.2012.6419040DOI: 10.1109/apccas.2012.6419040
Optimizing Busy Time on Parallel Machines (Conference Paper)
Mertzios, G. B., Shalom, M., Voloshin, A., Wong, P. W. H., & Zaks, S. (2012). Optimizing Busy Time on Parallel Machines. In 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS) (pp. 238-248). doi:10.1109/IPDPS.2012.31DOI: 10.1109/IPDPS.2012.31
Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines (Conference Paper)
Yu, S., Ojiaku, J. -T., Wong, P. W. H., & Xu, Y. (2012). Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines. In Unknown Conference (pp. 260-272). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29952-0_28DOI: 10.1007/978-3-642-29952-0_28
Online Optimization of Busy Time on Parallel Machines (Conference Paper)
Shalom, M., Voloshin, A., Wong, P. W. H., Yung, F. C. C., & Zaks, S. (2012). Online Optimization of Busy Time on Parallel Machines. In Unknown Conference (pp. 448-460). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29952-0_43DOI: 10.1007/978-3-642-29952-0_43
Improved multi-processor scheduling for flow time and energy (Journal article)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2012). Improved multi-processor scheduling for flow time and energy. JOURNAL OF SCHEDULING, 15(1), 105-116. doi:10.1007/s10951-009-0145-5DOI: 10.1007/s10951-009-0145-5
A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time" (Journal article)
Yu, S., & Wong, P. W. H. (2012). A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time". INFORMATION PROCESSING LETTERS, 112(1-2), 55-58. doi:10.1016/j.ipl.2011.09.014DOI: 10.1016/j.ipl.2011.09.014
An 8/3 Lower Bound for Online Dynamic Bin Packing (Conference Paper)
Wong, P. W. H., Yung, F. C. C., & Burcea, M. (2012). An 8/3 Lower Bound for Online Dynamic Bin Packing. In ALGORITHMS AND COMPUTATION, ISAAC 2012 Vol. 7676 (pp. 44-53). Retrieved from https://www.webofscience.com/
Design and Realization of a Smart Battery Management System (Conference Paper)
Chen, C., Man, K. L., Ting, T. O., Lei, C. -U., Krilavicius, T., Jeong, T. T., . . . Wong, P. W. H. (2012). Design and Realization of a Smart Battery Management System. In INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II (pp. 1173-1176). Retrieved from https://www.webofscience.com/
2011
New Structural and Functional Contexts of the Dx[DN]xDG Linear Motif: Insights into Evolution of Calcium-Binding Proteins (Journal article)
Rigden, D. J., Woodhead, D. D., Wong, P. W. H., & Galperin, M. Y. (2011). New Structural and Functional Contexts of the Dx[DN]xDG Linear Motif: Insights into Evolution of Calcium-Binding Proteins. PLOS ONE, 6(6). doi:10.1371/journal.pone.0021507DOI: 10.1371/journal.pone.0021507
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines (Conference Paper)
Bell, P. C., & Wong, P. W. H. (2011). Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. In THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011 Vol. 6648 (pp. 27-36). Retrieved from https://www.webofscience.com/
Online Scheduling of Linear Deteriorating Jobs on Parallel Machines (Conference Paper)
Yu, S., Wong, P. W. H., & Xu, Y. (2011). Online Scheduling of Linear Deteriorating Jobs on Parallel Machines. In The 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP). Nymburk, Czech Republic.
2010
Popa, A., Wong, P. W. H., & Yung, F. C. C. (2010). Hardness and Approximation of The Asynchronous Border Minimization Problem. Retrieved from http://arxiv.org/abs/1011.1202v1
Deadline scheduling and power management for speed bounded processors (Journal article)
Han, X., Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2010). Deadline scheduling and power management for speed bounded processors. THEORETICAL COMPUTER SCIENCE, 411(40-42), 3587-3600. doi:10.1016/j.tcs.2010.05.035DOI: 10.1016/j.tcs.2010.05.035
Optimal on-line colorings for minimizing the number of ADMs in optical networks (Journal article)
Shalom, M., Wong, P. W. H., & Zaks, S. (2010). Optimal on-line colorings for minimizing the number of ADMs in optical networks. Journal of Discrete Algorithms, 8(2), 174-188. doi:10.1016/j.jda.2009.02.006DOI: 10.1016/j.jda.2009.02.006
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Conference Paper)
Shalom, M., Wong, P. W. H., & Zaks, S. (2010). On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY Vol. 5869 (pp. 281-+). Retrieved from https://www.webofscience.com/
Experimental Analysis of Speed Scaling Algorithms (Conference Paper)
Livesey, P., & Wong, P. W. H. (2010). Experimental Analysis of Speed Scaling Algorithms. In UG Research in Computer Science - Theory and Applications (pp. to appear). London.
2009
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing (Conference Paper)
Wong, P. W. H., & Yung, F. C. C. (2010). Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. In Unknown Conference (pp. 242-254). Springer Berlin Heidelberg. doi:10.1007/978-3-642-12450-1_22DOI: 10.1007/978-3-642-12450-1_22
Optimizing Throughput and Energy in Online Deadline Scheduling (Journal article)
Chan, H. -L., Chan, J. W. -T., Lam, T. -W., Lee, L. -K., Mak, K. -S., & Wong, P. W. H. (2009). Optimizing Throughput and Energy in Online Deadline Scheduling. ACM TRANSACTIONS ON ALGORITHMS, 6(1). doi:10.1145/1644015.1644025DOI: 10.1145/1644015.1644025
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy (Conference Paper)
Lam, T. -W., Lee, L. -K., Ting, H. -F., To, I. K. K., & Wong, P. W. H. (2009). Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT I Vol. 5555 (pp. 665-+). Retrieved from https://www.webofscience.com/
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis (Journal article)
Chan, J. W. -T., Wong, P. W. H., & Yung, F. C. C. (2009). On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. ALGORITHMICA, 53(2), 172-206. doi:10.1007/s00453-008-9185-zDOI: 10.1007/s00453-008-9185-z
Deadline Scheduling and Power Management for Speed Bounded Processors (Conference Paper)
Han, X., Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2009). Deadline Scheduling and Power Management for Speed Bounded Processors. In The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) (pp. 82-84). Kerkrade, The Netherlands.
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines (Conference Paper)
Bell, P. C., & Wong, P. W. H. (2009). Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. In The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) (pp. 44-46). Kerkrade, The Netherlands.
2008
Dynamic bin packing of unit fractions items (Journal article)
Chan, J. W. -T., Lam, T. -W., & Wong, P. W. H. (2008). Dynamic bin packing of unit fractions items. THEORETICAL COMPUTER SCIENCE, 409(3), 521-529. doi:10.1016/j.tcs.2008.09.028DOI: 10.1016/j.tcs.2008.09.028
Nonmigratory multiprocessor scheduling for response time and energy (Journal article)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2008). Nonmigratory multiprocessor scheduling for response time and energy. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 19(11), 1527-1539. doi:10.1109/TPDS.2008.115DOI: 10.1109/TPDS.2008.115
Improved on-line broadcast scheduling with deadlines (Journal article)
Fung, S. P. Y., Zheng, F., Chan, W. -T., Chin, F. Y. L., Poon, C. K., & Wong, P. W. H. (2008). Improved on-line broadcast scheduling with deadlines. JOURNAL OF SCHEDULING, 11(4), 299-308. doi:10.1007/s10951-007-0036-6DOI: 10.1007/s10951-007-0036-6
Competitive Non-migratory Scheduling for Flow Time and Energy (Conference Paper)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2008). Competitive Non-migratory Scheduling for Flow Time and Energy. In SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (pp. 256-+). Retrieved from https://www.webofscience.com/
Non-overlapping Common Substrings Allowing Mutations (Journal article)
Chan, H. L., Lam, T. W., Sung, W. K., Wong, P. W. H., & Yiu, S. M. (2008). Non-overlapping Common Substrings Allowing Mutations. Mathematics in Computer Science, 1(4), 543-555. doi:10.1007/s11786-007-0030-6DOI: 10.1007/s11786-007-0030-6
Approximating border length for DNA microarray synthesis (Conference Paper)
Li, C. Y., Wong, P. W. H., Xin, Q., & Yung, F. C. C. (2008). Approximating border length for DNA microarray synthesis. In THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS Vol. 4978 (pp. 410-+). Retrieved from https://www.webofscience.com/
Approximating border length for dna microarray synthesis (Conference Paper)
Li, C. Y., Wong, P. W. H., Xin, Q., & Yung, F. C. C. (2008). Approximating border length for dna microarray synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4978 LNCS (pp. 410-422). doi:10.1007/978-3-540-79228-4_36DOI: 10.1007/978-3-540-79228-4_36
Routing in Geometric Networks (Chapter)
Gąsieniec, L., Su, C., & Wong, P. (2008). Routing in Geometric Networks. In Encyclopedia of Algorithms (pp. 793-796). Springer US. doi:10.1007/978-0-387-30162-4_352DOI: 10.1007/978-0-387-30162-4_352
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count (Conference Paper)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2008). Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. In ALGORITHMS - ESA 2008 Vol. 5193 (pp. 647-+). Retrieved from https://www.webofscience.com/
Speed scaling functions for flow time scheduling based on active job count (Conference Paper)
Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2008). Speed scaling functions for flow time scheduling based on active job count. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 5193 LNCS (pp. 647-659). doi:10.1007/978-3-540-87744-8_54DOI: 10.1007/978-3-540-87744-8_54
2007
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Conference Paper)
Shalom, M., Wong, P. W. H., & Zaks, S. (2007). Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. In 2007 9th International Conference on Transparent Optical Networks. IEEE. doi:10.1109/icton.2007.4296030DOI: 10.1109/icton.2007.4296030
Randomized probe selection algorithm for microarray design (Journal article)
Gasieniec, L., Li, C. Y., Sant, P., & Wong, P. W. H. (2007). Randomized probe selection algorithm for microarray design. JOURNAL OF THEORETICAL BIOLOGY, 248(3), 512-521. doi:10.1016/j.jtbi.2007.05.036DOI: 10.1016/j.jtbi.2007.05.036
Routing of single-source and multiple-source queries in static sensor networks (Journal article)
Gąsieniec, L., Su, C., Wong, P. W. H., & Xin, Q. (2007). Routing of single-source and multiple-source queries in static sensor networks. Journal of Discrete Algorithms, 5(1), 1-11. doi:10.1016/j.jda.2006.03.012DOI: 10.1016/j.jda.2006.03.012
Allowing Mismatches in Anchors for Whole Genome Alignment (Journal article)
Yiu, S. M., Chan, P. Y., Lam, T. W., & Wong, P. R. W. H. (2007). Allowing Mismatches in Anchors for Whole Genome Alignment. WSEAS Transactions on Biology and Biomedicine, 1(4).
Bandwidth Minimization Algorithms (Conference Paper)
Fishkin, A. V., & Sitters, R. (2007). Bandwidth Minimization Algorithms. In The 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2007. Istanbul.
Efficiency of data distribution in BitTorrent-like systems (Conference Paper)
Chan, H. -L., Lam, T. -W., & Wong, P. W. H. (2007). Efficiency of data distribution in BitTorrent-like systems. In ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS Vol. 4508 (pp. 378-+). Retrieved from https://www.webofscience.com/
Energy Efficient Online Deadline Scheduling (Conference Paper)
Leung Chan, H., Tat Chan, W., Wah Lam, T., Kei Lee, L., Sum Mak, K., & W.H. Wong, P. (2007). Energy Efficient Online Deadline Scheduling. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. to appear). New Orleans, USA: ACM-SIAM.
Energy efficient deadline scheduling in two processor systems (Conference Paper)
Lam, T. -W., Lee, L. -K., To, I. K. K., & Wong, P. W. H. (2007). Energy efficient deadline scheduling in two processor systems. In ALGORITHMS AND COMPUTATION Vol. 4835 (pp. 476-+). Retrieved from https://www.webofscience.com/
Energy efficient online deadline scheduling (Conference Paper)
Chan, H. L., Chan, W. T., Lam, T. W., Lee, L. K., Mak, K. S., & Wong, P. W. H. (2007). Energy efficient online deadline scheduling. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Vol. 07-09-January-2007 (pp. 795-804).
Online deadline scheduling with bounded energy efficiency (Conference Paper)
Chan, J. W. -T., Lam, T. -W., Mak, K. -S., & Wong, P. W. H. (2007). Online deadline scheduling with bounded energy efficiency. In THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS Vol. 4484 (pp. 416-+). Retrieved from https://www.webofscience.com/
Optimal on-line colorings for minimizing the number of ADMs in optical networks (Conference Paper)
Shalom, M., Wong, P. W. H., & Zaks, S. (2007). Optimal on-line colorings for minimizing the number of ADMs in optical networks. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 4731 (pp. 435-+). Retrieved from https://www.webofscience.com/
2006
Efficient Probe Selection in Microarray Design (Conference Paper)
Gasieniec, L., Li, C. Y., Sant, P., & Wong, P. W. H. (2006). Efficient Probe Selection in Microarray Design. In 2006 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology. IEEE. doi:10.1109/cibcb.2006.331018DOI: 10.1109/cibcb.2006.331018
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling (Journal article)
Chan, W. -T., Lam, T. -W., Liu, K. -S., & Wong, P. W. H. (2006). New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. THEORETICAL COMPUTER SCIENCE, 359(1-3), 430-439. doi:10.1016/j.tcs.2006.06.003DOI: 10.1016/j.tcs.2006.06.003
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (Journal article)
Chan, W. T., Chin, F. Y. L., Zhang, Y., Zhu, H., Shen, H., & Wong, P. W. H. (2006). A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. JOURNAL OF COMBINATORIAL OPTIMIZATION, 11(2), 177-187. doi:10.1007/s10878-006-7128-7DOI: 10.1007/s10878-006-7128-7
Efficient probe selection in microarray design (Conference Paper)
Gasieniec, L., Li, C. Y., Sant, P., & Wong, P. W. H. (2006). Efficient probe selection in microarray design. In PROCEEDINGS OF THE 2006 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY (pp. 247-+). Retrieved from https://www.webofscience.com/
Improved on-line broadcast scheduling with deadlines (Conference Paper)
Zheng, F., Fung, S. P. Y., Chan, W. -T., Chin, F. Y. L., Poon, C. K., & Wong, P. W. H. (2006). Improved on-line broadcast scheduling with deadlines. In COMPUTING AND COMBINATORICS, PROCEEDINGS Vol. 4112 (pp. 320-329). Retrieved from https://www.webofscience.com/
On dynamic bin packing: An improved lower bound and resource augmentation analysis (Conference Paper)
Chan, W. -T., Wong, P. W. H., & Yung, F. C. C. (2006). On dynamic bin packing: An improved lower bound and resource augmentation analysis. In COMPUTING AND COMBINATORICS, PROCEEDINGS Vol. 4112 (pp. 309-319). Retrieved from https://www.webofscience.com/
2005
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks (Conference Paper)
Gasieniec, L., Chang Su., Wong, P. W. H., & Qin Xin. (n.d.). Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks. In 19th IEEE International Parallel and Distributed Processing Symposium. IEEE. doi:10.1109/ipdps.2005.384DOI: 10.1109/ipdps.2005.384
On-line stream merging with max span and min coverage (Journal article)
Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2005). On-line stream merging with max span and min coverage. THEORY OF COMPUTING SYSTEMS, 38(4), 461-479. doi:10.1007/s00224-004-1182-2DOI: 10.1007/s00224-004-1182-2
The mutated subsequence problem and locating conserved genes (Journal article)
Chan, H. L., Lam, T. W., Sung, W. K., Wong, P. W. H., Yiu, S. M., & Fan, X. (2005). The mutated subsequence problem and locating conserved genes. BIOINFORMATICS, 21(10), 2271-2278. doi:10.1093/bioinformatics/bti371DOI: 10.1093/bioinformatics/bti371
EFFICIENT CONSTRAINED MULTIPLE SEQUENCE ALIGNMENT WITH PERFORMANCE GUARANTEE (Journal article)
CHIN, F. Y. L., HO, N. L., LAM, T. W., & WONG, P. W. H. (2005). EFFICIENT CONSTRAINED MULTIPLE SEQUENCE ALIGNMENT WITH PERFORMANCE GUARANTEE. Journal of Bioinformatics and Computational Biology, 03(01), 1-18. doi:10.1142/s0219720005000977DOI: 10.1142/s0219720005000977
Efficient constrained multiple sequence alignment with performance guarantee. (Journal article)
Chin, F. Y. L., Ho, N. L., Lam, T. W., & Wong, P. W. H. (2005). Efficient constrained multiple sequence alignment with performance guarantee.. Journal of bioinformatics and computational biology, 3(1), 1-18. doi:10.1142/s0219720005000977DOI: 10.1142/s0219720005000977
Filtering of ineffective siRNAs and improved siRNA design tool (Journal article)
Yiu, S. M., Wong, P. W. H., Lam, T. W., Mui, Y. C., Kung, H. F., Lin, M., & Cheung, Y. T. (2005). Filtering of ineffective siRNAs and improved siRNA design tool. BIOINFORMATICS, 21(2), 144-151. doi:10.1093/bioinformatics/bth498DOI: 10.1093/bioinformatics/bth498
ALLOWING MISMATCHES IN ANCHORS FOR WHOLE GENOME ALIGNMENT: GENERATION AND EFFECTIVENESS (Conference Paper)
YIU, S. M., CHAN, P. Y., LAM, T. W., SUNG, W. K., TING, H. F., & WONG, P. W. H. (2005). ALLOWING MISMATCHES IN ANCHORS FOR WHOLE GENOME ALIGNMENT: GENERATION AND EFFECTIVENESS. In Proceedings of the 3rd Asia-Pacific Bioinformatics Conference. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO.. doi:10.1142/9781860947322_0001DOI: 10.1142/9781860947322_0001
Dynamic Bin Packing of Unit Fractions Items (Conference Paper)
Chan, W. -T., Lam, T. -W., & Wong, P. W. H. (2005). Dynamic Bin Packing of Unit Fractions Items. In Unknown Conference (pp. 614-626). Springer Berlin Heidelberg. doi:10.1007/11523468_50DOI: 10.1007/11523468_50
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling (Conference Paper)
Chan, W. T., Lam, T. W., Liu, K. S., & Wong, P. W. H. (2005). New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS Vol. 3618 (pp. 236-247). Retrieved from https://www.webofscience.com/
Off-line algorithms for minimizing total flow time in broadcast scheduling (Conference Paper)
Chan, W. T., Chin, F. Y. L., Zhang, Y., Zhu, H., Shen, H., & Wong, P. W. H. (2005). Off-line algorithms for minimizing total flow time in broadcast scheduling. In COMPUTING AND COMBINATORICS, PROCEEDINGS Vol. 3595 (pp. 318-328). Retrieved from https://www.webofscience.com/
2004
An efficient algorithm for optimizing whole genome alignment with noise (Journal article)
Wong, P. W. H., Lam, T. W., Lu, N., Ting, H. F., & Yiu, S. M. (2004). An efficient algorithm for optimizing whole genome alignment with noise. BIOINFORMATICS, 20(16), 2676-2684. doi:10.1093/bioinformatics/bth308DOI: 10.1093/bioinformatics/bth308
A mutation-sensitive approach for locating conserved gene pairs between related species (Conference Paper)
Chan, H. L., Lam, T. W., Sung, W. K., Wong, P. W. H., & Yiu, S. M. (2004). A mutation-sensitive approach for locating conserved gene pairs between related species. In BIBE 2004: FOURTH IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, PROCEEDINGS (pp. 545-552). doi:10.1109/BIBE.2004.1317390DOI: 10.1109/BIBE.2004.1317390
Aggressive Online Deadline Scheduling (Conference Paper)
Lam, T. -W., Ngan, T. -W. J., To, K. -K., & Wong, P. W. -H. (2004). Aggressive Online Deadline Scheduling. In Electronic Notes in Theoretical Computer Science Vol. 91 (pp. 148-157). Elsevier BV. doi:10.1016/j.entcs.2003.12.010DOI: 10.1016/j.entcs.2003.12.010
Filtering of Ineffective siRNAs and Improved siRNA Design Tool (Conference Paper)
Prudence, W. H. W., Siu-Ming, Y., Tak-Wah, L., Mui, Y. C., Kung, H. F., Lin, M., & Cheung, Y. T. (2004). Filtering of Ineffective siRNAs and Improved siRNA Design Tool. In Asia Pacific Bioinformatics Conference (APBC) (pp. 247-255). Dunedin, New Zealand: Australian Computer Society Inc.
New results on on-demand broadcasting with deadline via job scheduling with cancellation (Conference Paper)
Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2004). New results on on-demand broadcasting with deadline via job scheduling with cancellation. In COMPUTING AND COMBINATORICS, PROCEEDINGS Vol. 3106 (pp. 210-218). Retrieved from https://www.webofscience.com/
On-line windows scheduling of temporary items (Conference Paper)
Chan, W. T., & Wong, P. W. H. (2004). On-line windows scheduling of temporary items. In ALGORITHMS AND COMPUTATION Vol. 3341 (pp. 259-270). Retrieved from https://www.webofscience.com/
2003
Efficient Constrained Multiple Sequence Alignment with performance guarantee (Conference Paper)
Chin, F. Y. L., Ho, N. L., Lam, T. W., Wong, P. W. H., & Chan, M. Y. (2003). Efficient Constrained Multiple Sequence Alignment with performance guarantee. In PROCEEDINGS OF THE 2003 IEEE BIOINFORMATICS CONFERENCE (pp. 337-346). Retrieved from https://www.webofscience.com/
Efficient Algorithms for Optimizing Whole Genome Alignment with Noise (Conference Paper)
W.H. Wong, P., Lam, T. -W., Lu, N., Ting, H. -F., & Yiu, S. -M. (2003). Efficient Algorithms for Optimizing Whole Genome Alignment with Noise. In International Symposium of Algorithms and Computation (ISAAC) (pp. 362-374). Kyoto, Japan: Springer.
Efficient algorithms for optimizing whole genome alignment with noise (Journal article)
Lam, T. W., Lu, N., Ting, H. F., Wong, P. W. H., & Yiu, S. M. (2003). Efficient algorithms for optimizing whole genome alignment with noise. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 364-374. Retrieved from https://www.webofscience.com/
Efficient constrained multiple sequence alignment with performance guarantee (Conference Paper)
Francis YL Chin., Ho, N. L., Lam, T. W., Prudence WH Wong., & Chan, M. Y. (n.d.). Efficient constrained multiple sequence alignment with performance guarantee. In Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003. IEEE Comput. Soc. doi:10.1109/csb.2003.1227334DOI: 10.1109/csb.2003.1227334
On-line stream merging in a general setting (Journal article)
Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2003). On-line stream merging in a general setting. THEORETICAL COMPUTER SCIENCE, 296(1), 27-46. doi:10.1016/S0304-3975(02)00430-9DOI: 10.1016/S0304-3975(02)00430-9
On-line stream merging, max span, and min coverage (Conference Paper)
Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2003). On-line stream merging, max span, and min coverage. In ALGORITHMS AND COMPLEXITY, PROCEEDINGS Vol. 2653 (pp. 70-82). Retrieved from https://www.webofscience.com/
2002
A unified analysis of hot video schedulers (Conference Paper)
Chan, W. -T., Lam, T. -W., Ting, H. -F., & Wong, W. -H. (2002). A unified analysis of hot video schedulers. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM. doi:10.1145/509907.509937DOI: 10.1145/509907.509937
Competitive analysis of on-line stream merging algorithms (Conference Paper)
Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2002). Competitive analysis of on-line stream merging algorithms. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 Vol. 2420 (pp. 188-200). Retrieved from https://www.webofscience.com/
On-line load balancing of temporary tasks revisited (Journal article)
Lam, T. -W., Ting, H. -F., To, K. -K., & Wong, W. -H. (2002). On-line load balancing of temporary tasks revisited. Theoretical Computer Science, 270(1-2), 325-340. doi:10.1016/s0304-3975(00)00392-3DOI: 10.1016/s0304-3975(00)00392-3
2001
A 5-Competitive On-line Scheduler for Merging Video Streams (Conference Paper)
Chan, W. -T., Lam, T. -W., Ting, H. -F., & W.H. Wong, P. (2001). A 5-Competitive On-line Scheduler for Merging Video Streams. In Workshop on Scheduling and Telecommunications (IWST) (pp. 2165-2172). San Franciso, USA: IEEE Computer Socieyt.
Improved On-line Stream Merging: from a Restricted to a General Setting (Conference Paper)
Chan, W. -T., Lam, T. -W., Ting, H. -F., & W.H. Wong, P. (2001). Improved On-line Stream Merging: from a Restricted to a General Setting. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON) (pp. 432-442). Gulin, China: Springer.
1999
On-line Load Balancing of Temporary Tasks Revisited (Conference Paper)
Keung To, K., & W.H. Wong, P. (1999). On-line Load Balancing of Temporary Tasks Revisited. In International Symposium of Algorithms and Computation (ISAAC) (pp. 103-112). Chennai, India: Springer.
Undated
Theoretical Computer Science – Fundmentals of Computation Theory (Book)
Gasieniec, L., Martin, R., Wolter, F., & Wong, P. (Eds.) (n.d.). Theoretical Computer Science – Fundmentals of Computation Theory. Elsevier.
