The following pages link to Ming-Yang Kao (Q321024):
Displaying 11 items.
- Optimal search for parameters in Monte Carlo simulation for derivative pricing (Q321025) (← links)
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373) (← links)
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434) (← links)
- (Q4796191) (← links)
- Algorithm Theory - SWAT 2004 (Q5315401) (← links)
- Optimal augmentation for bipartite componentwise biconnectivity in linear time (Q6487441) (← links)
