Computer science eponyms

Dank — Wed, 14 Oct 2026 12:30:30 GMT

← Older revision		Revision as of 12:30, 14 October 2026
Line 212:		Line 212:
	* 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>)
			* the '''Harmanis-Stearns conjecture''' claims that if a real number ''x'' is produced in O(n) time in some base ''b ≥ 2'', x must be rational or transcendental. if true, it implies that there is no O(n) algorithm for multiplication (<i>Trans AMS</i> 1965).
	* '''Heap's algorithm''' generates all permutations of a set with minimum movement (<i>The Computer Journal 1963</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]

dankwiki - recent changes [en]