Check out my first novel, midnight's simulacra!
Computer science eponyms: Difference between revisions
From dankwiki
No edit summary |
No edit summary |
||
| Line 351: | Line 351: | ||
* Tarjan's Dynamic Tree | * Tarjan's Dynamic Tree | ||
* Tarjan's Least Common Ancestors Algorithm | * Tarjan's Least Common Ancestors Algorithm | ||
* The nondeterministic '''Tarski–Kuratowski algorithm''' produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy. | |||
* Thompson Automata | * Thompson Automata | ||
* Timsort | * Timsort | ||
