The following pages link to Tak-Wah Lam (Q235652):
Displayed 50 items.
- Tradeoff between Energy and Throughput for Online Deadline Scheduling (Q3075449) (← links)
- Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data (Q3075460) (← links)
- Edit Distance to Monotonicity in Sliding Windows (Q3104657) (← links)
- (Q3113704) (← links)
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window (Q3113747) (← links)
- (Q3129918) (← links)
- (Q3140396) (← links)
- Online Flow Time Scheduling in the Presence of Preemption Overhead (Q3167387) (← links)
- Cache-Oblivious Index for Approximate String Matching (Q3506907) (← links)
- Scheduling for Speed Bounded Processors (Q3521936) (← links)
- Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling (Q3532578) (← links)
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count (Q3541124) (← links)
- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window (Q3558912) (← links)
- Indexing Similar DNA Sequences (Q3578373) (← links)
- A unified analysis of hot video schedulers (Q3579224) (← links)
- Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling (Q3581493) (← links)
- Non-clairvoyant Speed Scaling for Weighted Flow Time (Q3586448) (← links)
- An Experimental Study of Compressed Indexing and Local Alignments of DNA (Q3611977) (← links)
- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy (Q3638071) (← links)
- (Q4249526) (← links)
- (Q4250211) (← links)
- (Q4252292) (← links)
- (Q4252341) (← links)
- AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT (Q4294713) (← links)
- (Q4370211) (← links)
- Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation (Q4406291) (← links)
- (Q4437498) (← links)
- (Q4472521) (← links)
- (Q4472525) (← links)
- Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees (Q4507366) (← links)
- (Q4526970) (← links)
- (Q4553240) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- Computing and Combinatorics (Q4681179) (← links)
- (Q4708569) (← links)
- (Q4779165) (← links)
- (Q4808661) (← links)
- Performance guarantee for edf under overload (Q4815773) (← links)
- Finding Connected Components in O(log n log log n) Time on the EREW PRAM (Q4837541) (← links)
- (Q4875165) (← links)
- (Q4938785) (← links)
- (Q4953351) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- Algorithms and Computation (Q5191652) (← links)
- APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES (Q5249276) (← links)
- A Linear Size Index for Approximate Pattern Matching (Q5307492) (← links)
- Combinatorial Pattern Matching (Q5315351) (← links)
- Combinatorial Pattern Matching (Q5315352) (← links)
- Nonmigratory Online Deadline Scheduling on Multiprocessors (Q5317168) (← links)
- Energy Efficient Deadline Scheduling in Two Processor Systems (Q5387780) (← links)