The following pages link to John Tromp (Q671362):
Displaying 36 items.
- On the vector space of the automatic reals (Q671363) (← links)
- Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- (Q1125441) (redirect page) (← links)
- On the linear-cost subtree-transfer distance between phylogenetic trees (Q1125442) (← links)
- Inferring a DNA sequence from erroneous copies (Q1390940) (← links)
- Small weight bases for Hamming codes (Q1391316) (← links)
- On spaced seeds for similarity search (Q1827801) (← links)
- Lower bounds on learning decision lists and trees (Q1917100) (← links)
- The number of legal Go positions (Q1989587) (← links)
- A googolplex of Go games (Q1989589) (← links)
- The complexity of the single individual SNP haplotyping problem (Q2461636) (← links)
- Time and space bounds for reversible simulation (Q2766195) (← links)
- Mutual search (Q3158548) (← links)
- Prefix Reversals on Binary and Ternary Strings (Q3519196) (← links)
- (Q4247446) (← links)
- (Q4250216) (← links)
- (Q4281501) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- How to share concurrent wait-free variables (Q4371684) (← links)
- (Q4473230) (← links)
- (Q4535080) (← links)
- (Q4536692) (← links)
- Algorithmic statistics (Q4544681) (← links)
- Lower bounds on learning decision lists and trees (Q4596650) (← links)
- Correction to "Algorithmic statistics" (Q4677564) (← links)
- (Q4780793) (← links)
- (Q4808662) (← links)
- Kolmogorov Random Graphs and the Incompressibility Method (Q4943756) (← links)
- Randomized two-process wait-free test-and-set (Q5138376) (← links)
- Prefix Reversals on Binary and Ternary Strings (Q5429373) (← links)
- Combinatorics of Go (Q5434458) (← links)
- (Q5448306) (← links)
- (Q5457044) (← links)
- (Q5501820) (← links)
- Small weight bases for hamming codes (Q6085712) (← links)
