The following pages link to Tao Jiang (Q185445):
Displaying 50 items.
- (Q2934651) (← links)
- A lower bound on the average-case complexity of shellsort (Q2946997) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- The Power of Alternating One-Reversal Counters and Stacks (Q3210175) (← links)
- (Q3355242) (← links)
- On the Minimum Common Integer Partition Problem (Q3434560) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Finding Additive Biclusters with Random Background (Q3506959) (← links)
- A Parsimony Approach to Genome-Wide Ortholog Assignment (Q3596286) (← links)
- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract) (Q3637126) (← links)
- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) (Q3639257) (← links)
- Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations (Q3654375) (← links)
- (Q3769969) (← links)
- On One-Way Cellular Arrays (Q3790658) (← links)
- (Q3811706) (← links)
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET (Q3988841) (← links)
- (Q4016519) (← links)
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations (Q4033767) (← links)
- (Q4035243) (← links)
- (Q4036599) (← links)
- (Q4246722) (← links)
- (Q4247446) (← links)
- (Q4252331) (← links)
- Minimal NFA Problems are Hard (Q4277533) (← links)
- (Q4281537) (← links)
- ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES (Q4286116) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- New Decidability Results Concerning Two-Way Counter Machines (Q4326857) (← links)
- An approximation scheme for some Steiner tree problems in the plane (Q4344454) (← links)
- Rotations of Periodic Strings and Short Superstrings (Q4360136) (← links)
- Two heads are better than two tapes (Q4377274) (← links)
- (Q4408109) (← links)
- (Q4471962) (← links)
- (Q4472526) (← links)
- A More Efficient Approximation Scheme for Tree Alignment (Q4507349) (← links)
- (Q4525729) (← links)
- (Q4535038) (← links)
- The average‐case area of Heilbronn‐type triangles* (Q4543628) (← links)
- Lower bounds on learning decision lists and trees (Q4596650) (← links)
- Inclusion is undecidable for pattern languages (Q4630269) (← links)
- New decidability results concerning two-way counter machines and applications (Q4630270) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
- Computing Phylogenetic Roots with Bounded Degrees and Errors (Q4706236) (← links)
- (Q4708595) (← links)
- (Q4778572) (← links)
- Selecting the branches for an evolutionary tree. (Q4818669) (← links)
- (Q4829027) (← links)
- Pattern languages with and without erasing (Q4839719) (← links)
- (Q4840106) (← links)
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599) (← links)
