Discovery - Top 10
Type
Date issued
(31)
(33)
(60)
(55)
(46)
(26)
(4)
(5)
Journal/Proceeding/Conference
(3)
(3)
(2)
(2)
(2)
(1)
(1)
(1)
(1)
(1)
(1)
Language
(260)
HKU Organizations
Search
Add filters:
Use filters to refine the search results.
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Filtering of ineffective siRNAs and improved siRNA design tool Journal:Bioinformatics | 2005 | ||
An efficient algorithm for optimizing whole genome alignment with noise Journal:Bioinformatics | 2004 | ||
Nonmigratory online deadline scheduling on multiprocessors Journal:SIAM Journal on Computing | 2005 | ||
The mutated subsequence problem and locating conserved genes Journal:Bioinformatics | 2005 | ||
A decomposition theorem for maximum weight bipartite matchings Journal:SIAM Journal on Computing | 2001 | ||
Cavity matchings, label compressions, and unrooted evolutionary trees Journal:SIAM Journal on Computing | 2000 | ||
Automatic construction of online catalog topologies Journal:IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews | 2002 | ||
Trade-offs between speed and processor in hard-deadline scheduling Proceeding/Conference:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms | 1999 | ||
Construction of online catalog topologies using decision trees Proceeding/Conference:International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems Proceedings | 2000 | ||
Dynamic dictionary matching and compressed suffix trees Proceeding/Conference:Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | ||
Improved parallel algorithms for finding connected components Proceeding/Conference:IEEE International Conference on Algorithms and Architectures for Parallel Processing | 1995 | ||
The Hong Kong Telephone Directory Enquiry System Proceeding/Conference:Asia Pacific Software Engineering Conference Proceedings | 1996 | ||
On the parallel time complexity of undirected connectivity and minimum spanning trees Proceeding/Conference:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms | 1999 | ||
Optimal edge ranking of trees in linear time Proceeding/Conference:Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms | 1998 | ||
Performance guarantee for online deadline scheduling in the presence of overload Proceeding/Conference:Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms | 2001 | ||
Performance guarantee for EDF under overload Journal:Journal of Algorithms | 2004 | ||
A tighter extra-resource analysis of online deadline scheduling Journal:Journal of Combinatorial Optimization | 2005 | ||
Extra processors versus future information in optimal deadline scheduling Proceeding/Conference:Annual ACM Symposium on Parallel Algorithms and Architectures | 2002 | ||
Competitive deadline scheduling via additional or faster processors Journal:Journal of Scheduling | 2003 | ||
Finding connected components in O(log n loglog n) time on the EREW PRAM Proceeding/Conference:Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 1993 | ||
| 1989 | |||
| 1989 | |||
Optimal EREW parallel algorithm for parenthesis matching Proceeding/Conference:Proceedings of the International Conference on Parallel Processing | 1989 | ||
Non-migratory Online Deadline Scheduling on Multiprocessors Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2004 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 |