Computer science eponyms: Difference between revisions
how was i missing the curry-howard correspondence? |
No edit summary |
||
| Line 132: | Line 132: | ||
* '''Edmonds's matching algorithm''' constructs maximum matchings on graphs in O(|E||V|²) | * '''Edmonds's matching algorithm''' constructs maximum matchings on graphs in O(|E||V|²) | ||
* Edmonds-Karp Algorithm | * Edmonds-Karp Algorithm | ||
* ElGamal encryption | |||
* ElGamal signatures | |||
* van Emde Boas trees | |||
* Sieve of Eratosthenes | |||
* Euclid's Algorithm | * Euclid's Algorithm | ||
| Line 139: | Line 143: | ||
* Fibonacci Heap | * Fibonacci Heap | ||
* Fisher-Yates shuffle | * Fisher-Yates shuffle | ||
* Flajolet-Martin algorithm | |||
* Fletcher's Checksum | * Fletcher's Checksum | ||
* Floyd's Algorithm | * Floyd's Algorithm | ||
| Line 181: | Line 186: | ||
* Guttman-Rosler transform | * Guttman-Rosler transform | ||
* Hamiltonian path problem | |||
* Hamming code | * Hamming code | ||
* Hamming distance | * Hamming distance | ||
| Line 186: | Line 192: | ||
* Hennessy-Milner Logic | * Hennessy-Milner Logic | ||
* Herlihy's wait-free hierarchy | * Herlihy's wait-free hierarchy | ||
* Hindley-Milner type system | |||
* Hirschberg's Algorithm | * Hirschberg's Algorithm | ||
* Hoare logic | * Hoare logic | ||
| Line 194: | Line 201: | ||
* Hopfield net | * Hopfield net | ||
* Horn clauses | * Horn clauses | ||
* Hough transform | |||
* Householder transformation | * Householder transformation | ||
* Huet's Zipper | * Huet's Zipper | ||
* Huffman coding | |||
* Hunt-McIlroy Algorithm | * Hunt-McIlroy Algorithm | ||
| Line 260: | Line 269: | ||
* Liskov's Substitution Principle | * Liskov's Substitution Principle | ||
* Lloyd's algorithm | * Lloyd's algorithm | ||
* Loop subdivision surfaces | |||
* '''Loss-DiVincenzo machines''' are quantum computers based off electron spin as confined to quantum dots | * '''Loss-DiVincenzo machines''' are quantum computers based off electron spin as confined to quantum dots | ||
* Luby's algorithm | * Luby's algorithm | ||
| Line 297: | Line 307: | ||
* '''Paeth-Tanaka Algorithm''' rotates images via a method of three shears | * '''Paeth-Tanaka Algorithm''' rotates images via a method of three shears | ||
* '''Paeth Filter''' performs 2D image compression in PNG | * '''Paeth Filter''' performs 2D image compression in PNG | ||
* PageRank Algorithm | |||
* Peterson's Algorithm | * Peterson's Algorithm | ||
* Petri nets | |||
* Petrick's method | * Petrick's method | ||
* Phong shading | * Phong shading | ||
| Line 377: | Line 389: | ||
* Verhoeff Algorithm | * Verhoeff Algorithm | ||
* Viola-Jones face detection | * Viola-Jones face detection | ||
* Viterbi algorithm | |||
* Volder's algorithm | * Volder's algorithm | ||
* von Neumann architecture | * von Neumann architecture | ||