Computer science eponyms: Difference between revisions
No edit summary |
heap's algorithm |
||
| Line 208: | Line 208: | ||
* Hamming distance | * Hamming distance | ||
* the '''Håstad, Just, Lagarias, and Schnorr (HJLS) algorithm''' improves on LLL for the integer relations problem (<i>SIAM J. Comput. 1989</i>) | * the '''Håstad, Just, Lagarias, and Schnorr (HJLS) algorithm''' improves on LLL for the integer relations problem (<i>SIAM J. Comput. 1989</i>) | ||
* '''Heap's algorithm''' generates all permutations of a set with minimum movement (<i>The Computer Journal 1963</i>) | |||
* '''Heckel's algorithm''' isolates changes between files, and is the basis for <tt>diff</tt> [https://dl.acm.org/doi/10.1145/359460.359467 CACM 1978] | * '''Heckel's algorithm''' isolates changes between files, and is the basis for <tt>diff</tt> [https://dl.acm.org/doi/10.1145/359460.359467 CACM 1978] | ||
* Hennessy-Milner Logic | * Hennessy-Milner Logic | ||