The following pages link to Ming-Yang Kao (Q321024):
Displaying 45 items.
- (Q235176) (redirect page) (← links)
- 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)
- Online matching with blocked input (Q1178205) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- A unifying augmentation algorithm for two-edge connectivity and biconnectivity (Q1282207) (← links)
- Simple efficient graph compression schemes for dense and complement graphs (Q1288471) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750) (← links)
- Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants (Q1369752) (← links)
- Optimal on-line scheduling of parallel jobs with dependencies (Q1383801) (← links)
- The enhanced double digest problem for DNA physical mapping (Q1411339) (← links)
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- A Decomposition Theorem for Maximum Weight Bipartite Matchings (Q2719128) (← links)
- (Q2721996) (← links)
- (Q2723946) (← links)
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434) (← links)
- (Q2768376) (← links)
- Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets (Q2784454) (← links)
- Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns (Q2784464) (← links)
- Optimal buy-and-hold strategies for financial markets with bounded daily returns (Q2819540) (← links)
- Computing Minimum Tile Sets to Self-Assemble Color Patterns (Q2872134) (← links)
- Randomized fast design of short DNA words (Q2930269) (← links)
- Parallel Depth-First Search in General Directed Graphs (Q3034839) (← links)
- Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences (Q3058527) (← links)
- Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems (Q3070959) (← links)
- (Q3105285) (← links)
- (Q3128898) (← links)
- Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test (Q3136617) (← links)
- (Q3140448) (← links)
- Discovering almost any hidden motif from multiple sequences (Q3189008) (← links)
- The risk profile problem for stock portfolio optimization (extended abstract) (Q3191989) (← links)
- (Q3365739) (← links)
- An Approximation Algorithm for a Bottleneck Traveling Salesman Problem (Q3434559) (← links)
- Optimal Constructions of Hybrid Algorithms (Q4217305) (← links)
- Optimal augmentation for bipartite componentwise biconnectivity in linear time (Q6487441) (← links)
