Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
* Aanderaa–Rosenberg Conjecture | * Aanderaa–Rosenberg Conjecture | ||
**Adam7 Algorithm** is a 2D, 7-pass interlacing scheme optionally used by PNG due to Adam Costello | * **Adam7 Algorithm** is a 2D, 7-pass interlacing scheme optionally used by PNG due to Adam Costello | ||
* '''Adelson-Velskii-Landis Trees''' are self-height-balancing binary search trees, optimizing for lookup over modification viz. red-black trees | * '''Adelson-Velskii-Landis Trees''' are self-height-balancing binary search trees, optimizing for lookup over modification viz. red-black trees | ||
* The '''Aho-Corasick Algorithm''' extends the Knuth-Morris-Pratt automaton to match multiple strings in one pass of a text | * The '''Aho-Corasick Algorithm''' extends the Knuth-Morris-Pratt automaton to match multiple strings in one pass of a text | ||