Check out my first novel, midnight's simulacra!
Computer science eponyms: Difference between revisions
From dankwiki
(some long-missing basics) |
(adler-32) |
||
| Line 10: | Line 10: | ||
* '''Aanderaa–Rosenberg Conjecture''' suggests that non-trivial monotonicity properties of undirected graphs can only be solved by ''Ω(N<sup>2</sup>)'' algorithms on ''N'' vertices (these are all evasive decision trees on all possible edges) | * '''Aanderaa–Rosenberg Conjecture''' suggests that non-trivial monotonicity properties of undirected graphs can only be solved by ''Ω(N<sup>2</sup>)'' algorithms on ''N'' vertices (these are all evasive decision trees on all possible edges) | ||
* '''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 | ||
* the '''Adler-32''' checksum trades reliability for speed relative to CRCs of the same length, and is included in Mark Adler's zlib | |||
* '''Adleman's Theorem''' states that P/poly contains all problems solvable in randomized polynomial time | * '''Adleman's Theorem''' states that P/poly contains all problems solvable in randomized polynomial time | ||
* '''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 | ||
| Line 133: | Line 134: | ||
* Fibonacci Heap | * Fibonacci Heap | ||
* Fisher-Yates shuffle | * Fisher-Yates shuffle | ||
* Fletcher's Checksum | * Fletcher's Checksum | ||
* Floyd's Algorithm | * Floyd's Algorithm | ||
* Floyd-Steinberg dithering | * Floyd-Steinberg dithering | ||
