The following pages link to Tak-Wah Lam (Q235652):
Displayed 50 items.
- (Q203732) (redirect page) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- A linear size index for approximate pattern matching (Q655440) (← links)
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Deadline scheduling and power management for speed bounded processors (Q708210) (← links)
- On-line stream merging with max span and min coverage (Q814921) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Non-overlapping common substrings allowing mutations (Q942988) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- (Q1129004) (redirect page) (← links)
- An improved scheme for set equality testing and updating (Q1129006) (← links)
- Results on communication complexity classes (Q1190990) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Approximating biconnectivity in parallel (Q1393085) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- On-line stream merging in a general setting. (Q1401256) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Approximating frequent items in asynchronous data stream over a sliding window (Q1736485) (← links)
- A tighter extra-resource analysis of online deadline scheduling (Q1781800) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Scheduling for weighted flow time and energy with rejection penalty (Q1935814) (← links)
- Selecting the \(k\) largest elements with parity tests (Q1975371) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Online speed scaling based on active job count to minimize flow plus energy (Q2392927) (← links)
- RENET: a deep learning approach for extracting gene-disease associations from literature (Q2415283) (← links)
- Continuous monitoring of distributed data streams over a time-based sliding window (Q2428698) (← links)
- Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
- Competitive deadline scheduling via additional or faster processors (Q2464388) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- A Decomposition Theorem for Maximum Weight Bipartite Matchings (Q2719128) (← links)
- (Q2723946) (← links)
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434) (← links)
- (Q2768377) (← links)
- (Q2845522) (← links)
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models (Q2896385) (← links)
- (Q2921649) (← links)
- Optimizing throughput and energy in online deadline scheduling (Q2930284) (← links)
- (Q2934666) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Compressed indexes for dynamic text collections (Q2944558) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)
- Energy-Efficient Due Date Scheduling (Q2999335) (← links)
- Sleep Management on Multiple Machines for Energy and Flow Time (Q3012808) (← links)