The following pages link to Ming-Yang Kao (Q321024):
Displayed 50 items.
- (Q3798260) (← links)
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity (Q4037691) (← links)
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components (Q4202204) (← links)
- Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees (Q4202205) (← links)
- Tree Contractions and Evolutionary Trees (Q4210124) (← links)
- Optimal Constructions of Hybrid Algorithms (Q4217305) (← links)
- (Q4219033) (← links)
- Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions (Q4229417) (← links)
- (Q4251050) (← links)
- (Q4252289) (← links)
- (Q4252296) (← links)
- (Q4252417) (← links)
- On-Line Difference Maximization (Q4255809) (← links)
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs (Q4317708) (← links)
- Planar Strong Connectivity Helps in Parallel Depth-First Search (Q4326852) (← links)
- Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables (Q4337442) (← links)
- (Q4364589) (← links)
- (Q4370211) (← links)
- (Q4410125) (← links)
- (Q4410158) (← links)
- (Q4459808) (← links)
- (Q4459826) (← links)
- (Q4472482) (← links)
- (Q4472521) (← links)
- (Q4472525) (← links)
- (Q4474109) (← links)
- (Q4474111) (← links)
- (Q4505398) (← links)
- Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees (Q4507366) (← links)
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs (Q4507374) (← links)
- (Q4525735) (← links)
- (Q4526970) (← links)
- (Q4526983) (← links)
- Designing proxies for stock market indices is computationally hard<sup>*</sup> (Q4646493) (← links)
- Fast Universalization of Investment Strategies (Q4651523) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings (Q4699160) (← links)
- Common-Face Embeddings of Planar Graphs (Q4706199) (← links)
- (Q4737217) (← links)
- (Q4796191) (← links)
- Data Security Equals Graph Connectivity (Q4875438) (← links)
- (Q4938779) (← links)
- (Q4938785) (← links)
- (Q4942637) (← links)
- Reducing Randomness via Irrational Numbers (Q4943867) (← links)
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors (Q4943883) (← links)
- (Q4952644) (← links)
- (Q4953351) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Linear-time accurate lattice algorithms for tail conditional expectation (Q5168380) (← links)