The following pages link to Ming Li (Q672057):
Displaying 50 items.
- (Q582086) (redirect page) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- Iterative belief revision in extended logic programming (Q672058) (← links)
- \(k\) one-way heads cannot do string-matching (Q676454) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- On two open problems of 2-interval patterns (Q1019722) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- A separator theorem for one-dimensional graphs under linear mapping (Q1109791) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- On the linear-cost subtree-transfer distance between phylogenetic trees (Q1125442) (← links)
- Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis (Q1127333) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- Average case complexity under the universal distribution equals worst- case complexity (Q1198047) (← links)
- Theory and algorithms for plan merging (Q1199918) (← links)
- Optimality of wait-free atomic multiwriter variables (Q1199944) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- Bounded time-stamps (Q1261108) (← links)
- The miraculous universal distribution (Q1272403) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Kolmogorov complexity arguments in combinatorics (Q1328399) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Erratum to: Kolmogorov complexity arguments in combinatorics (Q1344241) (← links)
- Inferring a DNA sequence from erroneous copies (Q1390940) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Applying MDL to learn best model granularity (Q1583224) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Average-case analysis of algorithms using Kolmogorov complexity (Q1587331) (← links)
- Protein threading by linear programming: theoretical analysis and computational results (Q1777417) (← links)
- On spaced seeds for similarity search (Q1827801) (← links)
- Finding similar regions in many sequences (Q1869936) (← links)
- Lower bounds on learning decision lists and trees (Q1917100) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- Finding compact structural motifs (Q2271422) (← links)
- Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940) (← links)
- On the complexity of the spaced seeds (Q2643726) (← links)
- A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application (Q2719117) (← links)
- Finding similar regions in many strings (Q2819580) (← links)
- A lower bound on the average-case complexity of shellsort (Q2946997) (← links)
- Reversibility and adiabatic computation: trading time and space for energy (Q3126112) (← links)
- Learning in the Presence of Malicious Errors (Q3137710) (← links)
- On the closest string and substring problems (Q3196639) (← links)
- (Q3224097) (← links)
- Normalized quadtrees with respect to translations (Q3315037) (← links)
